The time constant and critical probabilities in percolation models
Leandro P. R. Pimentel
Abstract
We consider a first-passage percolation model on a Delaunay triangulation of the plane. In this model each edge is independently equipped with a nonnegative random variable, with distribution function F, which is interpreted as the time it takes to traverse the edge. Vahidi-Asl and Wierman have shown that, under a suitable moment condition on F, the minimum time taken to reach a point x from the origin 0 is asymptotically μ(F)|x|, where μ(F) is a nonnegative finite constant. However the exact value of the time constant μ(F) still a fundamental problem in percolation theory. Here we prove that if F(0)<1-pc* then μ(F)>0, where pc* is a critical probability for bond percolation on the dual graph (Voronoi tessellation).
Create a lesson
Related papers
Boolean Small-Ball Inequalities for Discrepancy Theory
Emrullah Akbas, Suvrit Sra
Markovian renormalisation for percolation in high-dimension: Semi-decidability of mean field behavior
Arthur Blanc-Renaudie
Point process convergence of large inradii of Poisson-Laguerre tessellations
Matthias Schulte, Martina Švarc Petráková
Interpolation of Gaussian Free Fields via Random Matrices
Gabriel Raposo
Almost-Uniform Bayesian Convergence to the Truth Is Not Characterized by Countable Additivity on Conditional Hitting Times
M. Ali Khan, Arthur Paul Pedersen, Maxwell B. Stinchcombe
The skeleton-blocks decomposition of Bienaymé trees, and applications to their local convergence
Marc Bernard, Robin Stephenson