Probabilistic construction of proportional graphs

DOI10.1002/rsa.3240030203zbMath0779.05048OpenAlexW1977958280MaRDI QIDQ3990216

Svante Janson, J. H. Spencer

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1002/rsa.3240030203

zbMATH Keywords

random graphBernoulli graphtriad countsproportional graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

How unproportional must a graph be? ⋮ A graph Fourier transform and proportional graphs

Cites Work

• The asymptotic distributions of generalized U-statistics with applications to random graphs
• A central limit theorem for decomposable random variables with applications to random graphs
• A functional limit theorem for random graphs with applications to subgraph count statistics

This page was built for publication: Probabilistic construction of proportional graphs