On the one dimensional Poisson random geometric graph (Q642436)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5964136
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the one dimensional Poisson random geometric graph |
scientific article; zbMATH DE number 5964136 |
Statements
On the one dimensional Poisson random geometric graph (English)
0 references
26 October 2011
0 references
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.
0 references
Poisson process
0 references
service systems
0 references
queueing systems
0 references
0.7903432250022888
0 references
0.7801636457443237
0 references
0.7653515934944153
0 references
0.762944221496582
0 references
0.7624382376670837
0 references
