Achievable Burning Densities of Growing Grids
Jordan Barrett, Karen Gunderson, JD Nir, Pawel Pralat

TL;DR
This paper studies how the density of burning vertices can be achieved in growing grid graphs under a graph burning process, revealing different achievable density ranges depending on the growth rate of the grid.
Contribution
It characterizes the set of achievable burning densities for growing grids with various growth rates, extending understanding of dynamic graph burning processes.
Findings
For linear growth ($eta=1$), achievable densities range from $1/(2c^2)$ to 1.
For growth rates between 1 and 1.5, all densities in [0,1] are achievable.
At growth rate 1.5, achievable densities are in [0, $(1+ oot{6}rom{6}c)^{-2}]$.
Abstract
Graph burning is a discrete-time process on graphs where vertices are sequentially activated and burning vertices cause their neighbours to burn over time. In this work, we focus on a dynamic setting in which the graph grows over time, and at each step we burn vertices in the growing grid . We investigate the set of achievable burning densities for functions of the form , where and . We show that for , the set of achievable densities is , for , every density in is achievable, and for , the set of achievable densities is .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Cellular Automata and Applications · Limits and Structures in Graph Theory
