Connectivity of Large Scale Networks: Emergence of Unique Unbounded Component
Abstract
This paper studies networks where all nodes are distributed on a unit square following a Poisson distribution with known density and a pair of nodes separated by an Euclidean distance are directly connected with probability , independent of the event that any other pair of nodes are directly connected. Here satisfies the conditions of rotational invariance, non-increasing monotonicity, integral boundedness and ; further, where and is a constant. Denote the above network by\textmd{}. We show that as , asymptotically almost surely a) there is no component in of fixed and finite order ; b) the number of components with an unbounded order is one. Therefore as , the network asymptotically almost surely contains a unique unbounded component and isolated nodes only; a sufficient condition for to be asymptotically almost surely connected is that there is no isolated node in the network.{\normalsize{}}The contribution of these results, together with results in a companion paper on the asymptotic distribution of isolated nodes in \textmd{\normalsize }, is to expand recent results obtained for connectivity of random geometric graphs from the unit disk model to the more generic and more practical random connection model.
Keywords
Cite
@article{arxiv.1103.1991,
title = {Connectivity of Large Scale Networks: Emergence of Unique Unbounded Component},
author = {Guoqiang Mao and Brian DO Anderson},
journal= {arXiv preprint arXiv:1103.1991},
year = {2012}
}
Comments
This paper has been withdrawn because of a latter version was accepted into IEEE Transaction on Information Theory