On the one dimensional Poisson random geometric graph

Abstract : Given a Poisson process on a bounded interval, its random geometric graph is the graph whose vertices are the points of the Poisson process and edges exist between two points if and only if their distance is less than a fixed given threshold. We compute explicitly the distribution of the number of connected components of this graph. The proof relies on inverting some Laplace transforms.
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal-imt.archives-ouvertes.fr/hal-00512548
Contributor : Laurent Decreusefond <>
Submitted on : Monday, August 30, 2010 - 5:55:48 PM
Last modification on : Wednesday, March 13, 2019 - 5:23:44 PM
Long-term archiving on : Thursday, December 1, 2016 - 6:49:30 PM

Files

unidim-2.pdf
Files produced by the author(s)

Identifiers

Citation

Laurent Decreusefond, Eduardo Ferraz. On the one dimensional Poisson random geometric graph. Journal of Probability and Statistics, 2011, 2011, pp.Article ID 350382. ⟨10.1155/2011/350382⟩. ⟨hal-00512548⟩

Share

Metrics

Record views

334

Files downloads

158