Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T14:44:31.888Z Has data issue: false hasContentIssue false

On the connectivity and diameter of small-world networks

Part of:Graph theory

Published online by Cambridge University Press:  01 July 2016

Ayalvadi Ganesh*
Affiliation:
Microsoft Research
Feng Xue*
Affiliation:
University of Illinois at Urbana-Champaign
*
∗ Current address: Department of Mathematics, University of Bristol, University Walk, Bristol BS8 1TW, UK. Email address: a.ganesh@bristol.ac.uk
∗∗ Current address: Communications Technology Laboratory, Intel Corporation, Santa Clara, CA 95052, USA. Email address: feng.xue1@intel.com
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We consider two different models of small-world graphs on nodes whose locations are modelled by a stochastic point process. In the first model each node is connected to a fixed number of its nearest neighbours, while in the second model each node is connected to all nodes located within some fixed distance. In both models, nodes are additionally connected via shortcuts to other nodes chosen uniformly at random. We obtain sufficient conditions for connectivity in the first model, and necessary conditions in the second model. Thereby, we show that connectivity is achieved at a smaller value of total degree (nearest neighbours plus shortcuts) in the first model. We also obtain bounds on the diameter of the graph in this model.

MSC classification

Information

Type
Stochastic Geometry and Statistical Applications
Copyright
Copyright © Applied Probability Trust 2007