Counting spanning trees in a small-world Farey graph

The problem of spanning trees is closely related to various interesting problems in the area of statistical physics, but determining the number of spanning trees in general networks is computationally intractable. In this paper, we perform a study on the enumeration of spanning trees in a specific small-world network with an exponential distribution of vertex degrees, which is called a Farey graph since it is associated with the famous Farey sequence. According to the particular network structure, we provide some recursive relations governing the Laplacian characteristic polynomials of a Farey graph and its subgraphs. Then, making use of these relations obtained here, we derive the exact number of spanning trees in the Farey graph, as well as an approximate numerical solution for the asymptotic growth constant characterizing the network. Finally, we compare our results with those of different types of networks previously investigated.

[1]  Russell Lyons,et al.  Growth of the Number of Spanning Trees of the Erdős–Rényi Giant Component , 2007, Combinatorics, Probability and Computing.

[2]  Tang,et al.  Self-Organized Criticality: An Explanation of 1/f Noise , 2011 .

[3]  Kim,et al.  Simultaneous rational approximations in the study of dynamical systems. , 1986, Physical review. A, General physics.

[4]  János Kertész,et al.  Geometry of minimum spanning trees on scale-free networks , 2003 .

[5]  Shuigeng Zhou,et al.  A geometric growth model interpolating between regular and small-world networks , 2007, Journal of Physics A: Mathematical and Theoretical.

[6]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[7]  F. Chung,et al.  Spectra of random graphs with given expected degrees , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Heiko Rieger,et al.  Random walks on complex networks. , 2004, Physical review letters.

[9]  F. Y. Wu,et al.  Spanning trees on graphs and lattices in d dimensions , 2000, cond-mat/0004341.

[10]  Diego L. González,et al.  Chaos in a Nonlinear Driven Oscillator with Exact Solution , 1983 .

[11]  J S Kim,et al.  Fractality in complex networks: critical and supercritical skeletons. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  F. Y. Wu.  Number of spanning trees on a lattice , 1977 .

[13]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

[14]  Dhar,et al.  Self-organized critical state of sandpile automaton models. , 1990, Physical review letters.

[15]  V. Latora,et al.  Complex networks: Structure and dynamics , 2006 .

[16]  F. Y. Wu,et al.  Dimers on a Simple-Quartic Net with a Vacancy , 2002, cond-mat/0203149.

[17]  Andrew G. Glen,et al.  APPL , 2001 .

[18]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[19]  H E Stanley,et al.  Classes of small-world networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[20]  G. Hardy,et al.  An Introduction to the Theory of Numbers , 1938 .

[21]  G. Kirchhoff.  Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird , 1847 .

[22]  Shuigeng Zhou,et al.  Enumeration of spanning trees in a pseudofractal scale-free web , 2010, 1008.0267.

[23]  Russell Lyons.  Asymptotic Enumeration of Spanning Trees , 2005, Comb. Probab. Comput..

[24]  Satya N. Majumdar,et al.  Equivalence between the Abelian sandpile model and the q→0 limit of the Potts model , 1992 .

[25]  Kun-Mao Chao,et al.  Spanning trees and optimization problems , 2004, Discrete mathematics and its applications.

[26]  Zhongzhi Zhang,et al.  Spanning trees in a fractal scale-free lattice. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  F. Y. Wu,et al.  Spanning trees on hypercubic lattices and nonorientable surfaces , 2000, Appl. Math. Lett..

[28]  Norman Biggs.  Algebraic Graph Theory: Index , 1974 .

[29]  Abhishek Dhar,et al.  Distribution of sizes of erased loops for loop-erased random walks , 1997 .

[30]  González,et al.  Symmetric kicked self-oscillators: Iterated maps, strange attractors, and symmetry of the phase-locking Farey hierarchy. , 1985, Physical review letters.

[31]  Charles J. Colbourn,et al.  Farey Series and Maximal Outerplanar Graphs , 1982 .

[32]  Zhongzhi Zhang,et al.  Farey graphs as models for complex networks , 2011, Theor. Comput. Sci..

[33]  Ericka Stricklin-Parker,et al.  Ann , 2005 .

[34]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[35]  P. Bousso,et al.  DISC , 2012 .

[36]  S. N. Dorogovtsev,et al.  Pseudofractal scale-free web. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[37]  F. Y. Wu.  The Potts model , 1982 .

[38]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[39]  K-I Goh,et al.  Skeleton and fractal scaling in complex networks. , 2006, Physical review letters.

[40]  F. Y. Wu.  Dimers and Spanning Trees , 2002 .

[41]  D. Dhar.  Theoretical studies of self-organized criticality , 2006 .

[42]  Francis T. Boesch,et al.  On unreliability polynomials and graph connectivity in reliable network synthesis , 1986, J. Graph Theory.

[43]  Wei-Shih Yang,et al.  Spanning Trees on the Sierpinski Gasket , 2006, cond-mat/0609453.

[44]  P. Bak,et al.  Self-organized criticality. , 1988, Physical review. A, General physics.

[45]  Choujun Zhan,et al.  On the distributions of Laplacian eigenvalues versus node degrees in complex networks , 2010 .