##
###
Metrics for sparse graphs
[article]

B. Bollobas, O. Riordan

2009
*
arXiv
*
pre-print

A different connection between kernels and *random* *graphs* arises in *the* recent work *of* Borgs, Chayes, *Lovász*, Sós, Szegedy and Vesztergombi. ...
Roughly speaking, there is one model *for* each kernel, i.e., each symmetric measurable *function* from [0,1]^2 to *the* non-negative reals, although *the* details are much more complicated. ...
*The* authors would like to thank an anonymous referee *for* many detailed suggestions improving *the* presentation *of* *the* paper. ...

arXiv:0708.1919v3
fatcat:6mead2polvbohd4hbv5z7kzdhq