The coupling of uniform spanning trees and quantitative Russo-Seymour-Welsh for random walk on random graphs
| dc.contributor.author | Yu, Tingzhou | |
| dc.contributor.supervisor | Ray, Gourab | |
| dc.date.accessioned | 2021-08-25T22:14:01Z | |
| dc.date.available | 2021-08-25T22:14:01Z | |
| dc.date.copyright | 2021 | en_US |
| dc.date.issued | 2021-08-25 | |
| dc.degree.department | Department of Mathematics and Statistics | |
| dc.degree.level | Master of Science M.Sc. | en_US |
| dc.description.abstract | The central concern of this thesis is the study of the Russo-Seymour-Welsh (RSW) theory. The first contribution of this thesis is a macroscopic decorrelation result for uniform spanning trees (USTs) on random planar graphs based on the RSW assumption. A similar result was established on a fixed graph in [BLR20, Theorem 4.21]. We extend this result to USTs on random graphs. In particular, we show that a similar coupling can be obtained for a collection of graphs, which has a high probability. This is the key missing step in the application of the proof strategy in [BLR20] for random graphs, which established the scaling limits of height function of dimer model to a Gaussian free field on a fairly general class of fixed graphs. The second contribution of this thesis is the RSW type results for random walks on two concrete and natural examples: the unique infinite cluster of supercritical bond percolation in $\Z^2$ and the Poisson-Delaunay triangulation in $\R^2$. We show that random walks crossing a rectangle without exiting occurs with a stretched exponentially high in the scale. The main tool used in the proof is heat kernel estimates for random walks on the supercritical bond percolation. The proof of RSW for bond percolation is a quick application of a combination of Barlow's results. However, we cannot apply Barlow's results for the Delaunay triangulation directly since there is no uniform bound on degree. A key input is a quantitative isoperimetric inequality for the Delaunay triangulation, which we consider to be another novel contribution of this thesis. | en_US |
| dc.description.scholarlevel | Graduate | en_US |
| dc.identifier.bibliographicCitation | Ray, Gourab, and Yu, Tingzhou. "Quantitative Russo-Seymour-Welsh for random walk on random graphs and decorrelation of UST." arXiv preprint arXiv:2106.10323 (2021). | en_US |
| dc.identifier.uri | http://hdl.handle.net/1828/13316 | |
| dc.language | English | eng |
| dc.language.iso | en | en_US |
| dc.rights | Available to the World Wide Web | en_US |
| dc.subject | uniform spanning trees | en_US |
| dc.subject | Russo–Seymour–Welsh | en_US |
| dc.subject | random walk | en_US |
| dc.subject | random graphs | en_US |
| dc.subject | Bernoulli percolation | en_US |
| dc.subject | Delaunay triangulation | en_US |
| dc.title | The coupling of uniform spanning trees and quantitative Russo-Seymour-Welsh for random walk on random graphs | en_US |
| dc.type | Thesis | en_US |