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.

Please select playlist name from following

Report Video

Please select the category that most closely reflects your concern about the video, so that we can review it and determine whether it violates our Community Guidelines or isn’t appropriate for all viewers. Abusing this feature is also a violation of the Community Guidelines, so don’t do it.


Comments Disabled For This Video