Sparse graphs: metrics and random models
Recently, Bollob\'as, Janson and Riordan introduced a family of random graph models producing inhomogeneous graphs with $n$ vertices and $\Theta(n)$ edges whose distribution is characterized by a kernel, i.e., a symmetric measurable function $\ka:[0,1]^2 \to [0,\infty)$. To understand these mod...
Główni autorzy: | Bollobas, B, Riordan, O |
---|---|
Format: | Journal article |
Język: | English |
Wydane: |
2008
|
Podobne zapisy
-
Metrics for sparse graphs
od: Bollobas, B, i wsp.
Wydane: (2007) -
Sparse random graphs with clustering
od: Bollobas, B, i wsp.
Wydane: (2008) -
The cut metric, random graphs, and branching processes
od: Bollobas, B, i wsp.
Wydane: (2009) -
The diameter of sparse random graphs
od: Riordan, O, i wsp.
Wydane: (2008) -
Duality in inhomogeneous random graphs, and the cut metric
od: Janson, S, i wsp.
Wydane: (2009)