How to calculate the main characteristics of random graphs - a new approach

Details How to calculate the main characteristics of random graphs - a new approach How to calculate the main characteristics of random graphs - a new approach

2003-08-29

arxiv.org/abs/cond-mat/0308629v1

Physics

Condensed Matter

Statistical Mechanics

A poster presented at Midterm Conference COSIN - Conference on Growing Networks and Graphs in Statistical Physics, Finance, Bi

Scientific paper

The poster presents an analytic formalism describing metric properties of undirected random graphs with arbitrary degree distributions and statistically uncorrelated (i.e. randomly connected) vertices. The formalism allows to calculate the main network characteristics like: the position of the phase transition at which a giant component first forms, the mean component size below the phase transition, the size of the giant component and the average path length above the phase transition. Although most of the enumerated properties were previously calculated by means of generating functions, we think that our derivations are conceptually much simpler.

Affiliated with

Also associated with

No associations

Rating

How to calculate the main characteristics of random graphs - a new approach 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 How to calculate the main characteristics of random graphs - a new approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How to calculate the main characteristics of random graphs - a new approach will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-257532