pith. sign in

arxiv: 2604.24677 · v1 · submitted 2026-04-27 · 🧮 math.PR · math.CO

Local Limit of Random Regular Bipartite Planar Maps

Nicolas Tokka This is my paper

Pith reviewed 2026-05-08 01:56 UTC · model grok-4.3

classification 🧮 math.PR math.CO
keywords local limitrandom planar mapsbipartite mapsregular degreeblossoming treesrandom walk recurrenceone-ended maps
0
0 comments X

The pith

Uniform random d-regular bipartite planar maps converge locally to an infinite one-ended recurrent object for every d at least 3.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper shows that as the number of vertices tends to infinity, a uniform random d-regular bipartite planar map looks more and more like a specific infinite limiting map when viewed from any fixed-size neighborhood. This limit is almost surely one-ended and the simple random walk on it returns to its starting vertex with probability one. A reader would care because the local limit lets one read off asymptotic probabilities for local events in large finite maps directly from the infinite object. The argument proceeds by first establishing local convergence for a family of decorated blossoming trees that are in bijection with the maps, then extending that bijection to the infinite setting so the convergence passes to the maps themselves.

Core claim

We prove the existence of the local limit of uniform random d-regular bipartite planar maps, for every d≥3, as the number of vertices tends to infinity. The limiting object is almost surely one-ended and recurrent for the simple random walk. The proof relies on a bijection between maps and so-called blossoming trees established in a previous work. After proving local convergence of the associated decorated trees, we extend the bijection to infinite trees and transfer the convergence to planar maps.

What carries the argument

The bijection between finite d-regular bipartite planar maps and blossoming trees, extended to infinite trees so that local convergence of the trees implies local convergence of the maps.

If this is right

  • The limiting map is almost surely one-ended.
  • Simple random walk on the limiting map is recurrent.
  • Local statistics of large finite maps can be read off from the single infinite object.
  • The same local limit exists for every fixed d at least 3.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The infinite limit may serve as a stationary random rooted graph on which other observables, such as the number of self-avoiding walks, can be studied directly.
  • Because the construction uses a tree bijection, the same method may adapt to other classes of maps or graphs that admit similar combinatorial encodings.
  • Recurrence of the limit suggests that the maps remain 'two-dimensional' in a coarse sense even after taking the infinite limit.

Load-bearing premise

The bijection between maps and blossoming trees extends consistently to infinite trees while preserving local convergence.

What would settle it

A sequence of finite d-regular bipartite planar maps whose local neighborhoods fail to converge in distribution, or whose associated infinite limit has more than one end or transient random walk.

read the original abstract

We prove the existence of the local limit of uniform random d-regular bipartite planar maps, for every $d\geq 3$, as the number of vertices tends to infinity. The proof relies on a bijection between maps and so-called blossoming trees established in a previous work. After proving local convergence of the associated decorated trees, we extend the bijection to infinite trees and transfer the convergence to planar maps. The limiting object is almost surely one-ended and recurrent for the simple random walk.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The manuscript proves the existence of the local limit of the uniform random d-regular bipartite planar map on n vertices as n→∞, for each fixed d≥3. The proof invokes a prior bijection between such maps and decorated blossoming trees, establishes local convergence of the random trees, extends the bijection to infinite trees, and transfers the convergence to obtain a limiting infinite planar map. The limit is shown to be almost surely one-ended and recurrent for simple random walk.

Significance. If the claims hold, the result supplies a rigorous local-limit construction for a natural family of random planar maps via combinatorial bijections. The confirmation of one-endedness and recurrence supplies concrete information on the geometry and random-walk behavior of the limit, consistent with expectations from the planar-map literature. The tree-convergence-plus-transfer strategy is a standard and potentially reusable technique when a good bijection is available.

major comments (1)
  1. [extension of the bijection] The subsection on extending the finite blossoming-tree bijection to infinite trees: the manuscript must prove that this extension is continuous with respect to the local topology, so that the root neighborhood of the limiting map is a measurable function of the root neighborhood of the limiting tree. Any non-local choice in the extension would prevent the transfer of local convergence from trees to maps; this step is load-bearing for the central claim.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for highlighting the importance of the continuity of the bijection extension. We address the major comment below.

read point-by-point responses

  1. Referee: The subsection on extending the finite blossoming-tree bijection to infinite trees: the manuscript must prove that this extension is continuous with respect to the local topology, so that the root neighborhood of the limiting map is a measurable function of the root neighborhood of the limiting tree. Any non-local choice in the extension would prevent the transfer of local convergence from trees to maps; this step is load-bearing for the central claim.

    Authors: We agree that an explicit verification of continuity (or, equivalently, that the map neighborhood of any finite radius is a measurable function of a finite-radius tree neighborhood) is required for the transfer argument to be rigorous. The extension is constructed by applying the finite bijection rules locally around each vertex of the infinite tree, using only the blossoming decorations and the planar embedding data already present in the tree; no global or non-local choices are made. Nevertheless, the manuscript does not contain a dedicated lemma establishing this continuity in the local topology. In the revised version we will insert a short lemma (placed immediately after the definition of the infinite extension) proving that, for every r, there exists R such that the ball of radius r in the map is completely determined by the ball of radius R in the decorated tree, and that this determination is continuous with respect to the local metric on trees. This will make the measurability of the limiting map with respect to the limiting tree immediate. revision: yes

Circularity Check

0 steps flagged

No circularity; derivation uses prior bijection as independent combinatorial input then performs separate convergence and extension analysis.

full rationale

