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.

翻译：我们利用Stein-Chen方法，给出了Bollobás定理关于随机图极值度分布的另一种证明。该证明同时提供了极值度向其渐近分布收敛的收敛速度。同样的方法也适用于更一般的情形，其中每对顶点之间存在边的概率依赖于顶点数目。