Quantitative Russo-Seymour-Welsh for random walk on random graphs and decorrelation of uniform spanning trees

DOI10.1007/S10959-023-01248-7arXiv2106.10323OpenAlexW4372358176MaRDI QIDQ6091972FDOQ6091972

Authors: Gourab Ray, Tingzhou Yu 

Publication date: 21 November 2023

Published in: Journal of Theoretical Probability (Search for Journal in Brave)

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.

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

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

zbMATH Keywords

random environmentdimeruniform spanning treeGaussian-free field

Mathematics Subject Classification ID

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)

Cites Work

• Title not available (Why is that?)
• Random walks on supercritical percolation clusters
• Dominos and the Gaussian free field.
• Probability on trees and networks
• Quenched invariance principle for simple random walk on percolation clusters
• Domination by product measures
• Discrete complex analysis on isoradial graphs
• On the chemical distance for supercritical Bernoulli percolation
• Trees and matchings
• Large deviations for the chemical distance in supercritical Bernoulli percolation
• Loop-erased random walk and Poisson kernel on planar graphs
• The dimer model in statistical mechanics
• Dimers and imaginary geometry
• Lectures on the Ising and Potts models on the hypercubic lattice
• Sixty years of percolation
• Quenched invariance principle for random walks on Delaunay triangulations
• Dimer model and holomorphic functions on t‐embeddings of planar graphs

Cited In (1)

• Dimers on Riemann surfaces. II: Conformal invariance and scaling limit

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)