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

行走熵与行走正则性

Walk entropy and walk-regularity

Kyle Kloster, Daniel Král', Blair D. Sullivan

摘要:

一个图称为游走正则的,如果对于每个$\ell \geq 1$,每个顶点包含在相同数目的长度为$\ell$的闭游走中。我们构造了一个$24$ -顶点图$H_4$,它不是行走正则的,但具有最大化行走熵,$S^V(H_4,β) = \log 24$,对于某些$β>0$。这个图是Benzi [线性代数应用]~的一个猜想的反例443(2014),395- 399,猜想3.1]。我们还证明了存在无穷多个温度$β_0>0$使得$S^V(G,β_0)=\log n_G$当且仅当图$G$是行走正则的.

英文摘要:

A graph is said to be walk-regular if, for each $\ell \geq 1$, every vertex is contained in the same number of closed walks of length $\ell$. We construct a $24$-vertex graph $H_4$ that is not walk-regular yet has maximized walk entropy, $S^V(H_4,β) = \log 24$, for some $β>0$. This graph is a counterexample to a conjecture of Benzi [Linear Algebra Appl.~443 (2014), 395--399, Conjecture 3.1]. We also show that there exist infinitely many temperatures $β_0>0$ so that $S^V(G,β_0)=\log n_G$ if and only if a graph $G$ is walk-regular.

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

↑