We prove locality of the critical probability for Bernoulli site percolation on infinite, connected, locally finite, vertex-transitive graphs, under the usual assumption that the critical probabilities stay uniformly below one. The proof develops site-percolation forms of the two-ghost inequality, sharp-threshold and snowballing estimates, and the nonunimodular height method. We also establish the plentiful-tube geometry needed for the multiscale argument from quantitative structure and random-walk estimates.
For simple random walk on infinite clusters of Bernoulli bond percolation on Cayley graphs of hyperbolic groups, we prove that the drift and asymptotic entropy depend continuously on the percolation parameter throughout the supercritical phase. Together with the dimension formula, this implies continuity of the Hausdor...
For Bernoulli bond percolation on every regular tree of degree at least three, we prove that infinite clusters appear strictly before absolutely continuous spectrum. Throughout an explicit supercritical interval, the adjacency operator of every open cluster almost surely has no absolutely continuous component. Together...
We study Bernoulli percolation and its universality classes on hierarchical lattices generated by edge iterated graph systems (EIGS). By examining eight critical exponents, we prove that no finite family of substitution-multiplicative dimensions completely determines universality, providing a rigorous proof of the fail...
In this paper, we investigate models of percolation of words on $\mathbb{Z}_+$ with long-range connections. The underlying graph is oriented and constructed according to a sequence of non-negative ranges. In the first model, the sequence of ranges is considered random and, in the second model, deterministic and non-dec...
We determine the critical probability for Bernoulli bond percolation on essentially any finite graph. Namely, letting $\lambda(G)$ denote the spectral radius (maximum eigenvalue) of $G$, we prove that the critical probability is at $1/\lambda(G)$: above this probability there is typically a component of order $\Omega(\...
We study the structure of random $d$-regular triangle-free graphs and show that a sharp phase transition occurs at $d=\frac{\sqrt 3}{2}\sqrt{n \log n}$. For smaller $d$, asymptotically almost surely the graph is non-bipartite, whereas for greater $d$, asymptotically almost surely the graph is bipartite.
Gregory Decamillis, Gao Pu· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
