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...
| المؤلفون الرئيسيون: | , |
|---|---|
| التنسيق: | Book section |
| منشور في: |
2007
|