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

DOI10.1007/s10959-023-01248-7arXiv2106.10323OpenAlexW4372358176MaRDI QIDQ6091972

Tingzhou Yu, Gourab Ray

Publication date: 21 November 2023

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

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

zbMATH Keywords

random environmentdimeruniform spanning treeGaussian-free field

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Processes in random environments (60K37) Random walks on graphs (05C81)

Cites Work

• Discrete complex analysis on isoradial graphs
• Loop-erased random walk and Poisson kernel on planar graphs
• Quenched invariance principle for simple random walk on percolation clusters
• Domination by product measures
• Random walks on supercritical percolation clusters
• Dominos and the Gaussian free field.
• Trees and matchings
• Dimers and imaginary geometry
• Large deviations for the chemical distance in supercritical Bernoulli percolation
• Quenched invariance principle for random walks on Delaunay triangulations
• On the chemical distance for supercritical Bernoulli percolation
• Probability on Trees and Networks
• Lectures on the Ising and Potts Models on the Hypercubic Lattice
• SIXTY YEARS OF PERCOLATION
• Dimer model and holomorphic functions on t‐embeddings of planar graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Quantitative Russo-Seymour-Welsh for random walk on random graphs and decorrelation of uniform spanning trees