Exponential inequalities for the number of subgraphs in the Erdös-Rényi random graph

DOI10.1016/j.spl.2022.109763zbMath1518.05168OpenAlexW4313418949MaRDI QIDQ6101707

Unnamed Author, Unnamed Author

Publication date: 20 June 2023

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

Full work available at URL: https://doi.org/10.1016/j.spl.2022.109763

zbMATH Keywords

number of subgraphsErdös-Rényi graphHoeffding-type exponential inequalities

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Combinatorial probability (60C05) Large deviations (60F10)

Cites Work

• The large deviation principle for the Erdős-Rényi random graph
• When are small subgraphs of a random graph normally distributed?
• Upper tails for subgraph counts in random graphs
• Large deviations of subgraph counts for sparse Erdős-Rényi graphs
• Exponential Chebyshev inequalities for random graphons and their applications
• Limit laws for the number of triangles in the generalized random graphs with random node weights
• Nonlinear large deviations
• The missing log in large deviations for triangle counts
• Upper tails for triangles
• Divide and conquer martingales and the number of triangles in a random graph
• Rate of Convergence to the Poisson Law of the Numbers of Cycles in the Generalized Random Graphs
• Exponential Inequalities for the Distributions of Canonical Multiple Partial Sum Processes
• Probability Inequalities for Sums of Bounded Random Variables

This page was built for publication: Exponential inequalities for the number of subgraphs in the Erdös-Rényi random graph