Related papers: Asymptotic shape for subadditve processes on group…

This doctoral thesis undertakes an in-depth exploration of limiting shape theorems across diverse mathematical structures, with a specific focus on subadditive processes within finitely generated groups exhibiting polynomial growth rates,…

In this paper, we define a class of additive random growth models whose growth is at least and at most linear and prove an asymptotic shape theorem for these models. This proof generalizes already known proofs for the classical contact…

The aim of this article is to prove asymptotic shape theorems for the contact process in stationary random environment. These theorems generalize known results for the classical contact process. In particular, if H_t denotes the set of…

Let Gamma be a finitely generated nilpotent group. We consider three closely related problems: (i) the asymptotic cone for an equivariant ergodic family of inner metrics on Gamma, generalizing Pansu's theorem; (ii) the limit shapes for…

The aim of this article is to prove asymptotic shape theorems for the contact process in stationary random environment. These theorems generalize known results for the classical contact process. In particular, if H_t denotes the set of…

We formulate and prove a shape theorem for a continuous-time continuous-space stochastic growth model under certain general conditions. Similarly to the classical lattice growth models the proof makes use of the subadditive ergodic theorem.…

We get asymptotics for the volume of large balls in an arbitrary locally compact group G with polynomial growth. This is done via a study of the geometry of G and a generalization of P. Pansu's thesis. In particular, we show that any such G…

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…

By a [$K$-]approximate subring of a ring we mean an additively symmetric subset $X$ such that $X \cdot X \cup (X + X)$ is covered by finitely many [resp.\ $K$] additive translates of $X$. We prove a structure theorem for finite approximate…

Random growth models are fundamental objects in modern probability theory, have given rise to new mathematics, and have numerous applications, including tumor growth and fluid flow in porous media. In this article, we introduce some of the…

A direct consequence of Gromov's theorem is that if a group has polynomial geodesic growth with respect to some finite generating set then it is virtually nilpotent. However, until now the only examples known were virtually abelian. In this…

Bonamy et al \cite{BBEGLPS} showed that graphs of polynomial growth have finite asymptotic dimension. We refine their result showing that a graph of polynomial growth strictly less than $n^{k+1}$ has asymptotic dimension at most $k$. As a…

We give a criterion on pairs $(G,S)$ - where $G$ is a virtually $s$-step nilpotent group and $S$ is a finite generating set - saying whether the geodesic growth is exponential or strictly sub-exponential. Whenever $s=1,2$, this goes further…

We study the relative growth of finitely generated subgroups in finitely generated groups, and the corresponding distortion function of the embeddings. We explore which functions are equivalent to the relative growth functions and…

We strengthen the maximal ergodic theorem for actions of groups of polynomial growth to a form involving jump quantity, which is the sharpest result among the family of variational or maximal ergodic theorems. As a consequence, we deduce in…

Finite decomposition complexity and asymptotic dimension growth are two generalizations of M. Gromov's asymptotic dimension which can be used to prove property A for large classes of finitely generated groups of infinite asymptotic…

We calculate full asymptotic expansions of prime-independent multiplicative functions on additive arithmetic semigroups that satisfy a strong form of Knopfmacher's axioms. When applied to the semigroup of unlabeled graphs, our method yields…

We give explicit formulas for the asymptotic growth rate of the number of summands in tensor powers in certain monoidal categories with finitely many indecomposable objects, and related structures.

Introduced by Gromov in the nineties, the systolic growth of a Lie group gives the smallest possible covolume of a lattice with a given systole. In a simply connected nilpotent Lie group, this function has polynomial growth, but can grow…

We give a general asymptotic formula for the growth rate of the number of indecomposable summands in the tensor powers of representations of finite groups, over a field of arbitrary characteristic. In characteristic zero we obtain…