Bootstrap percolation on the Hamming torus

DOI10.1214/13-AAP996MaRDI QIDQ2258533zbMATH OpenOpenAlexFDO

Authors Janko Gravner, James Pfeiffer, David Sivakoff, Christopher Hoffman

Publication date 26 February 2015

Published in The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1202.5351, https://projecteuclid.org/euclid.aoap/1418740187

zbMATH Keywords

bootstrap percolationcritical exponentHamming torusPoisson convergence

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Abstract: The Hamming torus of dimension $d$ is the graph with vertices ${1,dots,n}^d$ and an edge between any two vertices that differ in a single coordinate. Bootstrap percolation with threshold $heta$ starts with a random set of open vertices, to which every vertex belongs independently with probability $p$, and at each time step the open set grows by adjoining every vertex with at least $heta$ open neighbors. We assume that $n$ is large and that $p$ scales as $n^{-alpha}$ for some $alpha>1$, and study the probability that an $i$-dimensional subgraph ever becomes open. For large $heta$, we prove that the critical exponent $alpha$ is about $1+d/heta$ for $i=1$, and about $1+2/heta+Theta(het{a}^{-3/2})$ for $ige2$. Our small $heta$ results are mostly limited to $d=3$, where we identify the critical $alpha$ in many cases and, when $heta=3$, compute exactly the critical probability that the entire graph is eventually open.

Recommendations

• Bootstrap percolation in three dimensions
• Bootstrap percolation in high dimensions
• Sharp thresholds in bootstrap percolation
• The sharp threshold for bootstrap percolation in all dimensions
• Site Percolation on the d-Dimensional Hamming Torus

Cites work

• A sharper threshold for bootstrap percolation in two dimensions
• Bootstrap percolation in three dimensions
• Bootstrap percolation on the hypercube
• Bootstrap percolation on the random graph \(G_{n,p}\)
• Every monotone graph property has a sharp threshold
• Finite size scaling in three-dimensional bootstrap percolation
• scientific article; zbMATH DE number 52632 (Why is no real title available?)
• Integrals, partitions, and cellular automata
• Majority Bootstrap Percolation on the Hypercube
• Metastability effects in bootstrap percolation
• On the behavior of some cellular automata related to bootstrap percolation
• Proof of Straley's argument for bootstrap percolation.
• Random subgraphs of finite graphs. II: The lace expansion and the triangle condition
• Random subgraphs of the 2D Hamming graph: The supercritical phase
• Sharp metastability threshold for two-dimensional bootstrap percolation
• Site Percolation on the d-Dimensional Hamming Torus
• The sharp threshold for bootstrap percolation in all dimensions
• The threshold regime of finite volume bootstrap percolation.

Cited in

(8)

• Neighborhood growth dynamics on the Hamming plane
• Bootstrap percolation on the product of the two-dimensional lattice with a Hamming square
• Percolating sets in bootstrap percolation on the Hamming graphs and triangular graphs
• Line Percolation in Finite Projective Planes
• Maximal spanning time for neighborhood growth on the Hamming plane
• Site Percolation on the d-Dimensional Hamming Torus
• Two-dimensional supercritical growth dynamics with one-dimensional nucleation
• Bootstrap percolation on the high-dimensional Hamming graph

This page was built for publication: Bootstrap percolation on the Hamming torus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2258533)