Related papers: Return to the Poissonian City
We give a deterministic algorithm to construct a graph with no loops (a tree or a forest) whose vertices are the points of a d-dimensional stationary Poisson process S, subset of R^d. The algorithm is independent of the origin of…
We introduce a cellular automaton model coupled with a transport equation for flows on graphs. The direction of the flow is described by a switching process where the switching probability dynamically changes according to the value of the…
A common way of classifying network connectivity is the association of the nodal degree distribution to specific probability distribution models. During the last decades, researchers classified many networks using the Poisson or Pareto…
Recent years have seen an increased interest in the application of methods and techniques commonly associated with machine learning and artificial intelligence to spatial statistics. Here, in a celebration of the ten-year anniversary of the…
This paper deals with the intersection point process of a stationary and isotropic Poisson hyperplane process in $\mathbb{R}^d$ of intensity $t>0$, where only hyperplanes that intersect a centred ball of radius $R>0$ are considered. Taking…
Kinetic theory describes a dilute monatomic gas using a distribution function $f(q,p,t)$, the expected phase-space density of particles. The distribution function evolves according to the collisionless Boltzmann equation in the high Knudsen…
Many phenomena can be modeled as network dynamics with punctuate interactions. However, most relevant dynamics do not allow for computational tractability. To circumvent this difficulty, the Poisson Hypothesis regime replaces interaction…
We construct random point processes in the complex plane that are asymptotically close to a given doubling measure. The processes we construct are the zero sets of random entire functions that are constructed through generalised Fock…
This article presents a biological neural network model driven by inhomogeneous Poisson processes accounting for the intrinsic randomness of synapses. The main novelty is the introduction of local interactions: each firing neuron triggers…
This note answers one question in [math.PR/0505668], concerning the connected allocation for the Poisson process in R^2. The proposed solution makes use of the Riemann map from the plane minus the minimal spanning forest of the Poisson…
A disordered medium is often constructed by $N$ points independently and identically distributed in a $d$-dimensional hyperspace. Characteristics related to the statistics of this system is known as the random point problem. As $d \to…
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…
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure communication in the presence of eavesdroppers is possible. The…
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…
For a sensor network, a tractable spatially-dependent node deployment model is presented with the property that the density is inversely proportional to the sink distance. A stochastic model is formulated to examine message advancements…
Poisson processes of so-called $\lambda$-geodesic hyperplanes in $d$-dimensional hyperbolic space are studied for $0\leq\lambda\leq 1$. The case $\lambda=0$ corresponds to genuine geodesic hyperplanes, the case $\lambda=1$ to horospheres…
Melamed's theorem states that for a Jackson queuing network, the equilibrium flow along a link follows Poisson distribution if and only if no customers can travel along the link more than once. Barbour \& Brown~(1996) considered the Poisson…
We derive large- and moderate-deviation results in random networks given as planar directed navigations on homogeneous Poisson point processes. In this non-Markovian routing scheme, starting from the origin, at each consecutive step a…
Transportation and distribution networks are a class of spatial networks that have been of interest in recent years. These networks are often characterized by the presence of complex structures such as central loops paired with peripheral…
We study the scattering of waves in systems with losses or gains simulated by imaginary potentials. This is done for a complex delta potential that corresponds to a spatially localized absorption or amplification. In the Argand plane the…