阿贝尔网络IV。非停顿网络动力学
Abelian networks IV. Dynamics of nonhalting networks
摘要:
阿贝尔网络是一个通信自动机的集合,其状态转移和消息传递都满足局部交换性条件。本文是Bond和Levine(2016)的阿贝尔网络系列的延续,我们将阿贝尔网络的理论扩展到可以永远运行的网络。一个不间断的阿贝尔网络可以用许多不同的方式实现为一个离散动力系统,这取决于更新的顺序。我们表明,某些功能的动态,如最小周期长度,有内在的定义,不需要指定的更新顺序。我们给出了有限不可约(停机或非停机)阿贝尔网络的\emph{torsion group}的内在定义,并证明了如果网络停机,它与Bond和Levine(2016)的临界群一致。我们证明了挠群自由地作用于轨迹有向图的可逆递归分量的集合上,并确定了这个作用何时是传递的。这种观点导致新的结果,即使在经典的情况下,sinkless转子网络(确定性的随机游走的模拟)。在Holroyd et. Al(2008)表明,只有一个芯片的无沉转子网络的经常性配置恰好是单圈(具有唯一定向圈的生成子图,芯片在圈上)。我们将这一结果推广到具有任意数量芯片的阿贝尔移动代理网络。我们给出了生成序列的公式,如\[ \sum_{n \geq 1} r_n z^n = \det (\frac{1}{1-z}D - A ) \],其中$r_n$是具有$n$芯片的经常性芯片和转子配置的数量; $D$是出度的对角矩阵,以及$A$是邻接矩阵。结果是序列$(r_n)_{n \geq 1}$完全决定了网络上简单随机游动的频谱。
英文摘要:
An abelian network is a collection of communicating automata whose state transitions and message passing each satisfy a local commutativity condition. This paper is a continuation of the abelian networks series of Bond and Levine (2016), for which we extend the theory of abelian networks that halt on all inputs to networks that can run forever. A nonhalting abelian network can be realized as a discrete dynamical system in many different ways, depending on the update order. We show that certain features of the dynamics, such as minimal period length, have intrinsic definitions that do not require specifying an update order. We give an intrinsic definition of the \emph{torsion group} of a finite irreducible (halting or nonhalting) abelian network, and show that it coincides with the critical group of Bond and Levine (2016) if the network is halting. We show that the torsion group acts freely on the set of invertible recurrent components of the trajectory digraph, and identify when this action is transitive. This perspective leads to new results even in the classical case of sinkless rotor networks (deterministic analogues of random walks). In Holroyd et. al (2008) it was shown that the recurrent configurations of a sinkless rotor network with just one chip are precisely the unicycles (spanning subgraphs with a unique oriented cycle, with the chip on the cycle). We generalize this result to abelian mobile agent networks with any number of chips. We give formulas for generating series such as \[ \sum_{n \geq 1} r_n z^n = \det (\frac{1}{1-z}D - A ) \] where $r_n$ is the number of recurrent chip-and-rotor configurations with $n$ chips; $D$ is the diagonal matrix of outdegrees, and $A$ is the adjacency matrix. A consequence is that the sequence $(r_n)_{n \geq 1}$ completely determines the spectrum of the simple random walk on the network.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。