Journal article icon

Journal article

An old approach to the giant component problem

Abstract:

In 1998, Molloy and Reed showed that, under suitable conditions, if a sequence of degree sequences converges to a probability distribution $D$, then the size of the largest component in corresponding $n$-vertex random graph is asymptotically $\rho(D)n$, where $\rho(D)$ is a constant defined by the solution to certain equations that can be interpreted as the survival probability of a branching process associated to $D$. There have been a number of papers strengthening this result in various wa...

Expand abstract

Actions


Authors


Bollobas, B More by this author
Riordan, O More by this author
Publication date:
2012-09-17
URN:
uuid:4dcc3a95-ccb0-4947-b5aa-0c206589f98a
Source identifiers:
352662
Local pid:
pubs:352662
Keywords:

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP