Bootstrap percolation on products of cycles and complete graphs

13 May 2015 Gravner Janko Sivakoff David

Bootstrap percolation on a graph iteratively enlarges a set of occupied sites by adjoining points with at least $\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product measure, and we say that spanning occurs if every point eventually becomes occupied... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • PROBABILITY