On the growth of components with non fixed excesses

Details On the growth of components with non fixed excesses On the growth of components with non fixed excesses

2007-06-12

arxiv.org/abs/0706.1642v1

Discrete Applied Mathematics 130, 3 (17/07/2003) 487--493

Computer Science

Discrete Mathematics

A small note on the evolution of giant components

Scientific paper

10.1016/S0166-218X(03)00326-3

Denote by an $l$-component a connected graph with $l$ edges more than vertices. We prove that the expected number of creations of $(l+1)$-component, by means of adding a new edge to an $l$-component in a randomly growing graph with $n$ vertices, tends to 1 as $l,n$ tends to $\infty$ but with $l = o(n^{1/4})$. We also show, under the same conditions on $l$ and $n$, that the expected number of vertices that ever belong to an $l$-component is $\sim (12l)^{1/3} n^{2/3}$.

Affiliated with

Also associated with

No associations

Rating

On the growth of components with non fixed excesses 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 On the growth of components with non fixed excesses, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the growth of components with non fixed excesses will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-359316