Solvable Metric Growing Networks

Details Solvable Metric Growing Networks Solvable Metric Growing Networks

2007-11-19

arxiv.org/abs/0711.2999v2

J. Stat. Mech. (2008) P12002

Physics

Condensed Matter

Statistical Mechanics

Scientific paper

10.1088/1742-5468/2008/12/P12002

Structure and dynamics of complex networks usually deal with degree distributions, clustering, shortest path lengths and other graph properties. Although these concepts have been analysed for graphs on abstract spaces, many networks happen to be embedded in a metric arrangement, where the geographic distance between vertices plays a crucial role. The present work proposes a model for growing network that takes into account the geographic distance between vertices: the probability that they are connected is higher if they are located nearer than farther. In this framework, the mean degree of vertices, degree distribution and shortest path length between two randomly chosen vertices are analysed.

Affiliated with

Also associated with

No associations

Rating

Solvable Metric Growing Networks 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 Solvable Metric Growing Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solvable Metric Growing Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-391306