A note on the distribution of the extreme degrees of a random graph via the Stein-Chen method
From MaRDI portal
Publication:6396334
arXiv2204.05881MaRDI QIDQ6396334FDOQ6396334
Authors: Yaakov Malinovsky 
Publication date: 12 April 2022
Abstract: We offer an alternative proof, using the Stein-Chen method, of Bollob'{a}s' theorem concerning the distribution of the extreme degrees of a random graph. Our proof also provides a rate of convergence of the extreme degree to its asymptotic distribution. The same method also applies in a more general setting where the probability of every pair of vertices being connected by edges depends on the number of vertices.
Statistics of extreme values; tail inference (62G32) Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07)
This page was built for publication: A note on the distribution of the extreme degrees of a random graph via the Stein-Chen method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6396334)
