Related papers: Poisson--Voronoi approximation
Voronoi tessellations of Poisson point processes are widely used for modeling many types of physical and biological systems. In this paper, we analyze simulated Poisson-Voronoi structures containing a total of 250,000,000 cells to provide…
Poisson Voronoi tessellations have been used in modeling many types of systems across different sciences, from geography and astronomy to telecommunications. The existing literature on the statistical properties of Poisson Voronoi cells is…
In this paper we use a Malliavin-Stein type method to investigate Poisson and normal approximations for the measurable functions of infinitely many independent random variables. We combine Stein's method with the difference operators in…
We describe a set of new estimators for the N-point correlation functions of point processes. The variance of these estimators is calculated for the Poisson and binomial cases. It is shown that the variance of the unbiased estimator…
We consider Gaussian approximation in three particular models of Poisson-Laguerre tessellations, namely, the $\beta$-, $\beta'$- and Gaussian-Voronoi tessellations. The tessellations are constructed based on inhomogeneous Poisson point…
We study percolation in the following random environment: let $Z$ be a Poisson process of constant intensity in the plane, and form the Voronoi tessellation of the plane with respect to $Z$. Colour each Voronoi cell black with probability…
We give a general framework for approximations to combinatorial assemblies, especially suitable to the situation where the number $k$ of components is specified, in addition to the overall size $n$. This involves a Poisson process, which,…
Consider a Poisson point process within a convex set in a Euclidean space. The Vietoris-Rips complex is the clique complex over the graph connecting all pairs of points with distance at most $\delta$. Summing powers of the volume of all…
We present an accurate and rapid solution of Poisson's equation for space-filling, arbitrarily- shaped, convex Voronoi polyhedra (VP); the method is O(NVP), where NVP is the number of distinct VP representing the system. In effect, we…
Voronoi diagrams appear in many areas in science and technology and have numerous applications. They have been the subject of extensive investigation during the last decades. Roughly speaking, they are a certain decomposition of a given…
We consider the approximation of Poisson type problems where the source is given by a singular measure and the domain is a convex polygonal or polyhedral domain. First, we prove the well-posedness of the Poisson problem when the source…
Consider two independent Poisson point processes of unit intensity in the Euclidean space of dimension $d$ at least 3. We construct a perfect matching between the two point sets that is a factor (i.e., an equivariant measurable function of…
We present an extension of Voronoi diagrams where when considering which site a client is going to use, in addition to the site distances, other site attributes are also considered (for example, prices or weights). A cell in this diagram is…
Given a set of $n$ sites from $\mathbb{R}^d$, each having some positive weight factor, the Multiplicatively Weighted Voronoi Diagram is a subdivision of space that associates each cell to the site whose weighted Euclidean distance is…
In this article, we obtain, for the total variance distance, the error bounds between Poisson and convolution of power series distributions via Stein's method. This provides a unified approach to many known discrete distributions. Several…
Let $M$ be an $n$-dimensional Hadamard manifold of pinched negative curvature $-b^2 \leq K_M \leq -a^2$. The solution of the Dirichlet problem at infinity for $M$ leads to the construction of a family of mutually absolutely continuous…
Assuming a $q$-variant of the prime $k$-tuple conjecture uniformly, we compute mixed moments of the number of primes in disjoint short intervals and progressions, respectively. This involves estimating the mean of singular series along…
We consider offsets of a union of convex objects. We aim for a filtration, a sequence of nested cell complexes, that captures the topological evolution of the offsets for increasing radii. We describe methods to compute a filtration based…
We study the largest gaps between successive zeros of a smooth stationary Gaussian process. Our main result is that, if correlations decay at least polynomially, then after suitable rescaling of the locations and sizes of the largest gaps…
In this thesis we study sets of points in the plane and their Voronoi diagrams, in particular when the points coincide. We bring together two ways of studying point sets that have received a lot of attention in recent years: Voronoi…