Small variance of subgraph counts in a random tournament

DOI10.1016/S0167-7152(00)00041-9zbMath0957.05047MaRDI QIDQ1579850

Pontus Andersson

Publication date: 14 September 2000

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

zbMATH Keywords

subgraph countsrandom tournament

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Directed graphs (digraphs), tournaments (05C20)

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
• Orthogonal decompositions and functional limit theorems for random graph statistics
• Gaussian Hilbert Spaces
• On the asymptotic distributions of subgraph counts in a random tournament

This page was built for publication: Small variance of subgraph counts in a random tournament