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...
Prif Awduron: | Bollobas, B, Riordan, O |
---|---|
Fformat: | Book section |
Cyhoeddwyd: |
2007
|
Eitemau Tebyg
-
Sparse graphs: metrics and random models
gan: Bollobas, B, et al.
Cyhoeddwyd: (2008) -
Sparse random graphs with clustering
gan: Bollobas, B, et al.
Cyhoeddwyd: (2008) -
The cut metric, random graphs, and branching processes
gan: Bollobas, B, et al.
Cyhoeddwyd: (2009) -
Monotone graph limits and quasimonotone graphs
gan: Bollobas, B, et al.
Cyhoeddwyd: (2011) -
The diameter of sparse random graphs
gan: Riordan, O, et al.
Cyhoeddwyd: (2008)