Enumeration of spanning trees in a pseudofractal scale-free web

Details Enumeration of spanning trees in a pseudofractal scale-free web Enumeration of spanning trees in a pseudofractal scale-free web

2010-08-02

arxiv.org/abs/1008.0267v1

EPL (Europhysics Letters), 2010, 90:68002

Physics

Condensed Matter

Statistical Mechanics

Definitive version accepted for publication in EPL (Europhysics Letters)

Scientific paper

10.1209/0295-5075/90/68002

Spanning trees are an important quantity characterizing the reliability of a network, however, explicitly determining the number of spanning trees in networks is a theoretical challenge. In this paper, we study the number of spanning trees in a small-world scale-free network and obtain the exact expressions. We find that the entropy of spanning trees in the studied network is less than 1, which is in sharp contrast to previous result for the regular lattice with the same average degree, the entropy of which is higher than 1. Thus, the number of spanning trees in the scale-free network is much less than that of the corresponding regular lattice. We present that this difference lies in disparate structure of the two networks. Since scale-free networks are more robust than regular networks under random attack, our result can lead to the counterintuitive conclusion that a network with more spanning trees may be relatively unreliable.

Affiliated with

Also associated with

No associations

Rating

Enumeration of spanning trees in a pseudofractal scale-free web does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Enumeration of spanning trees in a pseudofractal scale-free web, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumeration of spanning trees in a pseudofractal scale-free web will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-52688