Related papers: Voronoi cells in random split trees

A $k$-nearly independent vertex subset of a graph $G$ is a set of vertices that induces a subgraph containing exactly $k$ edges. For $k = 0$, this coincides with the classical notion of independent subsets. This paper investigates the…

We consider the 3D Poisson-Voronoi tessellation. We investigate the joint probability distribution pi_n(L) for an arbitrarily selected cell face to be n-edged and for the distance between the seeds of its adjacent cells to be equal to 2L.…

An important open question in the modeling of biological tissues is how to identify the right scale for coarse-graining, or equivalently, the right number of degrees of freedom. For confluent biological tissues, both vertex and Voronoi…

Voronoi tessellations are used to partition the Euclidean space into polyhedral regions, which are called Voronoi cells. Labeling the Voronoi cells with the class information, we can map any classification problem into a Voronoi…

In this paper, we are interested in the behavior of the typical Poisson-Voronoi cell in the plane when the radius of the largest disk centered at the nucleus and contained in the cell goes to infinity. We prove a law of large numbers for…

In this paper we enumerate and give bijections for the following four sets of vertices among rooted ordered trees of a fixed size: (i) first-children of degree $k$ at level $\ell$, (ii) non-first-children of degree $k$ at level $\ell-1$,…

We extend the theory of logarithmic Voronoi cells to Gaussian statistical models. In general, a logarithmic Voronoi cell at a point on a Gaussian model is a convex set contained in its log-normal spectrahedron. We show that for models of ML…

We study minimal vertex covers of trees. Contrarily to the number $N_{vc}(A)$ of minimal vertex covers of the tree $A$, $\log N_{vc}(A)$ is a self-averaging quantity. We show that, for large sizes $n$, $\lim_{n\to +\infty} <\log…

We introduce the inverse Voronoi diagram problem in graphs: given a graph $G$ with positive edge-lengths and a collection $\mathbb{U}$ of subsets of vertices of $V(G)$, decide whether $\mathbb{U}$ is a Voronoi diagram in $G$ with respect to…

We study the typical cell of the Poisson-Voronoi tessellation. We show that when divided by the $d$-th root of the intensity parameter $\lambda$ of the Poisson process times the volume of the unit ball, the inradius, outradius, diameter and…

We introduce a new class of spatial-temporal point processes based on Voronoi tessellations. At each step of such a process, a point is chosen at random according to a distribution determined by the associated Voronoi cells. The point is…

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…

In spatial networks vertices are arranged in some space and edges may cross. When arranging vertices in a 1-dimensional lattice edges may cross when drawn above the vertex sequence as it happens in linguistic and biological networks. Here…

Motivated by recent new Monte Carlo data we investigate a heuristic asymptotic theory that applies to n-faced 3D Poisson-Voronoi cells in the limit of large n. We show how this theory may be extended to n-edged cell faces. It predicts the…

We prove that for any fixed $k$, the probability that a random vertex of a random increasing plane tree is of rank $k$, that is, the probability that a random vertex is at distance $k$ from the leaves, converges to a constant $c_k$ as the…

An optimal data partitioning in parallel & distributed implementation of clustering algorithms is a necessary computation as it ensures independent task completion, fair distribution, less number of affected points and better & faster…

Motivated by online recommendation systems, we study a family of random forests. The vertices of the forest are labeled by integers. Each non-positive integer $i\le 0$ is the root of a tree. Vertices labeled by positive integers $n \ge 1$…

Voronoi cells of a discrete set in Euclidean space are known as generalized polyhedra. We identify polyhedral cells of a discrete set through a direction cone. For an arbitrary set we distinguish polyhedral from non-polyhedral cells using…

We consider the Voronoi diagram of lines in $\mathbb{R}^3$ under the Euclidean metric, and give a full classification of its structure in the base case of four lines in general position. We first show that the number of vertices in the…

A permutation $\boldsymbol w$ gives rise to a graph $G_{\boldsymbol w}$; the vertices of $G_{\boldsymbol w}$ are the letters in the permutation and the edges of $G_{\boldsymbol w}$ are the inversions of $\boldsymbol w$. We find that the…