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

DOI10.1007/S10959-020-01025-WzbMATH Open1484.05187arXiv1904.01339OpenAlexW3090491767MaRDI QIDQ2116468FDOQ2116468

Oleksiy Khorunzhiy

Publication date: 17 March 2022

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

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.

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

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

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)

Cites Work

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

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

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)