Book section icon

Book section

Metrics for sparse graphs

Abstract:

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 reals, although the details are much more complicated. A different connection between kernels and random graphs arises in the recent work of Borgs, Chayes, Lov\'asz, S\'os, Szegedy and Vesztergombi. Th...

Expand abstract

Actions


Authors


Bollobas, B More by this author
Riordan, O More by this author
Publication date:
2007-08-14
URN:
uuid:160f74cf-cc8c-4f5f-b471-062a60da82a0
Source identifiers:
146806
Local pid:
pubs:146806

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP