Random Burning of the Euclidean Torus

ABSTRACT The burning number of a graph is the minimal number of steps that are needed to burn all of its vertices, with the following burning procedure: at each step, one can choose a point to set on fire, and the fire propagates constantly at unit speed along the edges of the graph. In this paper, we consider two natural random burning procedures in the discrete Euclidean torus , in which the points that we set on fire at each step are random variables. Our main result deals with the case where at each step, the law of the new point that we conditionally set on fire in the past is the uniform distribution on the complement of the set of vertices burned by the previous points. In this case, we prove that as , the corresponding random burning number (i.e., the first step at which the whole torus is burned) is asymptotic to in probability, where is the explosion time of a so‐called generalized Blasius equation.

Authors

Institutions

Publication Details

Journal
Random Structures and Algorithms
Published
2026-11-14
DOI
https://doi.org/10.1002/rsa.70103
Citations
2
Primary Topic
Stochastic processes and statistical mechanics
Type
article
Field-Weighted Citation Impact
3.46

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Random Burning of the Euclidean Torus

Alice Contat
2 citations
Random Structures and Algorithms
Stochastic processes and statistical mechanics
3.46
article

Random Burning of the Euclidean Torus

Alice Contat
article en
2 citations

Abstract

ABSTRACT The burning number of a graph is the minimal number of steps that are needed to burn all of its vertices, with the following burning procedure: at each step, one can choose a point to set on fire, and the fire propagates constantly at unit speed along the edges of the graph. In this paper, we consider two natural random burning procedures in the discrete Euclidean torus , in which the points that we set on fire at each step are random variables. Our main result deals with the case where at each step, the law of the new point that we conditionally set on fire in the past is the uniform distribution on the complement of the set of vertices burned by the previous points. In this case, we prove that as , the corresponding random burning number (i.e., the first step at which the whole torus is burned) is asymptotic to in probability, where is the explosion time of a so‐called generalized Blasius equation.

Random Structures and AlgorithmsVol. 69(4)
Université Sorbonne Paris Nord (FR), École Polytechnique Fédérale de Lausanne (CH)
National Centres of Competence in Research SwissMAP, Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung
Openalex Percentile: Top 12%
Stochastic processes and statistical mechanics
3.46
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