Return to Colloquia & Seminar listing
Random Site Subgraphs of the Hamming Torus
Probability| Speaker: | David Sivakoff, UC Davis |
| Location: | 1147 MSB |
| Start time: | Wed, Dec 2 2009, 4:10PM |
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 novel application of multitype branching processes.