Related papers: The Stretch - Length Tradeoff in Geometric Network…
We consider the supercritical finite-range random connection model where the points $x,y$ of a homogeneous planar Poisson process are connected with probability $f(|y-x|)$ for a given $f$. Performing percolation on the resulting graph, we…
Asymptotic behavior of the point process of high and medium values of a Gaussian stationary process with discrete time is considered. An approximation by a Poisson cluster point process is given for the point process.
The average distance of a vertex $v$ of a connected graph $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$. The proximity $\pi(G)$ and the remoteness $\rho(G)$ of $G$ are the minimum and the maximum of the…
We study the growth of random networks under a constraint that the diameter, defined as the average shortest path length between all nodes, remains approximately constant. We show that if the graph maintains the form of its degree…
Little's law allows to express the mean user throughput in any region of the network as the ratio of the mean traffic demand to the steady-state mean number of users in this region. Corresponding statistics are usually collected in…
We analyze the structure of networks minimizing the global resistance to flow (or dissipated energy) with respect to two different constraints: fixed total channel volume and fixed total channel surface area. First, we determine the shape…
Empty region graphs are graphs whose vertices are points in $\mathbb{R}^d$ and where two vertices are connected by an edge whenever some associated region does not contain any other vertices. We investigate the asymptotic behaviour of long…
Suppose $\left\{x_1, \dots, x_n\right\} \subset \mathbb{R}^2$ is a set of $n$ points in the plane with diameter $\leq 1$, meaning $|x_i - x_j| \leq 1$ for all $1 \leq i,j \leq n$. We show that the ratio of the number of ``neighbors''…
We describe the structure of connected graphs with the minimum and maximum average distance, radius, diameter, betweenness centrality, efficiency and resistance distance, given their order and size. We find tight bounds on these graph…
We study translation-invariant determinantal random point fields on the real line. We prove, under quite general conditions, that the smallest nearest spacings between the particles in a large interval have Poisson statistics as the length…
We study the graph constructed on a Poisson point process in $d$ dimensions by connecting each point to the $k$ points nearest to it. This graph a.s. has an infinite cluster if $k > k_c(d)$ where $k_c(d)$, known as the critical value,…
The Thorup-Zwick (TZ) routing scheme is the first generic stretch-3 routing scheme delivering a nearly optimal local memory upper bound. Using both direct analysis and simulation, we calculate the stretch distribution of this routing scheme…
This letter describes a direct method for computing the spatially averaged outage probability of a network with interferers located according to a point process and signals subject to fading. Unlike most common approaches, it does not…
In recent times, the use of stochastic geometry has become a popular and important tool for performance analysis of next-generation dense small cell wireless networks. Usually, such networks are modeled using 2 dimensional spatial Poisson…
Consider the continuum of points along the edges of a network, i.e., an undirected graph with positive edge weights. We measure distance between these points in terms of the shortest path distance along the network, known as the network…
This paper introduces a general theoretical framework to analyze noise limited networks. More precisely, we consider two homogenous Poisson point processes of base stations and users. General model of radio signal propagation and effect of…
We introduce a stochastic geometry dynamics inspired by opinion dynamics that captures the essence of modern asymmetric social networks with leaders and followers. Points in the Euclidean space represent opinions, and the leader of an agent…
We propose and prove a theorem that allows the calculation of a class of functionals on Poisson point processes that have the form of expected values of sum-products of functions. In proving the theorem, we present a variant of the…
Interference field in wireless networks is often modeled by a homogeneous Poisson Point Process (PPP). While it is realistic in modeling the inherent node irregularity and provides meaningful first-order results, it falls short in modeling…
Motivated by results of Henry, Pralat and Zhang (PNAS 108.21 (2011): 8605-8610), we propose a general scheme for evolving spatial networks in order to reduce their total edge lengths. We study the properties of the equilbria of two networks…