The phase transition in inhomogeneous random graphs
We introduce a very general model of an inhomogenous random graph with independence between the edges, which scales so that the number of edges is linear in the number of vertices. This scaling corresponds to the p=c/n scaling for G(n,p) used to study the phase transition; also, it seems to be a pro...
Main Authors: | Bollobas, B, Janson, S, Riordan, O |
---|---|
格式: | Journal article |
语言: | English |
出版: |
2005
|
相似书籍
-
The phase transition in the uniformly grown random graph has infinite order
由: Bollobas, B, et al.
出版: (2005) -
Susceptibility in inhomogeneous random graphs
由: Janson, S, et al.
出版: (2009) -
Duality in inhomogeneous random graphs, and the cut metric
由: Janson, S, et al.
出版: (2009) -
Sparse random graphs with clustering
由: Bollobas, B, et al.
出版: (2008) -
The cut metric, random graphs, and branching processes
由: Bollobas, B, et al.
出版: (2009)