Markovian explorations of random planar maps are roundish

From MaRDI portal
Publication:3389216

DOI10.24033/BSMF.2821zbMATH Open1462.05325arXiv1902.10624OpenAlexW4288555328MaRDI QIDQ3389216FDOQ3389216


Authors: Nicolas Curien, Cyril Marzouk Edit this on Wikidata


Publication date: 10 May 2021

Published in: Bulletin de la Société mathématique de France (Search for Journal in Brave)

Abstract: The infinite discrete stable Boltzmann maps are "heavy-tailed" generalisations of the well-known Uniform Infinite Planar Quadrangulation. Very efficient tools to study these objects are Markovian step-by-step explorations of the lattice called peeling processes. Such a process depends on an algorithm which selects at each step the next edge where the exploration continues. We prove here that, whatever this algorithm, a peeling process always reveals about the same portion of the map, thus growing roughly metric balls. Applied to well-designed algorithms, this easily enables us to compare distances in the map and in its dual, as well as to control the so-called pioneer points of the simple random walk, both on the map and on its dual.


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




Recommendations




Cites Work


Cited In (6)





This page was built for publication: Markovian explorations of random planar maps are roundish

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3389216)