Statistical ensemble of scale-free random graphs

Details Statistical ensemble of scale-free random graphs Statistical ensemble of scale-free random graphs

2001-04-09

arxiv.org/abs/cond-mat/0104155v4

Phys.Rev. E64 (2001) 046118

Physics

Condensed Matter

Statistical Mechanics

10 pages, 6 eps figures, 2-column revtex format, minor corrections

Scientific paper

10.1103/PhysRevE.64.046118

A thorough discussion of the statistical ensemble of scale-free connected random tree graphs is presented. Methods borrowed from field theory are used to define the ensemble and to study analytically its properties. The ensemble is characterized by two global parameters, the fractal and the spectral dimensions, which are explicitly calculated. It is discussed in detail how the geometry of the graphs varies when the weights of the nodes are modified. The stability of the scale-free regime is also considered: when it breaks down, either a scale is spontaneously generated or else, a "singular" node appears and the graphs become crumpled. A new computer algorithm to generate these random graphs is proposed. Possible generalizations are also discussed. In particular, more general ensembles are defined along the same lines and the computer algorithm is extended to arbitrary (degenerate) scale-free random graphs.

Affiliated with

Also associated with

No associations

Rating

Statistical ensemble of scale-free random graphs 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 Statistical ensemble of scale-free random graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Statistical ensemble of scale-free random graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-534178