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

图动力系统的圈等价性

Cycle Equivalence of Graph Dynamical Systems

Matthew Macauley, Henning S. Mortveit

摘要:

图动力系统(GDS)可以用来描述广泛的分布,非线性现象。本文刻画了一类称为序列动力系统SDS的有限GDS的循环等价性。一般来说,如果两个有限GDS的周期轨道同构为有向图,则它们是圈等价的。序列动力系统可以看作广义元胞自动机,并使用更新顺序来构造动力系统映射。本文的主要结果是循环等价的SDS更新顺序的移位和反射的表征。我们构造了两个图C(Y)和D(Y),它们的分量描述了产生循环等价SDS的更新顺序。C(Y)和D(Y)中的分量数是可以获得的圈等价类数的上界,并且我们通过几个图类的递归关系来枚举这些量。这些图的组件编码动态中性,组件的大小表示周期轨道结构稳定性,组件的数量可以被看作是一个系统的复杂性措施。

英文摘要:

Graph dynamical systems (GDSs) can be used to describe a wide range of distributed, nonlinear phenomena. In this paper we characterize cycle equivalence of a class of finite GDSs called sequential dynamical systems SDSs. In general, two finite GDSs are cycle equivalent if their periodic orbits are isomorphic as directed graphs. Sequential dynamical systems may be thought of as generalized cellular automata, and use an update order to construct the dynamical system map. The main result of this paper is a characterization of cycle equivalence in terms of shifts and reflections of the SDS update order. We construct two graphs C(Y) and D(Y) whose components describe update orders that give rise to cycle equivalent SDSs. The number of components in C(Y) and D(Y) is an upper bound for the number of cycle equivalence classes one can obtain, and we enumerate these quantities through a recursion relation for several graph classes. The components of these graphs encode dynamical neutrality, the component sizes represent periodic orbit structural stability, and the number of components can be viewed as a system complexity measure.

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

↑