Slow emergence of the giant component in the growing m-out graph
Let H m(n) be a random graph on n vertices, grown by adding vertices one at a time, joining each new vertex to a uniformly chosen set of m earlier vertices. If edges of H m(n) are deleted independently, each being retained with probability p, then there is a "phase transition". There is a...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2005
|