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...
المؤلفون الرئيسيون: | Bollobas, B, Janson, S, Riordan, O |
---|---|
التنسيق: | Journal article |
اللغة: | English |
منشور في: |
2005
|
مواد مشابهة
-
The phase transition in the uniformly grown random graph has infinite order
حسب: Bollobas, B, وآخرون
منشور في: (2005) -
Susceptibility in inhomogeneous random graphs
حسب: Janson, S, وآخرون
منشور في: (2009) -
Duality in inhomogeneous random graphs, and the cut metric
حسب: Janson, S, وآخرون
منشور في: (2009) -
Sparse random graphs with clustering
حسب: Bollobas, B, وآخرون
منشور في: (2008) -
The cut metric, random graphs, and branching processes
حسب: Bollobas, B, وآخرون
منشور في: (2009)