Slightly supercritical percolation on nonamenable graphs. II: Growth and isoperimetry of infinite clusters
From MaRDI portal
Publication:6145694
DOI10.1007/s00440-023-01240-6arXiv2207.00701OpenAlexW4387705881MaRDI QIDQ6145694
Publication date: 9 January 2024
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.00701
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Probability theory on algebraic and topological structures (60B99)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A stationary random graph of no growth rate
- Upper bound on the expected size of the intrinsic ball
- Percolation on a product of two trees
- Non-amenable Cayley graphs of high girth have \(p_c < p_u\) and mean-field exponents
- The Alexander-Orbach conjecture holds in high dimensions
- Tree graph inequalities and critical behavior in percolation models
- Percolation beyond \(\mathbb{Z}^ d\), many questions and a few answers
- Indistinguishability of percolation clusters
- Anchored expansion, percolation and speed. (With an appendix by Gábor Pete)
- Percolation on hyperbolic graphs
- Progress in high-dimensional percolation and random graphs
- The \(L^2\) boundedness condition in nonamenable percolation
- Supercritical percolation on nonamenable graphs: isoperimetry, analyticity, and exponential decay of the cluster size distribution
- The time constant for Bernoulli percolation is Lipschitz continuous strictly above \(p_c\)
- Self-avoiding walk on nonunimodular transitive graphs
- Continuity of the time and isoperimetric constants in supercritical percolation
- On the chemical distance for supercritical Bernoulli percolation
- The supercritical phase of percolation is well behaved
- Percolation
- On non-uniqueness of percolation on nonamenable Cayley graphs
- Regularity of the time constant for a supercritical Bernoulli percolation
- Nonuniqueness and mean-field criticality for percolation on nonunimodular transitive graphs
- A Limit Theorem for Multidimensional Galton-Watson Processes
- Multiplicity of phase transitions and mean-field criticality on highly non-amenable graphs.
- Subcritical connectivity and some exact tail exponents in high dimensional percolation
- Slightly supercritical percolation on non‐amenable graphs I: The distribution of finite clusters
- The chemical distance in random interlacements in the low-intensity regime
- High-dimensional near-critical percolation and the torus plateau
This page was built for publication: Slightly supercritical percolation on nonamenable graphs. II: Growth and isoperimetry of infinite clusters
