Related papers: Central limit theorems for the radial spanning tre…

Let $\eta_t$ be a Poisson point process with intensity measure $t\mu$, $t>0$, over a Borel space $\mathbb{X}$, where $\mu$ is a fixed measure. Another point process $\xi_t$ on the real line is constructed by applying a symmetric function…

We prove consistency of four different approaches to formalizing the idea of minimum average edge-length in a path linking some infinite subset of points of a Poisson process. The approaches are (i) shortest path from origin through some…

We give tightness criteria for random variables taking values in the space of all compact sets of cadlag real-valued paths, in terms of both the Skorohod J1 and M1 topologies. This extends earlier work motivated by the study of the Brownian…

We study the number of isolated nodes in a soft random geometric graph whose vertices constitute a Poisson process on the torus of length L (the line segment [0,L] with periodic boundary conditions), and where an edge is present between two…

Given a Poisson process on a $d$-dimensional torus, its random geometric simplicial complex is the complex whose vertices are the points of the Poisson process and simplices are given by the \u{C}ech complex associated to the coverage of…

The Euclidean Steiner tree problem, normally posed in two dimensions, seeks to connect a set of prescribed terminal nodes by placing additional nodes, known as Steiner points, with edges connecting such nodes either to another Steiner point…

Let $P$ be a set of points and $L$ a set of lines in the (extended) Euclidean plane, and $I \subseteq P\times L$, where $i =(p,l) \in I$ means that point $p$ and line $l$ are incident. The incidences can be interpreted as quadratic…

We propose a distribution-free approach to the study of random geometric graphs. The distribution of vertices follows a Poisson point process with intensity function $nf(\cdot)$, where $n\in \mathbb{N}$, and $f$ is a probability density…

We study vantage-point trees constructed using an independent sample from the uniform distribution on a fixed convex body $K$ in $(\mathbb{R}^d,\|\cdot\|)$, where $\|\cdot\|$ is an arbitrary norm on $\mathbb{R}^d$. We prove that a sequence…

It is known that the number of points in the largest cluster of a percolating Poisson process restricted to a large finite box is asymptotically normal. In this note, we establish a rate of convergence for the statement. As each point in…

We consider the minimum spanning tree problem on a weighted complete bipartite graph $K_{n_R, n_B}$ whose $n=n_R+n_B$ vertices are random, i.i.d. uniformly distributed points in the unit cube in $d$ dimensions and edge weights are the…

We analyze the threshold network model in which a pair of vertices with random weights are connected by an edge when the summation of the weights exceeds a threshold. We prove some convergence theorems and central limit theorems on the…

We study a local thinning $T_r$ that retains a point with probability $p(n_r)$, where $n_r$ counts neighbors within radius $r$. For Poisson input with spatially varying intensity, we obtain an exact intensity via a Poisson--mixture formula…

Poisson point processes provide a versatile framework for modeling the distributions of random points in space. When the space is partitioned into cells, each associated with a single generating point from the Poisson process, there appears…

We study the growth of a time-ordered rooted tree by probabilistic attachment of new vertices to leaves. We construct a likelihood function of the leaves based on the connectivity of the tree. We take such connectivity to be induced by the…

We prove that under an easily verifiable set of conditions a sequence of associated random fields converges under rescaling to the Poisson Point Process and give a couple of examples.

We show a central limit theorem for random walk on a Galton-Watson tree, when the edges of the tree are assigned randomly uniformly elliptic conductances. When a positive fraction of edges is assigned a small conductance $\varepsilon$, we…

In 1986, Janson showed that the number of edges in the union of $k$ random spanning trees in the complete graph $K_n$ is a shifted Poisson distribution. Using results from the theory of electrical networks, we provide a new proof of this…

It has been conjectured since the work of Lalley and Sellke (1987) that the branching Brownian motion seen from its tip (e.g. from its rightmost particle) converges to an invariant point process. Very recently, it emerged that this can be…

It is shown that for a non-decreasing self-similar stochastic process $T$ with independent increments, the range of $T$ forms a Poisson point process with $\sigma$-finite intensity if and only if the one-dimensional distribution of $T(1)$…