Quantitative Russo-Seymour-Welsh for random walk on random graphs and decorrelation of uniform spanning trees
From MaRDI portal
Publication:6091972
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Random walks on graphs (05C81) Processes in random environments (60K37) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Percolation (82B43)
Abstract: We prove a quantitative Russo-Seymour-Welsh (RSW) type result for random walks on two natural examples of random planar graphs: the supercritical percolation cluster in the square lattice and the Poisson Voronoi triangulation in the plane. More precisely, we prove that the probability that a simple random walk crosses a rectangle in the hard direction with uniformly positive probability is stretched exponentially likely in the size of the rectangle. As an application we prove a near optimal decorrelation result for uniform spanning trees for such graphs. This is the key missing step in this setup while applying of the proof stretegy of a previous article on universality of dimers ("Dimers and imaginary geometry." Ann. Probab. 48 (1) 1 - 52) where random walk RSW was assumed to hold with probability 1. Applications to almost sure Gaussian free field scaling limit for dimers on Temperleyan type modification on such graphs are also discussed.
Recommendations
- Spectral dimension and random walks on the two dimensional uniform spanning tree
- Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on planar graphs
- Random-cluster measures and uniform spanning trees
- scientific article; zbMATH DE number 953290
- scientific article; zbMATH DE number 1195780
Cites work
- scientific article; zbMATH DE number 1256746 (Why is no real title available?)
- Dimer model and holomorphic functions on t‐embeddings of planar graphs
- Dimers and imaginary geometry
- Discrete complex analysis on isoradial graphs
- Domination by product measures
- Dominos and the Gaussian free field.
- Large deviations for the chemical distance in supercritical Bernoulli percolation
- Lectures on the Ising and Potts models on the hypercubic lattice
- Loop-erased random walk and Poisson kernel on planar graphs
- On the chemical distance for supercritical Bernoulli percolation
- Probability on trees and networks
- Quenched invariance principle for random walks on Delaunay triangulations
- Quenched invariance principle for simple random walk on percolation clusters
- Random walks on supercritical percolation clusters
- Sixty years of percolation
- The dimer model in statistical mechanics
- Trees and matchings
This page was built for publication: Quantitative Russo-Seymour-Welsh for random walk on random graphs and decorrelation of uniform spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6091972)