scientific article; zbMATH DE number 7763253

DOI10.33048/mattrudy.2022.25.103zbMath1523.05040MaRDI QIDQ6086224

Unnamed Author, Unnamed Author

Publication date: 9 November 2023

Full work available at URL: http://mathnet.ru/eng/mt660

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

cycleexponential inequalitynumber of subgraphsErdős-Rényi random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30)

Cites Work

• Unnamed Item
• The large deviation principle for the Erdős-Rényi random graph
• When are small subgraphs of a random graph normally distributed?
• Sample size determination for constructing a constant width confidence interval for a binomial success probability
• Upper tails for subgraph counts in random graphs
• 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: