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...
Үндсэн зохиолчид: | Bollobas, B, Riordan, O |
---|---|
Формат: | Book section |
Хэвлэсэн: |
2007
|
Ижил төстэй зүйлс
Ижил төстэй зүйлс
-
Sparse graphs: metrics and random models
-н: Bollobas, B, зэрэг
Хэвлэсэн: (2008) -
Sparse random graphs with clustering
-н: Bollobas, B, зэрэг
Хэвлэсэн: (2008) -
The cut metric, random graphs, and branching processes
-н: Bollobas, B, зэрэг
Хэвлэсэн: (2009) -
Monotone graph limits and quasimonotone graphs
-н: Bollobas, B, зэрэг
Хэвлэсэн: (2011) -
The diameter of sparse random graphs
-н: Riordan, O, зэрэг
Хэвлэсэн: (2008)