The cut metric, random graphs, and branching processes
In this paper we study the component structure of random graphs with independence between the edges. Under mild assumptions, we determine whether there is a giant component, and find its asymptotic size when it exists. We assume that the sequence of matrices of edge probabilities converges to an app...
| Main Authors: | , , |
|---|---|
| פורמט: | Journal article |
| שפה: | English |
| יצא לאור: |
2009
|