Article contents
The Random Connection Model on the Torus
Published online by Cambridge University Press: 09 July 2014
Abstract
We study the diameter of a family of random graphs on the torus that can be used to model wireless networks. In the random connection model two points x and y are connected with probability g(y−x), where g is a given function. We prove that the diameter of the graph is bounded by a constant, which depends only on ‖g‖1, with high probability as the number of vertices in the graph tends to infinity.
Keywords
- Type
- Paper
- Information
- Combinatorics, Probability and Computing , Volume 23 , Issue 5: Honouring the Memory of Philippe Flajolet - Part 1 , September 2014 , pp. 796 - 804
- Copyright
- Copyright © Cambridge University Press 2014
References
- 3
- Cited by