An old approach to the giant component problem
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 s...
| Auteurs principaux: | , |
|---|---|
| Format: | Journal article |
| Publié: |
2012
|