The variance of the graph distance in the infinite cluster of percolation is sublinear
From MaRDI portal
Publication:6564534
zbMATH Open1540.60211MaRDI QIDQ6564534FDOQ6564534
Authors: Barbara Dembin 
Publication date: 1 July 2024
Published in: ALEA. Latin American Journal of Probability and Mathematical Statistics (Search for Journal in Brave)
Recommendations
- First passage percolation has sublinear distance variance.
- Sublinear variance in first-passage percolation for general distributions
- Sublinearity of the travel-time variance for dependent first-passage percolation
- Distances in the highly supercritical percolation cluster
- Sublinear variance for directed last-passage percolation
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)
Cites Work
- Dynamic Scaling of Growing Interfaces
- On Russo's approximate zero-one law
- Exponential concentration for first passage percolation through modified Poincaré inequalities
- Title not available (Why is that?)
- On the speed of convergence in first-passage percolation
- Sublinear variance in first-passage percolation for general distributions
- Weak shape theorem in first passage percolation with infinite passage times
- First passage percolation has sublinear distance variance.
- On the chemical distance for supercritical Bernoulli percolation
- Asymptotic shape for the chemical distance and first-passage percolation on the infinite Bernoulli cluster
- Edge-Isoperimetric Inequalities and Influences
- The time constant for Bernoulli percolation is Lipschitz continuous strictly above \(p_c\)
This page was built for publication: The variance of the graph distance in the infinite cluster of percolation is sublinear
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564534)
