EVENT DETAILS AND ABSTRACT

Title: Long-range Bootstrap Percolation
Speaker: Janko Gravner
Speaker Info: University of California, Davis
Brief Description:
Special Note:
Abstract:

Bootstrap percolation on a graph is a simple deterministic process that iteratively enlarges a set of occupied sites by adjoining points with at least a threshold number of occupied neighbors. The initially occupied set is random, given by a uniform product measure with a low density. Bootstrap percolation on integer lattices is a classic model. This talk will focus on recent results for this model for graphs with long-range connectivity, specifically Hamming graphs and their Cartesian products with lattices, which are joint work with David Sivakoff and Erik Slivken.