Consider a graph on n uniform random points in the unit square, each pair being connected
by an edge with probability p if the inter-point distance is at most r. We show that as n→∞ …

In the original (1961) Gilbert model of random geometric graphs, nodes are placed
according to a Poisson point process, and links formed between those within a fixed range …

This paper presents an integrated multi-agent approach, coupled with percolation theory
and network science, to measure the mobility impacts (ie, mean travel time of the system) of …

The use of network theory to model disease propagation on populations introduces
important elements of reality to the classical epidemiological models. The use of random …

This paper presents a model of the connectivity of a wireless sensor network (WSN)
deployed over a square area, which considers border effects. This model supports an …

Nodes are randomly distributed within an annulus (and then a shell) to form a point pattern
of communication terminals which are linked stochastically according to the Rayleigh fading …

Random geometric networks are mathematical structures consisting of a set of nodes placed
randomly within a bounded set V⊆ ℝ d mutually coupled with a probability dependent on …

Recently, the mission-critical push-to-talk (MCPTT) system has emerged as the new
broadband technology for public safety networks. In this paper, we propose a route selection …

In the classic model of first-passage percolation, for pairs of vertices separated by a
Euclidean distance L, geodesics exhibit deviations from their mean length L that are of order …

We present an analysis of the probability that a set of devices capable of communicating
wirelessly can form a fully connected, trusted network. The network model that is used …