2019
DOI: 10.48550/arxiv.1904.01339
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

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

Abstract: We study the asymptotic behavior of single variable Bell polynomials B k (x) and polynomials Bk (x) related with restricted Bell numbers in the limit of infinite k and x > 0. We discuss our results in connection with the spectral theory of random matrices and properties of the vertex degree of large random graphs.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
10
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(11 citation statements)
references
References 27 publications
1
10
0
Order By: Relevance
“…Although (3.23) is not exactly the Borel transform of (3.22), we expect it will have the same convergence properties. Using theorem 2.1 of [20] one can check that (3.23) converges to an entire function of λ.…”
Section: A Splitting Formulamentioning
confidence: 99%
See 2 more Smart Citations
“…Although (3.23) is not exactly the Borel transform of (3.22), we expect it will have the same convergence properties. Using theorem 2.1 of [20] one can check that (3.23) converges to an entire function of λ.…”
Section: A Splitting Formulamentioning
confidence: 99%
“…. , b n } for A, so θ(a i b j ) = δ ij , and such that a i b i = s. A good example of this structure is provided by the cohomology of an arbitrary manifold, 20 A = H * (M ; κ). Then if dimM = m we can take N k to be the subspace of forms of degree ≥ m − k. Then we take a 1 = 1, .…”
Section: Some Remarks On the General Non-semisimple Casementioning
confidence: 99%
See 1 more Smart Citation
“…Here R k = B k (2) for infinite 1D system, R k = B k for semi-infinite 1D system with a boundary, and R k = C P k (q −1 0 ) for D ≥ 2. Using the asymptotic behavior of Bell polynomials [31]…”
Section: B Constraints On Power Spectrummentioning
confidence: 99%
“…In paper [14], we considered the maximal vertex degree of random graphs d max = max i=1,...,n d i in the limit when n and p tend to infinity simultaneously. We have studied the concentration properties of d max with the help of high moments of random variables d i .…”
Section: Introductionmentioning
confidence: 99%