The window process of slightly subcritical frozen percolation

We study the frozen percolation model on the complete graph $K_n$, where each edge appears at rate~$1/n$ and connected components are destroyed by lightning strikes hitting vertices at rate $λ_n$ (thus the rate at which a connected component is destroyed is linear in its size). We focus on the slightly subcritical sub-regime of the self-organized critical (SOC) regime, assuming $(\ln n)^{4/3}n^{-1/3} \ll λ_n \ll 1$. Our main object of study is the so-called window process, which allows us to study the fine details of the mechanism that drives the SOC behavior of this dynamic random graph. We prove two scaling limit theorems. First, we show that the fluctuations of the window process around its deterministic fluid limit converge to a stationary Ornstein--Uhlenbeck process, whose mean-reverting property captures the SOC nature of the model. Second, by zooming in on a finer space-time scale, we prove that the scaled increments of the window process converge to a tempered stable Lévy process.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-10-27
DOI
https://doi.org/10.48550/arxiv.2610.37320
Primary Topic
Stochastic processes and statistical mechanics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

The window process of slightly subcritical frozen percolation

Balázs Ráth, Márton Szőke, Dominic Yeo
arXiv (Cornell University)
Stochastic processes and statistical mechanics
preprint

The window process of slightly subcritical frozen percolation

Balázs Ráth, Márton Szőke, Dominic Yeo
preprint en

Abstract

We study the frozen percolation model on the complete graph $K_n$, where each edge appears at rate~$1/n$ and connected components are destroyed by lightning strikes hitting vertices at rate $λ_n$ (thus the rate at which a connected component is destroyed is linear in its size). We focus on the slightly subcritical sub-regime of the self-organized critical (SOC) regime, assuming $(\ln n)^{4/3}n^{-1/3} \ll λ_n \ll 1$. Our main object of study is the so-called window process, which allows us to study the fine details of the mechanism that drives the SOC behavior of this dynamic random graph. We prove two scaling limit theorems. First, we show that the fluctuations of the window process around its deterministic fluid limit converge to a stationary Ornstein--Uhlenbeck process, whose mean-reverting property captures the SOC nature of the model. Second, by zooming in on a finer space-time scale, we prove that the scaled increments of the window process converge to a tempered stable Lévy process.

arXiv (Cornell University)
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
The window process of slightly subcritical frozen percolation — Balázs Ráth, Márton Szőke, et al. · arXiv (Cornell University) (2026) | TGRS Research Map | TGRS