REVIEW 2 cited by
The peeling process of infinite Boltzmann planar maps
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
The peeling process of infinite Boltzmann planar maps
read the original abstract
We start by studying a peeling process on finite random planar maps with faces of arbitrary degrees determined by a general weight sequence, which satisfies an admissibility criterion. The corresponding perimeter process is identified as a biased random walk, in terms of which the admissibility criterion has a very simple interpretation. The finite random planar maps under consideration were recently proved to possess a well-defined local limit known as the infinite Boltzmann planar map (IBPM). Inspired by recent work of Curien and Le Gall, we show that the peeling process on the IBPM can be obtained from the peeling process of finite random maps by conditioning the perimeter process to stay positive. The simplicity of the resulting description of the peeling process allows us to obtain the scaling limit of the associated perimeter and volume process for arbitrary regular critical weight sequences.
Forward citations
Cited by 2 Pith papers
-
A bijective topological recursion for maps
Iterating Tutte's edge-erasing procedure until the topology changes yields a bijective pair-of-pants excision that reproduces (blobbed) topological recursion for maps and stuffed maps.
-
A bijective topological recursion for maps
A bijective skinning procedure yields the topological recursion for maps of arbitrary topology at the level of formal generating series, with no analyticity assumptions, including stuffed maps and a combinatorial recu...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.