Connectivity of Waxman topology models

Waxman graphs are a popular class of random graphs used for modelling the Internet topology, especially for the intra-domain part. When used for network modelling purposes their connectedness properties are particularly relevant, both for the characteristics of the realized graph and for the generation time. In this paper, the probability of obtaining a connected Waxman graph is derived analytically for the general case of nodes disposed over a rectangular area (as opposed to the special case of an underlying square area already investigated in the literature) and is related to the values of the Waxman parameters used in the generation of the graph.