Related papers: Rectangular Gilbert Tessellation
We study a coarsening process of one-dimensional cell complexes. We show that if cell boundaries move with velocities proportional to the difference in size of neighboring cells, then the average cell size grows at a prescribed exponential…
Molecular dynamics simulation has been used to model pattern formation in three-dimensional Rayleigh--Benard convection at the discrete-particle level. Two examples are considered, one in which an almost perfect array of hexagonally-shaped…
A generalized version of a well-known problem of D. G. Kendall states that the zero cell of a stationary Poisson hyperplane tessellation in ${\mathbb{R}}^d$, under the condition that it has large volume, approximates with high probability a…
For a locally finite set in $\mathbb{R}^2$, the order-$k$ Brillouin tessellations form an infinite sequence of convex face-to-face tilings of the plane. If the set is coarsely dense and generic, then the corresponding infinite sequences of…
In the original (1961) Gilbert model of random geometric graphs, nodes are placed according to a Poisson point process, and links formed between those within a fixed range. Motivated by wireless ad-hoc networks "soft" or "probabilistic"…
The dynamical system generated by the iterated calculation of the high order gaps between neighboring terms of a sequence of natural numbers is remarkable and only incidentally characterized at the boundary by the notable Proth-Glibreath…
We consider a system of $N$ particles on the real line that evolves through iteration of the following steps: 1) every particle splits into two, 2) each particle jumps according to a prescribed displacement distribution supported on the…
Let $X$ be either $Z^d$ or the points of a Poisson process in $R^d$ of intensity 1. Given parameters $r$ and $p$, join each pair of points of $X$ within distance $r$ independently with probability $p$. This is the simplest case of a…
In a previous work, two of the authors proposed a new proof of a well known convergence result for the scaled elementary connected vacant component in the high intensity Boolean model towards the Crofton cell of the Poisson hyperplane…
We show that a tessellation generated by a small number of random affine hyperplanes can be used to approximate Euclidean distances between any two points in an arbitrary bounded set $T$, where the random hyperplanes are generated by…
Start with a graph with a subset of vertices called {\it the border}. A particle released from the origin performs a random walk on the graph until it comes to the immediate neighbourhood of the border, at which point it joins this subset…
A rectangulation is a tiling of a rectangle by a finite number of rectangles. The rectangulation is called generic if no four of its rectangles share a single corner. We initiate the enumeration of generic rectangulations up to…
The projected normal distribution, also known as the angular Gaussian distribution, is obtained by dividing a multivariate normal random variable $\mathbf{x}$ by its norm $\sqrt{\mathbf{x}^T \mathbf{x}}$. The resulting random variable…
We provide arguments for the property of the degree-degree correlations of giant components formed by the percolation process on uncorrelated random networks. Using the generating functions, we derive a general expression for the…
At a typical cusp point of the disordered region in a random tiling model we expect to see a determinantal process called the Pearcey process in the appropriate scaling limit. However, in certain situations another limiting point process…
Transversal structures (also known as regular edge labelings) are combinatorial structures defined over 4-connected plane triangulations with quadrangular outer-face. They have been intensively studied and used for many applications…
We introduce and investigate a new notion of the theory of approximation-the so-called degenerate approximation, i.e. approximation of the function of two (and more) variables (kernel) by means of degenerate function (kernel). We apply…
The diameter distribution of a given species of deciduous trees in mature, temperate zone forests is well approximated by a Gamma distribution. Here we give new experimental evidence for this conjecture by analyzing deciduous tree size data…
Jigsaw percolation is a nonlocal process that iteratively merges connected clusters in a deterministic "puzzle graph" by using connectivity properties of a random "people graph" on the same set of vertices. We presume the Erdos--Renyi…
We study the behaviour of a natural measure defined on the leaves of the genealogical tree of some branching processes, namely self-similar growth-fragmentation processes. Each particle, or cell, is attributed a positive mass that evolves…