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

DOI10.1007/S10959-020-01025-WMaRDI QIDQ2116468zbMATH OpenOpenAlexFDO

Authors Oleksiy Khorunzhiy

Publication date 17 March 2022

Published in Journal of Theoretical Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1904.01339

zbMATH Keywords

random graphsBell polynomialsvertex degree

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20) Bell and Stirling numbers (11B73) Vertex degrees (05C07) Asymptotic enumeration (05A16)

Abstract: We study concentration properties of vertex degrees of $n$-dimensional Erdos-R'enyi random graphs with the edge probability $ho/n$ by means of high moments of these random variables in the limit when $n$ and $ho$ tend to infinity. These moments are asymptotically close to one-variable Bell polynomials $$ that represent moments of the Poisson probability distribution $calP(ho)$. We study asymptotic behavior of the Bell polynomials and modified Bell polynomials for large values of $k$ and $ho$ 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,hooinfty$ such that the ratio $ho/logn$ remains finite or infinitely increases.

Recommendations

• On the number of vertices of given degree in a random graph
• Poisson convergence of numbers of vertices of a given degree in random graphs
• Poisson convergence and semi-induced properties of random graphs
• A bound on normal approximation of number of vertices of a fixed degree in a random graph
• Extreme degrees in random subgraphs of regular graphs

Cites work

• scientific article; zbMATH DE number 3886512 (Why is no real title available?)
• scientific article; zbMATH DE number 3112944 (Why is no real title available?)
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3902655 (Why is no real title available?)
• scientific article; zbMATH DE number 3745227 (Why is no real title available?)
• scientific article; zbMATH DE number 3640586 (Why is no real title available?)
• scientific article; zbMATH DE number 487720 (Why is no real title available?)
• scientific article; zbMATH DE number 1995543 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 3008649 (Why is no real title available?)
• A uniform asymptotic expansion of the single variable Bell polynomials
• Analytic combinatorics
• Asymptotic analysis of the Bell polynomials by the ray method
• Asymptotics of Stirling and Chebyshev-Stirling numbers of the second kind
• Central and local limit theorems applied to asymptotic enumeration
• Eigenvalue distribution of large weighted random graphs
• Exponential Numbers
• Exponential polynomials
• Generalized Bell polynomials and the combinatorics of Poisson central moments
• On Eigenvalue Distribution of Random Matrices of Ihara Zeta Function of Large Random Graphs
• On a new law of large numbers
• On connected diagrams and cumulants of Erdős-Rényi matrix models
• On discrete subgroups of the two by two projective linear group over \(p\)-adic fields
• On the distribution of the roots of certain symmetric matrices
• Random graph dynamics
• Random graphs.
• Single variable Bell polynomials
• Spectral distributions of adjacency and Laplacian matrices of random graphs
• Strong asymptotics of the generating polynomials of the Stirling numbers of the second kind
• THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
• The Largest Eigenvalue of Sparse Random Graphs
• The eigenvalues of random symmetric matrices
• The expected eigenvalue distribution of a large regular graph
• Using probabilistic models to study the asymptotic behavior of Bell numbers
• What are zeta functions of graphs and what are they good for?
• Zeta functions of finite graphs and coverings

Cited in

(2)

• Asymptotic Absence of Poles of Ihara Zeta Function of Large Erdős–Rényi Random Graphs
• Comments on summing over bordisms in TQFT

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: On asymptotic properties of Bell polynomials and concentration of vertex degree of large random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2116468)