Related papers: Limit theory for planar Gilbert tessellations
Consider a particle moving through a random medium, which consists of spherical obstacles, randomly distributed in R^d. The particle is accelerated by a constant external field; when colliding with an obstacle, the particle inelastically…
We establish some scaling limits for a model of planar aggregation. The model is described by the composition of a sequence of independent and identically distributed random conformal maps, each corresponding to the addition of one…
Spatially homogeneous random tessellations that are stable under iteration (nesting) in the 3-dimensional Euclidean space are considered, so-called STIT tessellations. They arise as outcome of a spatio-temporal process of subsequent cell…
Untangling is a process in which some vertices of a planar graph are moved to obtain a straight-line plane drawing. The aim is to move as few vertices as possible. We present an algorithm that untangles the cycle graph C_n while keeping at…
We prove a limit theorem on the convergence of the distributions of the scaled last exit time over a slowly moving nonlinear boundary for a class of Gaussian stationary processes. The limit is a double exponential (Gumbel) distribution.
We consider Gaussian approximation in a variant of the classical Johnson--Mehl birth-growth model with random growth speed. Seeds appear randomly in $\mathbb{R}^d$ at random times and start growing instantaneously in all directions with a…
Given $\alpha \in (0, \infty)$ and $r \in (0, \infty)$, let ${\cal D}_{r, \alpha}$ be the disc of radius $r$ in the hyperbolic plane having curvature $-\alpha^2$. Consider the Poisson point process having uniform intensity density on ${\cal…
Consider a stationary Poisson process $\eta$ in the $d$-dimensional Euclidean or hyperbolic space and construct a random graph with vertex set $\eta$ as follows. First, each point $x\in\eta$ is connected by an edge to its nearest neighbour,…
We consider a growing planar network where a tip grows at constant speed, branches at constant rate and inactivates when it meets a branch already created. We only consider here orthogonal branching occurring always in the same direction.…
We consider the asymptotic distribution of a cell in a 2 x ... x 2 contingency table as the fixed marginal totals tend to infinity. The asymptotic order of the cell variance is derived and a useful diagnostic is given for determining…
We prove a sequence of limiting results about weakly dependent stationary and regularly varying stochastic processes in discrete time. After deducing the limiting distribution for individual clusters of extremes, we present a new type of…
Hilbert space fragmentation refers to exponential growth in the number of dynamically disconnected Krylov sectors with system size. It is taken as evidence of ergodicity breaking, since conventional symmetries generate at most a polynomial…
A first-principles theory is developed for the general evolution of a key structural characteristic of planar granular systems - the cell order distribution. The dynamic equations are constructed and solved in closed form for a number of…
The convex hull peeling of a point set is obtained by taking the convex hull of the set and repeating iteratively the operation on the interior points until no point remains. The boundary of each hull is called a layer. We study the number…
We consider bootstrap percolation and diffusion in sparse random graphs with fixed degrees, constructed by configuration model. Every node has two states: it is either active or inactive. We assume that to each node is assigned a…
Bootstrap percolation in (random) graphs is a contagion dynamics among a set of vertices with certain threshold levels. The process is started by a set of initially infected vertices, and an initially uninfected vertex with threshold $k$…
We consider the winding number of planar stationary Gaussian processes defined on the line. Under mild conditions, we obtain the asymptotic variance and the Central Limit Theorem for the winding number as the time horizon tends to infinity.…
The paper deals with a random connection model, a random graph whose vertices are given by a homogeneous Poisson point process on $\mathbb{R}^d$, and edges are independently drawn with probability depending on the locations of the two end…
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 scaling limits of a family of planar random growth processes in which clusters grow by the successive aggregation of small particles. In these models, clusters are encoded as a composition of conformal maps and the location of each…