Metrics for sparse graphs
Recently, Bollob\'as, Janson and Riordan introduced a very general family of random graph models, producing inhomogeneous random graphs with $\Theta(n)$ edges. Roughly speaking, there is one model for each {\em kernel}, i.e., each symmetric measurable function from $[0,1]^2$ to the non-negative...
Main Authors: | Bollobas, B, Riordan, O |
---|---|
Format: | Book section |
Published: |
2007
|
Similar Items
-
Sparse graphs: metrics and random models
by: Bollobas, B, et al.
Published: (2008) -
Sparse random graphs with clustering
by: Bollobas, B, et al.
Published: (2008) -
The cut metric, random graphs, and branching processes
by: Bollobas, B, et al.
Published: (2009) -
The diameter of sparse random graphs
by: Riordan, O, et al.
Published: (2008) -
Monotone graph limits and quasimonotone graphs
by: Bollobas, B, et al.
Published: (2011)