Related papers: Voronoi cells in random split trees
We investigate the statistics of trees grown from some initial tree by attaching links to preexisting vertices, with attachment probabilities depending only on the valence of these vertices. We consider the asymptotic mass distribution that…
In the $k$-Orthogonal Vectors ($k$-OV) problem we are given $k$ sets, each containing $n$ binary vectors of dimension $d=n^{o(1)}$, and our goal is to pick one vector from each set so that at each coordinate at least one vector has a zero.…
We consider the typical Poisson-Voronoi cell in the Euclidean space R d and in particular the maximal distance D from a vertex of that cell to its nucleus. We provide a sharp asymptotics for the tail distribution of D. As a byproduct, we…
We study Bernoulli bond percolation on a random recursive tree of size $n$ with percolation parameter $p(n)$ converging to $1$ as $n$ tends to infinity. The sizes of the percolation clusters are naturally stored in a tree. We prove…
We study rooted planar random trees with a probability distribution which is proportional to a product of weight factors $w_n$ associated to the vertices of the tree and depending only on their individual degrees $n$. We focus on the case…
It follows from a classical result of Jordan that every tree with maximum degree at most $r$ containing a vertex set labeled by $[n]$, has a single-edge cut which separates two subsets $A,B \subset [n]$ for which $\min\{|A|,|B|\} \ge…
Starting from any graph on $\{1, \ldots, n\}$, consider the Markov chain where at each time-step a uniformly chosen vertex is disconnected from all of its neighbors and reconnected to another uniformly chosen vertex. This Markov chain has a…
For Bernoulli percolation on a given graph $G = (V,E)$ we consider the cluster of some fixed vertex $o \in V$. We aim at comparing the number of vertices of this cluster in the set $V_+$ and in the set $V_-$, where $V_+,V_- \subset V$ have…
We achieve a detailed understanding of the $n$-sided planar Poisson-Voronoi cell in the limit of large $n$. Let ${p}\_n$ be the probability for a cell to have $n$ sides. We construct the asymptotic expansion of $\log {p}\_n$ up to terms…
We investigate Voronoi-like tessellations of bipartite quadrangulations on surfaces of arbitrary genus, by using a natural generalization of a bijection of Marcus and Schaeffer allowing to encode such structures into labeled maps with a…
A weighted recursive tree is an evolving tree in which vertices are assigned random vertex-weights and new vertices connect to a predecessor with a probability proportional to its weight. Here, we study the maximum degree and near-maximum…
Over some types of trees with a given number of vertices, which trees minimize or maximize the total number of subtrees or leaf containing subtrees are studied. Here are some of the main results:\ (1)\, Sharp upper bound on the total number…
We prove that a polynomial fraction of the set of $k$-component forests in the $m \times n$ grid graph have equal numbers of vertices in each component, for any constant $k$. This resolves a conjecture of Charikar, Liu, Liu, and Vuong, and…
Inspired by a concept in comparative genomics, we investigate properties of randomly chosen members of G_1(m,n,t), the set of bipartite graphs with $m$ left vertices, n right vertices, t edges, and each vertex of degree at least one. We…
Given a set S of n points in general position, we consider all k-th order Voronoi diagrams on S, for k=1,...,n, simultaneously. We deduce symmetry relations for the number of faces, number of vertices and number of circles of certain…
We consider a model of random tree growth, where at each time unit a new vertex is added and attached to an already existing vertex chosen at random. The probability with which a vertex with degree $k$ is chosen is proportional to $w(k)$,…
We investigate algorithms to find the first vertex in large trees generated by either the uniform attachment or preferential attachment model. We require the algorithm to output a set of $K$ vertices, such that, with probability at least…
High energy experimental data can be viewed as a sampling of the relevant phase space. We point out that one can apply Voronoi tessellations in order to understand the underlying probability distributions in this phase space. Interesting…
We revisit the approximate Voronoi cells approach for solving the closest vector problem with preprocessing (CVPP) on high-dimensional lattices, and settle the open problem of Doulgerakis-Laarhoven-De Weger [PQCrypto, 2019] of determining…
This article provides numerical evidence that under volume constraint the ball is the set which maximizes the perimeter of the least-perimeter partition into cells with prescribed areas. We introduce a numerical maximization algorithm which…