Component sizes of the random graph outside the scaling window

Details Component sizes of the random graph outside the scaling window Component sizes of the random graph outside the scaling window

2006-10-16

arxiv.org/abs/math/0610466v2

Mathematics

Probability

13 pages

Scientific paper

We provide simple proofs describing the behavior of the largest component of
the Erdos-Renyi random graph G(n,p) outside of the scaling window, p={1+\eps(n)
\over n} where \eps(n) tends to 0, but \eps(n)n^{1/3} tends to \infty.

Affiliated with

Also associated with

No associations

Rating

Component sizes of the random graph outside the scaling window 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 Component sizes of the random graph outside the scaling window, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Component sizes of the random graph outside the scaling window will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-244830