On the one dimensional Poisson random geometric graph

DOI10.1155/2011/350382MaRDI QIDQ642436zbMATH OpenOpenAlexWikidataFDO

Authors Laurent Decreusefond, E. Ferraz

Publication date 26 October 2011

Published in Journal of Probability and Statistics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1008.5140

zbMATH Keywords

Poisson processqueueing systemsservice systems

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

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.

Review text

A graph with vertices given by the points of a linear Poisson process is defined by edges between points that are closer than a fixed given threshold. Thus, the graph is a set of paths or clusters. A queueing representation of this setup is used to investigate its number of clusters and other properties. A Poisson process on a circle is also investigated.

Recommendations

• Distribution of components in the \(k\)-nearest neighbour random geometric graph for \(k\) below the connectivity threshold
• The distribution of the number of isolated nodes in the 1-dimensional soft random geometric graph
• Limit theory for the Gilbert graph
• Highly connected random geometric graphs
• Random Geometric Graphs

Cites work

• Asymptotics for sums of random variables with local subexponential behaviour
• Coordinate-free coverage in sensor networks with controlled boundaries via homology
• Covering the circle with random arcs of random sizes
• scientific article; zbMATH DE number 3851501 (Why is no real title available?)
• scientific article; zbMATH DE number 3764811 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• Limit theorems for Betti numbers of random simplicial complexes
• On multiple covering of a circle with random arcs
• Random geometric complexes

Cited in

(8)

• Concentration for Poisson \(U\)-statistics: subgraph counts in random geometric graphs
• The distribution of the number of isolated nodes in the 1-dimensional soft random geometric graph
• Poisson geometry of directed networks in a disk
• On percolation in one-dimensional stable Poisson graphs
• Concentration for Poisson functionals: component counts in random geometric graphs
• Simplicial homology of random configurations
• Topological properties of the one dimensional exponential random geometric graph
• Stable Poisson graphs in one dimension

This page was built for publication: On the one dimensional Poisson random geometric graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q642436)