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)