Filled-in peeling explorations exhaust every critical Boltzmann planar map

Let $\mathbf q$ be an admissible critical weight sequence for bipartite Boltzmann planar maps and consider the infinite $\mathbf q$-Boltzmann map with a boundary. Curien proved that a filled-in peeling exploration driven by any algorithm eventually discovers the whole map when $\mathbf q$ is of type $a\in[3/2,5/2]$, and asked whether this holds for every critical weight sequence. We show that it does: for every admissible critical $\mathbf q$, every finite boundary length and every peeling algorithm that never stops, the filled-in exploration exhausts the map almost surely. The type assumption entered Curien's proof through the polynomial tail of the negative jumps of the perimeter process and through its scaling limit. We use instead the exact formula for the negative jumps in terms of the positive ones, which gives the rate at which a fixed boundary edge is swallowed up to constants, and a martingale argument for $\log h^\uparrow$ of the perimeter which shows that these rates have a divergent sum along the exploration.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-08
DOI
https://doi.org/10.5281/zenodo.24070248
Primary Topic
Stochastic processes and statistical mechanics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Filled-in peeling explorations exhaust every critical Boltzmann planar map

Yitzchak Shmalo
Zenodo (CERN European Organization for Nuclear Research)
Stochastic processes and statistical mechanics
preprint

Filled-in peeling explorations exhaust every critical Boltzmann planar map

Yitzchak Shmalo
preprint en

Abstract

Let $\mathbf q$ be an admissible critical weight sequence for bipartite Boltzmann planar maps and consider the infinite $\mathbf q$-Boltzmann map with a boundary. Curien proved that a filled-in peeling exploration driven by any algorithm eventually discovers the whole map when $\mathbf q$ is of type $a\in[3/2,5/2]$, and asked whether this holds for every critical weight sequence. We show that it does: for every admissible critical $\mathbf q$, every finite boundary length and every peeling algorithm that never stops, the filled-in exploration exhausts the map almost surely. The type assumption entered Curien's proof through the polynomial tail of the negative jumps of the perimeter process and through its scaling limit. We use instead the exact formula for the negative jumps in terms of the positive ones, which gives the rate at which a fixed boundary edge is swallowed up to constants, and a martingale argument for $\log h^\uparrow$ of the perimeter which shows that these rates have a divergent sum along the exploration.

Zenodo (CERN European Organization for Nuclear Research)
Hebrew University of Jerusalem (IL)
Stochastic processes and statistical mechanics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon