
AbstractWe offer an alternative proof, using the Stein-Chen method, of Bollobá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.
total variation distance, Statistics of extreme values; tail inference, Probability (math.PR), Random graphs (graph-theoretic aspects), positive dependence, Mathematics - Statistics Theory, 05C80, 05C07, 62G32, Vertex degrees, Statistics Theory (math.ST), extremes, FOS: Mathematics, Mathematics - Combinatorics, Poisson approximation, Combinatorics (math.CO), random graphs, Mathematics - Probability
total variation distance, Statistics of extreme values; tail inference, Probability (math.PR), Random graphs (graph-theoretic aspects), positive dependence, Mathematics - Statistics Theory, 05C80, 05C07, 62G32, Vertex degrees, Statistics Theory (math.ST), extremes, FOS: Mathematics, Mathematics - Combinatorics, Poisson approximation, Combinatorics (math.CO), random graphs, Mathematics - Probability
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
