Asymptotic Analysis of k-Hop Connectivity in the 1D Unit Disk Random Graph Model

Nicolas Privault

Methodology and Computing in Applied Probability, 2024, vol. 26, issue 4, 1-26

Abstract: Abstract We propose an algorithm for the closed-form recursive computation of joint moments and cumulants of all orders of k-hop counts in the 1D unit disk random graph model with Poisson distributed vertices. Our approach uses decompositions of k-hop counts into multiple Poisson stochastic integrals. As a consequence, using the Stein and cumulant methods we derive Berry-Esseen bounds for the asymptotic convergence of renormalized k-hop path counts to the normal distribution as the density of Poisson vertices tends to infinity. Computer codes for the recursive symbolic computation of moments and cumulants of any orders are provided as an online resource.

Keywords: Random graph; 1D unit disk model; k-hop counts; Poisson process; Multiple stochastic integrals; Moments; Cumulants; 05C80; 60G55; 60F05; 60B10 (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11009-024-10115-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:metcap:v:26:y:2024:i:4:d:10.1007_s11009-024-10115-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/11009

DOI: 10.1007/s11009-024-10115-9

Access Statistics for this article

Methodology and Computing in Applied Probability is currently edited by Joseph Glaz

More articles in Methodology and Computing in Applied Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().