Are randomly grown graphs really random?

Details Are randomly grown graphs really random? Are randomly grown graphs really random?

2001-04-27

arxiv.org/abs/cond-mat/0104546v2

Phys. Rev. E 64, 041902 (2001)

Physics

Condensed Matter

Statistical Mechanics

8 pages, 5 figures

Scientific paper

10.1103/PhysRevE.64.041902

We analyze a minimal model of a growing network. At each time step, a new vertex is added; then, with probability delta, two vertices are chosen uniformly at random and joined by an undirected edge. This process is repeated for t time steps. In the limit of large t, the resulting graph displays surprisingly rich characteristics. In particular, a giant component emerges in an infinite-order phase transition at delta = 1/8. At the transition, the average component size jumps discontinuously but remains finite. In contrast, a static random graph with the same degree distribution exhibits a second-order phase transition at delta = 1/4, and the average component size diverges there. These dramatic differences between grown and static random graphs stem from a positive correlation between the degrees of connected vertices in the grown graph--older vertices tend to have higher degree, and to link with other high-degree vertices, merely by virtue of their age. We conclude that grown graphs, however randomly they are constructed, are fundamentally different from their static random graph counterparts.

Affiliated with

Also associated with

No associations

Rating

Are randomly grown graphs really random? 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 Are randomly grown graphs really random?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Are randomly grown graphs really random? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-436813