Asymptotic analysis of k-hop connectivity in the 1D unit disk random graph model
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 c...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/181960 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | 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. |
|---|