Return to Colloquia & Seminar listing
Random Site Subgraphs of the Hamming Torus
Student-Run Discrete Mathematics| Speaker: | David Sivakoff, UC Davis |
| Location: | 2112 MSB |
| Start time: | Thu, May 6 2010, 12:10PM |
Description
The critical threshold for the emergence of a giant component in
the random site subgraph of a d-dimensional Hamming torus is given by the
positive root of a polynomial. This value is distinct from the critical
threshold for the random edge subgraph of the Hamming torus. Most
interestingly, the proof uses a comparison with a multitype branching
process. My talk will be based on a job talk that I gave in February, and
no prior knowledge of any of the aforementioned topics will be assumed.