Deviation inequality for monotonic Boolean functions with application to the number ofk-cycles in a random graph

DOI10.1002/RSA.10105zbMath1031.05126arXivmath/0405355OpenAlexW2079617051MaRDI QIDQ4446878

Dmitriy Panchenko

Publication date: 3 February 2004

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

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

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (1)

Upper tails for subgraph counts in random graphs

Cites Work

• Concentration of measure and isoperimetric inequalities in product spaces

This page was built for publication: Deviation inequality for monotonic Boolean functions with application to the number ofk-cycles in a random graph