Related papers: The asymptotic shape theorem for the frog model on…
Consider a stochastic growth model on $\mathbb{Z} ^d$. Start with some active particle at the origin and sleeping particles elsewhere. The initial number of particles at $x \in \mathbb{Z} ^d$ is $\eta(x)$, where $\eta (x)$ are independent…
In [B] Bowen defined the growth rate of an endomorphism of a finitely generated group and related it to the entropy of a map $f:M \mapsto M$ on a compact manifold. In this note we study the purely group theoretic aspects of the growth rate…
We consider particle systems in locally compact Abelian groups with particles moving according to a process with symmetric stationary independent increments and undergoing one and two levels of critical branching. We obtain long time…
We consider a one-dimensional discrete-space birth process with a bounded number of particle per site. Under the assumptions of the finite range of interaction, translation invariance, and non-degeneracy, we prove a shape theorem. We also…
Consider a growing system of random walks on the 3,2-alternating tree, where generations of nodes alternate between having two and three children. Any time a particle lands on a node which has not been visited previously, a new particle is…
This paper concerns the long term behaviour of a growth model describing a random sequential deposition of particles on a finite graph. The probability of allocating a particle at a vertex is proportional to a log-linear function of numbers…
In this paper, we introduce a one-dimensional model of particles performing independent random walks, where only pairs of particles can produce offspring ("cooperative branching"), and particles that land on an occupied site merge with the…
In this paper, we study the asymptotics of several growth functions related to twisted conjugacy on virtually abelian groups. First, we study the twisted conjugacy growth function, which counts the number of twisted conjugacy classes…
A class of interacting particle systems on $\mathbb{Z}$, involving instantaneously annihilating or coalescing nearest neighbour random walks, are shown to be Pfaffan point processes for all deterministic initial conditions. As diffusion…
We study a new algorithmic process of graph growth which starts from a single initial vertex and operates in discrete time-steps, called \emph{slots}. In every slot, the graph grows via two operations (i) vertex generation and (ii) edge…
Place an active particle at the root of a $d$-ary tree and a single dormant particle at each non-root site. In discrete time, active particles move towards the root with probability $p$ and, otherwise, away from the root to a uniformly…
We prove that any finite system of interacted automata can not leave some finite arear of Calley graph of periodic group. If group has non-periodic element, then its Calley graph can be explored by some finite automata with 3 pebbles. If…
We study the contact process on a dynamic random~$d$-regular graph with an edge-switching mechanism, as well as an interacting particle system that arises from the local description of this process, called the herds process. Both these…
We study the Fleming-Viot particle process formed by N interacting continuous-time asymmetric random walks on the cycle graph, with uniform killing. We show that this model has a remarkable exact solvability, despite the fact that it is…
In the present paper, we develop geometric analytic techniques on Cayley graphs of finitely generated abelian groups to study the polynomial growth harmonic functions. We develop a geometric analytic proof of the classical Heilbronn theorem…
A group action on a metric space is called growth tight if the exponential growth rate of the group with respect to the induced pseudo-metric is strictly greater than that of its quotients. A prototypical example is the action of a free…
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…
We consider a point process sequence induced by a stationary symmetric alpha-stable (0 < alpha < 2) discrete parameter random field. It is easy to prove, following the arguments in the one-dimensional case in Resnick and Samorodnitsky…
We study local (the heat equation) and nonlocal (convolution type problems with an integrable kernel) evolution problems on a metric connected finite graph in which some of the edges have infinity length. We show that the asymptotic…
Let S be a finite generating set of a torsion-free, nilpotent group G. We show that every automorphism of the Cayley graph Cay(G;S) is affine. (That is, every automorphism of the graph is obtained by composing a group automorphism with…