arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1805.05932math.CO
收藏

扩散对策非负性的一致界

Uniform Bounds for Non-negativity of the Diffusion Game

Andrew Carlotti, Rebekah Herrman

摘要:

我们研究了一个变种的芯片发射游戏称为扩散游戏。在扩散博弈中,我们首先对图的顶点进行整数标记,将其解释为每个顶点上的筹码数量,然后在随后的每一步中,每个顶点同时向每个筹码较少的邻居发射筹码。一般来说,这可能会导致负顶点标签。Long和Narayanan询问是否存在每个$n$的$f(n)$,使得每当我们在$n$顶点上有一个图,并且每个顶点上至少有$f(n)$芯片的初始分配时,每个顶点上的芯片数量将保持非负。我们肯定地回答他们的问题,进一步表明$f(n)=n-2$是最好的可能的界限。我们还考虑了每个$d$的相似界$g(d)$的存在性,其中$d$是图的最大度。

英文摘要:

We study a variant of the chip-firing game called the diffusion game. In the diffusion game, we begin with some integer labelling of the vertices of a graph, interpreted as a number of chips on each vertex, and then for each subsequent step every vertex simultaneously fires a chip to each neighbour with fewer chips. In general, this could result in negative vertex labels. Long and Narayanan asked whether there exists an $f(n)$ for each $n$, such that whenever we have a graph on $n$ vertices and an initial allocation with at least $f(n)$ chips on each vertex, then the number of chips on each vertex will remain non-negative. We answer their question in the affirmative, showing further that $f(n)=n-2$ is the best possible bound. We also consider the existence of a similar bound $g(d)$ for each $d$, where $d$ is the maximum degree of the graph.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