Duality in inhomogeneous random graphs, and the cut metric

DOI10.1002/rsa.20348zbMath1231.05237arXiv0905.0434OpenAlexW3123148366MaRDI QIDQ3094610

Oliver Riordan, Svante Janson

Publication date: 25 October 2011

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0905.0434

zbMATH Keywords

cut metricrandom graph duality

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Cites Work

• Susceptibility in inhomogeneous random graphs
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Quick approximation to matrices and applications
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The Evolution of Random Graphs
• Component behavior near the critical point of the random graph process
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The phase transition in inhomogeneous random graphs
• The cut metric, random graphs, and branching processes