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...

Full description

Saved in:
Bibliographic Details
Main Author: Privault, Nicolas
Other Authors: School of Physical and Mathematical Sciences
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
Be the first to leave a comment!
You must be logged in first