相关论文: Aspects of a randomly growing cluster in $\reals^d…

We study internal diffusion limited aggregation on $\mathbb{Z}$, where a cluster is grown incrementally by adding, for each random walk dispatched from the origin, the first site it reaches outside the cluster. We assume that the increment…

We develop a simple and unified approach to investigate several aspects of the cluster statistics of random expansive (multi-)sets. In particular, we determine the limiting distribution of the size of the smallest and largest clusters, we…

Let $X,X_1,X_2,\ldots$ be i.i.d. mean zero random vectors with values in a separable Banach space $B$, $S_n=X_1+\cdots+X_n$ for $n\ge1$, and assume $\{c_n:n\ge1\}$ is a suitably regular sequence of constants. Furthermore, let…

This paper studies the bounded confidence model on growing fully-mixed populations. In this model, in addition to the usual opinion clusters, significant secondary clusters of smaller size appear systematically, while those secondary…

A growing random graph is constructed by successively sampling without replacement an element from the pool of virtual vertices and edges. At start of the process the pool contains $N$ virtual vertices and no edges. Each time a vertex is…

A random geometric digraph $G_n$ is constructed by taking $\{X_1,X_2,... X_n\}$ in $\mathbb{R}^2$ independently at random with a common bounded density function. Each vertex $X_i$ is assigned at random a sector $S_i$ of central angle…

We consider a stationary random field indexed by an increasing sequence of subsets of $\mathbb{Z}^d$ obeying a very broad geometrical assumption on how the sequence expands. Under certain mixing and local conditions, we show how the tail…

We investigate the problem of growing clusters, which is modeled by two dimensional disks and three dimensional droplets. In this model we place a number of seeds on random locations on a lattice with an initial occupation probability, $p$.…

We call $i$ a fixed point of a given sequence if the value of that sequence at the $i$-th position coincides with $i$. Here, we enumerate fixed points in the class of restricted growth sequences. The counting process is conducted by…

We propose a new model of cluster growth according to which the probability that a new unit is placed in a point at a distance $r$ from the city center is a Gaussian with mean equal to the cluster radius and variance proportional to the…

We study the evolution of random graphs where edges are added one by one between pairs of weighted vertices so that resulting graphs are scale-free with the degree exponent $\gamma$. We use the branching process approach to obtain scaling…

A random planar quadrangulation process is introduced as an approximation for certain cellular automata in terms of random growth of rays from a given set of points. This model turns out to be a particular (rectangular) case of the…

We introduce a model for a growing random graph based on simultaneous reproduction of the vertices. The model can be thought of as a generalisation of the reproducing graphs of Southwell and Cannings and Bonato et al to allow for a random…

Begin with a set of four points in the real plane in general position. Add to this collection the intersection of all lines through pairs of these points. Iterate. Ismailescu and Radoi\v{c}i\'{c} (2003) showed that the limiting set is dense…

Clusters appear in nature in a diversity of contexts, involving distances as long as the cosmological ones, and down to atoms and molecules and the very small nuclear size. They also appear in several other scenarios, in particular in…

Given two sets of positive integers $A$ and $B$, let $AB := \{ab : a \in A,\, b \in B\}$ be their product set and put $A^k := A \cdots A$ ($k$ times $A$) for any positive integer $k$. Moreover, for every positive integer $n$ and every…

For a class of aggregation models on the integer lattice $\mathbb{Z}^d$, $d\geq 2$, in which clusters are formed by particles arriving one after the other and sticking irreversibly where they first hit the cluster, including the classical…

Datasets in high-dimension do not typically form clusters in their original space; the issue is worse when the number of points in the dataset is small. We propose a low-computation method to find statistically significant clustering…

The growth of a diffusion limited aggregation (DLA) cluster with mass $M$ and radius of gyration $R$ is described by a set of growth probabilities $\{ p_i\}$, where $p_i$ is the probability that the perimeter site $i$ will be the next to…

We present a new theoretical framework for modelling the cluster growing process. Starting from the initial tetrahedral cluster configuration, adding new atoms to the system and absorbing its energy at each step, we find cluster growing…