Physics – Condensed Matter – Statistical Mechanics
Scientific paper
2006-01-09
Physics
Condensed Matter
Statistical Mechanics
15 pages and 3 figures
Scientific paper
10.1142/S0129183106009837
The Erdos-Renyi classical random graph is characterized by a fixed linking probability for all pairs of vertices. Here, this concept is generalized by drawing the linking probability from a certain distribution. Such a procedure is found to lead to a static complex network with an arbitrary connectivity distribution. In particular, a scale-free network with the hierarchical organization is constructed without assuming any knowledge about the global linking structure, in contrast to the preferential attachment rule for a growing network. The hierarchical and mixing properties of the static scale-free network thus constructed are studied. The present approach establishes a bridge between a scalar characterization of individual vertices and topology of an emerging complex network. The result may offer a clue for understanding the origin of a few abundance of connectivity distributions in a wide variety of static real-world networks.
Abe Sumiyoshi
Thurner Stefan
No associations
LandOfFree
Hierarchical and mixing properties of static complex networks emerging from the fluctuating classical 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 Hierarchical and mixing properties of static complex networks emerging from the fluctuating classical random graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hierarchical and mixing properties of static complex networks emerging from the fluctuating classical random graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-684646