Metrics for sparse graphs

@inproceedings{Riordan2009MetricsFS,
  title={Metrics for sparse graphs},
  author={Oliver Riordan},
  year={2009}
}
Recently, Bollobás, Janson and Riordan introduced a very general family of random graph models, producing inhomogeneous random graphs with Θ(n) edges. Roughly speaking, there is one model for each kernel, i.e., each symmetric measurable function from [0, 1] to the non-negative reals, although the details are much more complicated, to ensure the exact inclusion of many of the recent models for large-scale real-world networks. A different connection between kernels and random graphs arises in the… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 47 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 31 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 33 references

Regular partitions of graphs

E. Szemerédi
Problèmes combinatoires et théorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976), Colloq. Internat. CNRS 260, CNRS, Paris • 1978
View 18 Excerpts
Highly Influenced

Graph limits and parameter testing

View 20 Excerpts
Highly Influenced

Limits of dense graph sequences

J. Comb. Theory, Ser. B • 2006
View 10 Excerpts
Highly Influenced

Sparse Quasi-Random Graphs

Combinatorica • 2002
View 10 Excerpts
Highly Influenced

Linear Analysis

B. Bollobás
2nd ed., Cambridge University Press • 1999
View 12 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…