The Random Connection Model on the Torus
- 9 July 2014
- journal article
- research article
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 23 (5) , 796-804
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 pointsxandyare connected with probabilityg(y−x), wheregis 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
This publication has 8 references indexed in Scilit:
- Analytic Combinatorics2009
- Airy Phenomena and Analytic Combinatorics of Connected GraphsThe Electronic Journal of Combinatorics, 2004
- On the robustness of interconnections in random graphs: a symbolic approachTheoretical Computer Science, 2002
- On a continuum percolation modelAdvances in Applied Probability, 1991
- On a continuum percolation modelAdvances in Applied Probability, 1991
- Random walks, Gaussian processes and list structuresTheoretical Computer Science, 1987
- On the capacity of disjointly shared networksComputer Networks and ISDN Systems, 1985
- Random Plane NetworksJournal of the Society for Industrial and Applied Mathematics, 1961