生长网格的可实现燃烧密度
Achievable Burning Densities of Growing Grids
AI总结:
研究了生长网格中燃烧密度的可实现范围,针对不同参数α得出不同的密度区间。
摘要:
图燃烧是一种在图上进行的离散时间过程,其中顶点按顺序被激活,燃烧的顶点会随时间导致邻居被燃烧。在本工作中,我们关注一个动态设置,即图随时间增长,在每一步中我们都在增长的网格$G_n = [-f(n),f(n)]^2$中燃烧顶点。我们研究了函数形式为$f(n)=\lceil cn^α\rceil$的可实现燃烧密度集合,其中$α\ge 1$且$c>0$。我们证明,当$α=1$时,可实现的密度集合为$[1/(2c^2),1]$,当$1<α<3/2$时,区间$[0,1]$内的所有密度均可实现,当$α=3/2$时,可实现的密度集合为$[0,(1+\sqrt{6}c)^{-2}]$。
英文摘要:
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 $G_n = [-f(n),f(n)]^2$. We investigate the set of achievable burning densities for functions of the form $f(n)=\lceil cn^α\rceil$, where $α\ge 1$ and $c>0$. We show that for $α=1$, the set of achievable densities is $[1/(2c^2),1]$, for $1<α<3/2$, every density in $[0,1]$ is achievable, and for $α=3/2$, the set of achievable densities is $[0,(1+\sqrt{6}c)^{-2}]$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。