A note on the distribution of the extreme degrees of a random graph via the Stein-Chen method

DOI10.1007/s11009-024-10091-0zbMATH Open1542.05159MaRDI QIDQ6582077

Yaakov Malinovsky

Publication date: 1 August 2024

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

zbMATH Keywords

positive dependencerandom graphsPoisson approximationextremestotal variation distance

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Statistics of extreme values; tail inference (62G32) Vertex degrees (05C07)

Cites Work

• The distribution of the maximum degree of a random graph
• Degree sequences of random graphs
• Introduction to mathematical probability.
• On the strength of connectedness of a random graph
• On the Asymptotic Behavior of Degrees of Vertices in a Random Graph
• On the distribution of winners’ scores in a round-robin tournament
• Association of Random Variables, with Applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

Related Items (1)

Maximum number of symmetric extensions in random graphs

This page was built for publication: A note on the distribution of the extreme degrees of a random graph via the Stein-Chen method