arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1412.0150math.COmath-phmath.MPmath.PR
收藏

连接常数的局部性

Locality of connective constants

Geoffrey R. Grimmett, Zhongyang Li

摘要:

准传递图$G$的连接常数$μ(G)$是从给定原点开始的自避免行走数的指数增长性。我们证明了一个局部性定理的连接常数,即,两个图的连接常数是接近的值,只要图同意在一个大球周围的原点(和进一步的条件得到满足)。该证明利用了自避免行走的广义桥分解,这是有效的假设,基础图是准传递的,并拥有一个所谓的么模图高度函数。

英文摘要:

The connective constant $μ(G)$ of a quasi-transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. We prove a locality theorem for connective constants, namely, that the connective constants of two graphs are close in value whenever the graphs agree on a large ball around the origin (and a further condition is satisfied). The proof exploits a generalized bridge decomposition of self-avoiding walks, which is valid subject to the assumption that the underlying graph is quasi-transitive and possesses a so-called unimodular graph height function.

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

↑