The variance of the graph distance in the infinite cluster of percolation is sublinear

MaRDI QIDQ6564534zbMATH OpenFDO

Authors Barbara Dembin

Publication date 1 July 2024

Published in ALEA. Latin American Journal of Probability and Mathematical Statistics (Search for Journal in Brave)

zbMATH Keywords

concentrationpercolationchemical distance

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 195103 (Why is no real title available?)
• Asymptotic shape for the chemical distance and first-passage percolation on the infinite Bernoulli cluster
• Dynamic Scaling of Growing Interfaces
• Edge-Isoperimetric Inequalities and Influences
• Exponential concentration for first passage percolation through modified Poincaré inequalities
• First passage percolation has sublinear distance variance.
• On Russo's approximate zero-one law
• On the chemical distance for supercritical Bernoulli percolation
• On the speed of convergence in first-passage percolation
• Sublinear variance in first-passage percolation for general distributions
• The time constant for Bernoulli percolation is Lipschitz continuous strictly above \(p_c\)
• Weak shape theorem in first passage percolation with infinite passage times

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)