The travel time in a finite box in supercritical Bernoulli percolation

DOI10.1214/ECP.V19-3015zbMATH Open1312.60115arXiv1307.3084OpenAlexW2104889452MaRDI QIDQ743376FDOQ743376

Raphaël Cerf

Publication date: 24 September 2014

Published in: Electronic Communications in Probability (Search for Journal in Brave)

Abstract: We consider the standard site percolation model on the three dimensional cubic lattice. Starting solely with the hypothesis that $heta(p)>0$, we prove that, for any $alpha>0$, there exists $kappa>0$ such that, with probability larger than $1-1/n^{a}lpha$, every pair of vertices inside the box $Lambda(n)$ are joined by a path having at most $kappa(lnn{)}^2$ closed sites.

Full work available at URL: https://arxiv.org/abs/1307.3084

zbMATH Keywords

Bernoulli percolationtravel time

Mathematics Subject Classification ID

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

Cited In (1)

• Embedding binary sequences into Bernoulli site percolation on \(\mathbb{Z}^3\)

This page was built for publication: The travel time in a finite box in supercritical Bernoulli percolation

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