Javascript must be enabled

# David Sivakoff : Random Site Subgraphs of the Hamming Torus

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. The proof uses an intuitive application of multitype branching processes.

**Category**: Probability**Duration**: 01:44:54**Date**: September 16, 2010 at 4:10 PM-
**Tags:**seminar, Probability Seminar

## 0 Comments