Back to Research papers
Research paper index

On the Probability of Network States with Gaussian Connectivity Functions

Amy S. Inwood, Peter J. Smith, Pawel Dmochowski, Carl P. Dettmann, Justin P. Coon, Michail Matthaiou

arXiv:2608.17622Published August 18, 20260 citations
  • eess.SP
  • math.PR

Abstract

In this paper, we consider the connectivity of a random network of N mobile devices in three dimensions (3D), where the location of each device or node has a Gaussian distribution in each dimension. For each pair of nodes, the probability of connectivity is related to the nodes' separation by a Gaussian connectivity function. The fundamental analytical tool for studying such systems is the probability of a given network state, derived and expressed in terms of its graph Laplacian. Leveraging this result, we obtain results for the connectivity of small networks, the probability of a complete network (where all nodes are connected to all other nodes), and the probability of an isolated node, which gives an approximation to the connectivity probability of larger networks. The general results are then simplified for special cases and limiting scenarios.

Read the original paper

This page indexes public paper metadata. The manuscript remains with its original publisher and authors.