Related papers: Greedy Polyominoes and first-passage times on rand…

Let $G$ be a vertex-transitive graph of superlinear polynomial growth. Given $r>0$, let $G_r$ be the graph on the same vertex set as $G$, with two vertices joined by an edge if and only if they are at graph distance at most $r$ apart in…

What is the maximum number of holes enclosed by a $d$-dimensional polyomino built of $n$ tiles? Represent this number by $f_d(n)$. Recent results show that $f_2(n)/n$ converges to $1/2$. We prove that for all $d \geq 2$ we have $f_d(n)/n…

Let $P$ be a planar set of $n$ sites in general position. For $k\in\{1,\dots,n-1\}$, the Voronoi diagram of order $k$ for $P$ is obtained by subdividing the plane into cells such that points in the same cell have the same set of nearest $k$…

We study a random growth model on $\R^d$ introduced by Deijfen. This is a continuous first-passage percolation model. The growth occurs by means of spherical outbursts with random radii in the infected region. We aim at finding conditions…

We study local modifications of the graph distance in large random triangulations. Our main results show that, in large scales, the modified distance behaves like a deterministic constant $\mathbf{c}~\in~(0,\infty)$ times the usual graph…

We consider directed last-passage percolation on the random graph G = (V,E) where V = Z and each edge (i,j), for i < j, is present in E independently with some probability 0 < p <= 1. To every present edge (i,j) we attach i.i.d. random…

The rough Bergomi (rBergomi) model, characterised by its roughness parameter $H$, has been shown to exhibit multiscaling behaviour as $H$ approaches zero. Multiscaling has profound implications for financial modelling: it affects extreme…

Let $\{X(v), v \in \Bbb Z^d \times \Bbb Z_+\}$ be an i.i.d. family of random variables such that $P\{X(v)= e^b\}=1-P\{X(v)= 1\} = p$ for some $b>0$. We consider paths $\pi \subset \Bbb Z^d \times \Bbb Z_+$ starting at the origin and with…

It is proved that every pseudo-self-affine tiling in R^d is mutually locally derivable with a self-affine tiling. A characterization of pseudo-self-similar tilings in terms of derived Voronoi tessellations is a corollary. Previously, these…

A novel algorithm to detect coherent structures with sparse Lagrangian particle tracking data, using Voronoi tessellation and techniques from spectral graph theory, is tested. Neighbouring tracer particles are naturally identified through…

Let $S_n$ be partial sums of an i.i.d. sequence $\{X_i\}$. We assume that $\mathbb{E} X_1 <0$ and $\mathbb{P}[X_1>0]>0$. In this paper we study the first passage time $$ \tau_u = \inf\{n:\; S_n > u\}. $$ The classical Cram\'er's estimate of…

We consider first-passage percolation on $\mathbb{Z}^2$ with i.i.d. weights, whose distribution function satisfies $F(0) = p_c = 1/2$. This is sometimes known as the "critical case" because large clusters of zero-weight edges force passage…

Consider $\Xi$ a homogeneous Poisson point process on $\mathbb{R}^d$ ($d\geq 2$) with unit intensity with respect to the Lebesgue measure. For $\varepsilon\geq 0$, we define the Boolean model $\Sigma_{p, \varepsilon}$ as the union of the…

An "experimental" study on the randomness of the fractional digits of $\pi$, $e$ and $\phi$ irrational numbers are presented. This is done by exploiting the $1D$ Poisson-Voronoi tessellation. We employed two approaches and in both cases,…

Given an infinite connected graph $G$, a way to randomly perturb its metric is to assign random i.i.d. lengths to the edges of the graph, a process called first-passage percolation. Assume that the graph is infinite and of bounded degree.…

In the classic model of first passage percolation, for pairs of vertices separated by a Euclidean distance $L$, geodesics exhibit deviations from their mean length $L$ that are of order $L^\chi$, while the transversal fluctuations, known as…

We investigate first passage percolation on inhomogeneous random graphs. The random graph model G(n,kappa) we study is the model introduced by Bollob\'as, Janson and Riordan, where each vertex has a type from a type space S and edge…

We consider large random planar maps and study the first-passage percolation distance obtained by assigning independent identically distributed lengths to the edges. We consider the cases of quadrangulations and of general planar maps. In…

We introduce an algorithm to estimate the redshift distribution of a sample of galaxies selected photometrically given a subsample with measured spectroscopic redshifts. The approach uses a non-parametric Voronoi tessellation density…

We consider the standard model of first-passage percolation on $\mathbb{Z}^d$ ($d\geq 2$), with i.i.d. passage times associated with either the edges or the vertices of the graph. We focus on the particular case where the distribution of…