Uniform mixing time and bottlenecks in uniform finite quadrangulations
From MaRDI portal
Publication:6367371
arXiv2105.04975MaRDI QIDQ6367371FDOQ6367371
Authors: Thomas Lehéricy 
Publication date: 11 May 2021
Abstract: We prove a lower bound on the size of bottlenecks in uniform quadrangulations, valid at all scales simultaneously. We use it to establish upper bounds on the uniform mixing time of the lazy random walk on uniform quadrangulations, as well as on their dual. The proofs involve an explicit computation of the Laplace transform of the number of faces in truncated hulls of the uniform infinite plane quadrangulation.
Random graphs (graph-theoretic aspects) (05C80) Geometric probability and stochastic geometry (60D05)
This page was built for publication: Uniform mixing time and bottlenecks in uniform finite quadrangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6367371)
