arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1601.02896math.CO
收藏

图的约化幂的圈基

Cycle bases of reduced powers of graphs

Richard H. Hammack, Gregory D. Smith

摘要:

我们定义了一个新的结构。给定图$G$和正整数$k$,$G$的约化$k$次幂,记为$G^{(k)}$,是配置空间,其中$k$不可区分的令牌被放置在$G$的顶点上,使得任何顶点最多可以容纳$k$令牌。两个配置是相邻的,如果一个可以转换为另一个通过移动一个单一的令牌沿边到一个相邻的顶点。约化幂$G^{(k)}$是具有转移图$G$的$k$相同不可区分随机自动机的主马尔可夫链的转移图。我们提出的命题有关的结构性质的减少图的权力,最重要的是,提供了一个建设的最小循环基地的$G^{(k)}$。最小圈基的减少图的权力是特别相关的应用程序,不允许状态依赖耦合的自动机引入非平衡稳态。本文还演示了如何我们的最小周期基础建设提供的条件,确保对违反微观可逆性。此外,最小圈基的构造本身就是一个有趣的组合问题。

英文摘要:

We define what appears to be a new construction. Given a graph $G$ and a positive integer $k$, the reduced $k$th power of $G$, denoted $G^{(k)}$, is the configuration space in which $k$ indistinguishable tokens are placed on the vertices of $G$, so that any vertex can hold up to $k$ tokens. Two configurations are adjacent if one can be transformed to the other by moving a single token along an edge to an adjacent vertex. The reduced power $G^{(k)}$ is the transition graph of the master Markov chain for $k$ identical and indistinguishable stochastic automata with transition graph $G$. We present propositions related to the structural properties of reduced graph powers and, most significantly, provide a construction of minimum cycle bases of $G^{(k)}$. Minimum cycle bases of reduced graph powers are especially relevant to applications that do not allow state-dependent coupling of automata to introduce nonequilibrium steady states. This paper also demonstrates how our minimum cycle basis construction provides conditions that ensure against violations of microscopic reversibility. In addition, the minimum cycle basis construction is an interesting combinatorial problem in itself.

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

↑