Related papers: The Stretch - Length Tradeoff in Geometric Network…
We propose a consistent approach to the statistics of the shortest paths in random graphs with a given degree distribution. This approach goes further than a usual tree ansatz and rigorously accounts for loops in a network. We calculate the…
Using a coupling argument, we establish a general weak law of large numbers for functionals of binomial point processes in d-dimensional space, with a limit that depends explicitly on the (possibly non-uniform) density of the point process.…
This research establishes that many real-world networks exhibit bounded expansion, a strong notion of structural sparsity, and demonstrates that it can be leveraged to design efficient algorithms for network analysis. We analyze several…
The online increasing subsequence problem is a stochastic optimisation task with the objective to maximise the expected length of subsequence chosen from a random series by means of a nonanticipating decision strategy. We study the…
We introduce the notion of intensity reweighted moment pseudostationary point processes on linear networks. Based on arbitrary general regular linear network distances, we propose geometrically corrected versions of different higher-order…
The edges in networks are not only binary, either present or absent, but also take weighted values in many scenarios (e.g., the number of emails between two users). The covariate-$p_0$ model has been proposed to model binary directed…
Over the past decade, many works on the modeling of wireless networks using stochastic geometry have been proposed. Results about probability of coverage, throughput or mean interference, have been provided for a wide variety of networks…
The Wiener index of a network, introduced by the chemist Harry Wiener, is the sum of distances between all pairs of nodes in the network. This index, originally used in chemical graph representations of the non-hydrogen atoms of a molecule,…
Disordered complex networks are of fundamental interest as stochastic models for information transmission over wireless networks. Well-known networks based on the Poisson point process model have limitations vis-a-vis network efficiency,…
Against common sense, auxetic materials expand or contract perpendicularly when stretched or compressed, respectively, by uniaxial strain, being characterized by a negative Poisson's ratio $\nu$. The amount of deformation in response to the…
Motivated by an application in wireless telecommunication networks, we consider a two-type continuum-percolation problem involving a homogeneous Poisson point process of users and a stationary and ergodic point process of base stations.…
The resiliency of a network is its ability to remain \emph{effectively} functioning also when any of its nodes or links fails. However, to reduce operational and set-up costs, a network should be small in size, and this conflicts with the…
We study the minimum number of constraints needed to formulate random instances of the maximum stable set problem via linear programs (LPs), in two distinct models. In the uniform model, the constraints of the LP are not allowed to depend…
We consider the interlacement Poisson point process on the space of doubly-infinite Z^d-valued trajectories modulo time-shift, tending to infinity at positive and negative infinite times. The set of vertices and edges visited by at least…
The average distance from a node to all other nodes in a graph, or from a query point in a metric space to a set of points, is a fundamental quantity in data analysis. The inverse of the average distance, known as the (classic) closeness…
We study an inhomogeneous random connection model in the connectivity regime. The vertex set of the graph is a homogeneous Poisson point process $\mathcal{P}_s$ of intensity $s>0$ on the unit cube…
We study the problem of finding a triangulation T of a planar point set S such as to minimize the expected distance between two points x and y chosen uniformly at random from S. By distance we mean the length of the shortest path between x…
We study point processes that consist of certain centers of point tuples of an underlying Poisson process. Such processes arise in stochastic geometry in the study of exceedances of various functionals describing geometric properties of the…
Optimal paths connecting randomly selected network nodes and fixed routers are studied analytically in the presence of non-linear overlap cost that penalizes congestion. Routing becomes increasingly more difficult as the number of selected…
Define the scaled empirical point process on an independent and identically distributed sequence $\{Y_i: i\le n\}$ as the random point measure with masses at $a_n^{-1} Y_i$. For suitable $a_n$ we obtain the weak limit of these point…