Cumulants and Limit Theorems for $q$-step walks on random graphs of long-range percolation radius model (2407.11667v3)
Abstract: We study cumulants of $q$-step walks and $3$-step closed walks on Erd\"os-R\'enyi-type random graphs of long-range percolation radius model in the limit when the number of vertices $N$, concentration $c$, and the interaction radius $R$ tend to infinity. These cumulants represent terms of cumulant expansion of the free energy of discrete analogs of matrix models widely known in mathematical and theoretical physics. Using a diagram technique, we show that the limiting values of $k$-th cumulants ${\cal F}_k{(q)}$ exist and can be associated with one or another family of tree-type diagrams, in dependence of the asymptotic behavior of parameters $cR/N$ for $q$-step non-closed walks and $c2R/N2$ for 3-step closed walks, respectively. These results allow us to prove Limit Theorems for the number of non-closed walks and for the number of triangles in large random graphs. Adapting the Pr\"ufer codification procedure to the tree-type diagrams obtained, we get explicit expressions for their numbers. This allows us to get upper bounds for ${\cal F}_k{(q)}$ as $k\to\infty$ and, in the limit of infinite $q$, to get upper bounds in terms of high moments of Compound Poisson distribution.
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.