Abhranil Das Spring 2012
Real vs. Random• Many real networks grow.• These have highly skewed degree  distributions: often a power law.• Random grap...
The Model• Start from a single vertex without edges.• At each step a vertex is added.• With probability δ, two vertices ar...
Degree EvolutionEquations are approximate only in the short term.
Degree Distribution
Component Distribution Evolution
Component Distribution Evolution
Generating Function for Component           Distribution
Giant Component Phase Transition
Arbitrary Static Distribution
Comparison with Static Graph
ReferencesAre randomly grown graphs really random?Callaway et al, arXiv:cond-mat/0104546v2, 14 June 2001M. Molloy and B. R...
Upcoming SlideShare
Loading in...5
×

Are Randomly Grown Graphs Really Random?

495

Published on

A paper that discusses whether randomly grown graphs, as opposed to static random graphs, are truly random.

Published in: Education, Technology
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
495
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
0
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Transcript of "Are Randomly Grown Graphs Really Random?"

  1. 1. Abhranil Das Spring 2012
  2. 2. Real vs. Random• Many real networks grow.• These have highly skewed degree distributions: often a power law.• Random graphs usually have Poisson distribution
  3. 3. The Model• Start from a single vertex without edges.• At each step a vertex is added.• With probability δ, two vertices are joined with an undirected edge.• At time t: t vertices and δt (avg.) edges.• Different from preferential attachment model.
  4. 4. Degree EvolutionEquations are approximate only in the short term.
  5. 5. Degree Distribution
  6. 6. Component Distribution Evolution
  7. 7. Component Distribution Evolution
  8. 8. Generating Function for Component Distribution
  9. 9. Giant Component Phase Transition
  10. 10. Arbitrary Static Distribution
  11. 11. Comparison with Static Graph
  12. 12. ReferencesAre randomly grown graphs really random?Callaway et al, arXiv:cond-mat/0104546v2, 14 June 2001M. Molloy and B. Reed, Random Structures andAlgorithms 6, 161 (1995).M. Molloy and B. Reed, Combinatorics,Probability and Computing 7, 295 (1998).

×