arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1207.6864math-phcs.CCmath.MP
收藏

伪分形无标度网的Tutte多项式

Tutte polynomial of pseudofractal scale-free web

Junhao Peng, Guoai Xu

摘要:

图的Tutte多项式是一个二元多项式,它在组合数学和统计物理中都是非常重要的。它包含各种数值不变量和多项式不变量,如生成树的数目、生成森林的数目、无环方向的数目、可靠性多项式、色多项式和流多项式。本文研究并得到了伪分形无标度网(PSW)的Tutte多项式的递推公式,这意味着尽管PSW的Tutte多项式对一般图来说是NP-难的,但我们得到了计算PSW的Tutte多项式的对数复杂度算法。通过求解Tutte多项式的递推关系,得到了PSW生成树个数的严格解,为PSW生成树个数的确定提供了一种新的途径.进一步分析了PSW的全终端可靠性,并与节点数和边数相同的Sierpinski垫片的全终端可靠性进行了比较。与众所周知的结论相比,无标度网络比同构网络更能抵抗节点的移除(例如,指数网络和规则网络)。我们的研究结果表明,Sierpinski垫片(这是一个规则的网络)是更强大的对随机边缘故障比PSW(这是一个无标度网络)。对于任何规则网络和无标度网络是否都是如此,仍然是一个悬而未决的问题。

英文摘要:

The Tutte polynomial of a graph is a 2-variable polynomial which is quite important in both combinatorics and statistical physics. It contains various numerical invariants and polynomial invariants, such as the number of spanning trees, the number of spanning forests, the number of acyclic orientations, the reliability polynomial, chromatic polynomial and flow polynomial. In this paper, we study and gain recursive formulas for the Tutte polynomial of pseudofractal scale-free web (PSW) which implies logarithmic complexity algorithm is obtained to calculate the Tutte polynomial of PSW although it is NP-hard for general graph. We also obtain the rigorous solution for the the number of spanning trees of PSW by solving the recurrence relations derived from Tutte polynomial, which give an alternative approach for explicitly determining the number of spanning trees of PSW. Further more, we analysis the all-terminal reliability of PSW and compare the results with that of Sierpinski gasket which has the same number of nodes and edges with PSW. In contrast with the well-known conclusion that scale-free networks are more robust against removal of nodes than homogeneous networks (e.g., exponential networks and regular networks). Our results show that Sierpinski gasket (which is a regular network) are more robust against random edge failures than PSW (which is a scale-free network). Whether it is true for any regular networks and scale-free networks, is still a unresolved problem.

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

↑