Sub-Gaussian Tails for the Number of Triangles inG(n, p)

DOI10.1017/S0963548310000106zbMath1221.05285arXiv0909.2403MaRDI QIDQ3068819

Guy Wolfovitz

Publication date: 17 January 2011

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (2)

On the missing log in upper tail estimates ⋮ A concentration result with application to subgraph count

Cites Work

• When are small subgraphs of a random graph normally distributed?
• Limit theorems for complete subgraphs of random graphs
• Upper tails for subgraph counts in random graphs
• Threshold functions for small subgraphs
• Divide and conquer martingales and the number of triangles in a random graph
• Concentration of non‐Lipschitz functions and applications
• The infamous upper tail

This page was built for publication: Sub-Gaussian Tails for the Number of Triangles inG(n, p)