The paper cites a prior bijection between finite maps and blossoming trees as the starting reduction, then independently establishes local convergence of the associated decorated trees (via standard local limit techniques for random trees), explicitly constructs an extension of the bijection to the infinite setting, and verifies that the extension is continuous in the local topology so that convergence transfers to the maps. No step equates the claimed local limit or its properties (one-endedness, recurrence) to the input data or to the cited bijection by construction. The self-citation supplies only the finite combinatorial correspondence, which is falsifiable independently of the present probabilistic limit; the new content (tree convergence + continuous extension) is self-contained and does not reduce to a fit or to a self-referential definition.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on standard combinatorial and probabilistic arguments plus one cited bijection; no free parameters, ad-hoc axioms, or new entities are introduced.

axioms (1)
  • standard math Standard axioms of probability theory and graph theory for defining uniform random maps and local convergence
    Invoked implicitly throughout the proof strategy in the abstract.

pith-pipeline@v0.9.0 · 5359 in / 1015 out tokens · 56175 ms · 2026-05-08T01:56:17.132045+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

10 extracted references · 10 canonical work pages

  1. [1]

    Albenque, L

    1 M. Albenque, L. Ménard, and N. Tokka. Blossoming bijection for bipartite maps: a new approach via orientations and applications to the Ising model, 2025.arXiv:2511.03680. 2 O. Angel and O. Schramm. Uniform infinite planar triangulations.Commun. Math. Phys., 241(2-3):191–213, 2003.doi:10.1007/s00220-003-0932-3. 3 J.E. Björnberg and S.O. Stefánsson. Recur...

    work page doi:10.1007/s00220-003-0932-3 2025

  2. [2]

    Id/No 31.doi:10.1214/EJP.v19-3102. 4 M. Bousquet-Mélou and G. Schaeffer. The degree distribution in bipartite planar maps: applications to the Ising model, 2003.arXiv:math/0211070. 5 J. Bouttier, P. Di Francesco, and E. Guitter. Census of planar maps: From the one-matrix model solution to a combinatorial proof.Nucl. Phys., B, 645(3):477–499, 2002.doi:10.1...

    work page doi:10.1214/ejp.v19-3102 2003

  3. [3]

    Id/No 18.doi:10.1214/21-EJP579. 8 P. Chassaing and B. Durhuus. Local limit of labeled trees and expected volume growth in a random quadrangulation.The Annals of Probability, 34(3), May

    work page doi:10.1214/21-ejp579

  4. [4]

    doi:10.1214/ 009117905000000774. 9 L. Chen. Basic properties of the infinite critical-FK random map.Ann. Inst. Henri Poincaré D, Comb. Phys. Interact., 4(3):245–271, 2017.doi:10.4171/AIHPD/40. 10 N. Curien, L. Ménard, and G. Miermont. A view from infinity of the uniform infinite planar quadrangulation.ALEA, Lat. Am. J. Probab. Math. Stat., 10(1):45–88,

    work page doi:10.4171/aihpd/40 2017

  5. [5]

    Cambridge University Press, Cambridge, 2009.doi:10.1017/CBO9780511801655

    11 P. Flajolet and R. Sedgewick.Analytic combinatorics. Cambridge University Press, Cambridge, 2009.doi:10.1017/CBO9780511801655. 12 O. Gurel-Gurevich and A. Nachmias. Recurrence of planar graph limits.Ann. Math. (2), 177(2):761–781, 2013.doi:10.4007/annals.2013.177.2.10. 13 E. Gwynne, N. Holden, and X. Sun. Mating of trees for random planar maps and Liou...

    work page doi:10.1017/cbo9780511801655 2009

  6. [6]

    14 M. Krikun. Local structure of random quadrangulations. Preprint, arXiv:math/0512304 [math.PR] (2006),

    work page Pith review arXiv 2006

  7. [7]

    Miermont

    15 G. Miermont. Invariance principles for spatial multitype Galton-Watson trees.Ann. Inst. Henri Poincaré, Probab. Stat., 44(6):1128–1161, 2008.doi:10.1214/07-AIHP157. 16 R. C. Mullin. On the enumeration of tree-rooted maps.Canadian Journal of Mathematics, 19:174–183, 1967.doi:10.4153/CJM-1967-010-x. 17 L. Ménard. The two uniform infinite quadrangulations...

    work page doi:10.1214/07-aihp157 2008

  8. [8]

    Id/No 79.doi:10.1214/EJP.v19-2675. 19 G. Schaeffer. Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees.Electron. J. Comb., 4(1):research paper r20, 14,

    work page doi:10.1214/ejp.v19-2675

  9. [9]

    Sheffield

    21 S. Sheffield. Quantum gravity and inventory accumulation.Ann. Probab., 44(6):3804–3848, 2016.doi:10.1214/15-AOP1061. 22 R. Stephenson. Local Convergence of Large Critical Multi-type Galton–Watson Trees and Applications to Random Maps.J Theor Probab, 31:159–205,

    work page doi:10.1214/15-aop1061 2016

  10. [10]

    23 B. Stufler. Quenched local convergence of Boltzmann planar maps.J. Theor. Probab., 35(2):1324–1342, 2022.doi:10.1007/s10959-021-01089-2. 16 Local Limit of Random Regular Bipartite Planar Maps A Multitype Bienaymé-Galton-Watson and proof of Proposition 8 The purpose of this appendix is to prove Proposition 8, whose proof relies on the theory of multityp...

    work page doi:10.1007/s10959-021-01089-2 2022