Related papers: A shape theorem for the orthant model

Motivated by quite recent research involving the relationship between the dimension of a poset and graph-theoretic properties of its cover graph, we show that for every $d\geq 1$, if $P$ is a poset and the dimension of a subposet $B$ of $P$…

Geometrical measurements of biological objects form the basis of many quantitative analyses. Hausdorff measures such as the volume and the area of objects are simple and popular descriptors of individual objects, however, for most…

We study the contact process in a dynamical random environment defined on the vertices and edges of a graph. For a broad class of processes, we establish an asymptotic shape theorem for the set H_t, which represents the vertices that have…

We consider $p$-orientations, which are defined to be orientations of $d$-regular graphs such that every vertex either has in-degree $p$ or out-degree $p$. These generalise the orientations considered in Jaeger's conjecture, where $d=4p+1$.…

We consider a random growth model based on the IDLA protocol with sources in a hyperplane of $Z^d$ . We provide a stabilization result and a shape theorem generalizing [7] in any dimension by introducing new techniques leading to a rough…

A new methodological approach for the study of topology for shapes made of arrangements of lines, planes or solids is presented. Topologies for shapes are traditionally built on the classical theory of point-sets. In this paper, topologies…

Let $a_n$ be the random increasing sequence of natural numbers which takes each value independently with probability $n^{-a}$, $0 < a < 1/2$, and let $p(n) = n^{1+\epsilon}$, $0 < \epsilon < 1$. We prove that, almost surely, for every…

We consider the problem of approximating a two-dimensional shape contour (or curve segment) using discrete assembly systems, which allow to build geometric structures based on limited sets of node and edge types subject to edge length and…

Consider the d-dimensional lattice Z^d where each vertex is ``open'' or ``closed'' with probability p or 1-p, respectively. An open vertex v is connected by an edge to the closest open vertex w such that the dth co-ordinates of v and w…

In the on-line nearest-neighbour graph (ONG), each point after the first in a sequence of points in R^d is joined by an edge to its nearest-neighbour amongst those points that precede it in the sequence. We study the large-sample asymptotic…

We introduce a two-dimensional growth model where every new site is located, at a distance $r$ from the barycenter of the pre-existing graph, according to the probability law $1/r^{2+\alpha_G} (\alpha_G \ge 0)$, and is attached to (only)…

We study a version of first passage percolation on $\mathbb{Z}^d$ where the random passage times on the edges are replaced by contact times represented by random closed sets on $\mathbb{R}$. Similarly to the contact process without…

This study delves into the exploration of the limiting shape theorem for subadditive processes on finitely generated groups with polynomial growth, commonly referred to as virtually nilpotent groups. Investigating the algebraic structures…

We study first-passage percolation where edges in the left and right half-planes are assigned values according to different distributions. We show that the asymptotic growth of the resulting inhomogeneous first-passage process obeys a shape…

Let a random geometric graph be defined in the supercritical regime for the existence of a unique infinite connected component in Euclidean space. Consider the first-passage percolation model with independent and identically distributed…

Complex systems have motivated continuing interest from the scientific community, leading to new concepts and methods. Growing systems represent a case of particular interest, as their topological, geometrical, and also dynamical properties…

We prove a pointwise ergodic theorem for quasi-probability-measure-preserving (quasi-pmp) locally countable measurable graphs, equivalently, Schreier graphs of quasi-pmp actions of countable groups. For ergodic graphs, the theorem gives an…

We consider Bernoulli first-passage percolation on the triangular lattice in which sites have 0 and 1 passage times with probability $p$ and $1-p$, respectively. For each $p\in(0,p_c)$, let $\mathcal {B}(p)$ be the limit shape in the…

We provide a framework for studying randomly coloured point sets in a locally compact, second-countable space on which a metrisable unimodular group acts continuously and properly. We first construct and describe an appropriate dynamical…

In this paper we will prove a shape theorem for the last passage percolation model on a two dimensional $F$-compound Poisson process, called the Hammersley model with random weights. We will also provide diffusive upper bounds for shape…