On asymptotic behavior of Bell polynomials and concentration of vertex degree of large random graphs

Abstract

We study concentration properties of vertex degrees of n-dimensional Erdos-R\'enyi random graphs with the edge probability /n by means of high moments of these random variables in the limit when n and tend to infinity. These moments are asymptotically close to one-variable Bell polynomials Bk(), k∈ N that represent moments of the Poisson probability distribution P(). We study asymptotic behavior of the Bell polynomials and modified Bell polynomials for large values of k and with the help of the local limit theorem for auxiliary random variables. Using the results obtained, we get the upper bounds for the deviation probabilities of the normalized maximal vertex degree of the Erdos-R\'enyi random graphs in the limit n,∞ such that the ratio / n remains finite or infinitely increases.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…