Related papers: Asymptotic Burnside laws

In this paper we obtain significant bounds for the number of maximal subgroups of a given index of a finite group. These results allow us to give new bounds for the number of random generators needed to generate a finite $d$-generated group…

We introduce shortcut graphs and groups. Shortcut graphs are graphs in which cycles cannot embed without metric distortion. Shortcut groups are groups which act properly and cocompactly on shortcut graphs. These notions unify a surprisingly…

A finite group $G$ is called $C$-quasirandom (by Gowers) if all non-trivial irreducible complex representations of $G$ have dimension at least $C$. For any unit $\ell^{2}$ function on a finite group we associate the quantum probability…

Benford's law states that for many random variables X > 0 its leading digit D = D(X) satisfies approximately the equation P(D = d) = log_{10}(1 + 1/d) for d = 1,2,...,9. This phenomenon follows from another, maybe more intuitive fact,…

We study the random walk on a finite dihedral group $G$ driven by the uniform measure on $k$ independently and uniformly chosen elements. We show that the walk exhibits cutoff with high probability throughout nearly the entire regime $1 \ll…

It is shown that there exist finitely generated infinite simple groups of infinite commutator width and infinite square width on which there exists no stably unbounded conjugation-invariant norm, and in particular stable commutator length…

We develop two complementary generative mechanisms that explain when and why Benford's first-digit law arises. First, a probabilistic Turing machine (PTM) ensemble induces a geometric law for codelength. Maximizing its entropy under a…

We construct the first examples of finitely presented groups with cubic Dehn function containing a finitely generated infinite torsion subgroup. Moreover, we show that any infinite free Burnside group with sufficiently large odd exponent…

Let $\Gamma$ be a countable discrete group, $H$ a lcsc totally disconnected group and $\rho : \Gamma \rightarrow H$ a homomorphism with dense image. We develop a general and explicit technique which provides, for every compact open subgroup…

We consider a Branching Random Walk on $\R$ whose step size decreases by a fixed factor, $0<b<1$, with each turn. This process generates a random probability measure on $\R$, that is, the limit of uniform distribution among the $2^n$…

We prove that there exist infinitely many asymptotics of drift for random walks on finitely generated groups.

We consider random walks on finitely or countably generated free semigroups, and identify their Poisson boundaries for classes of measures which fail to meet the classical entropy criteria. In particular, we introduce the notion of…

We study random torsion-free nilpotent groups generated by a pair of random words of length $\ell$ in the standard generating set of $U_n(\mathbb{Z})$. Specifically, we give asymptotic results about the step properties of the group when the…

We obtain quenched almost sure invariance principle (with convergence rate) for Random Young Tower. We apply our result to i.i.d perturbations of non-uniformly expanding maps. In particular, we answer one open question in \cite{BBM}.

We prove existence of asymptotic entropy of random walks on regular languages over a finite alphabet and we give formulas for it. Furthermore, we show that the entropy varies real-analytically in terms of probability measures of constant…

We show that for any $n\geq 2$, two elements selected uniformly at random from a \emph{symmetrized} Euclidean ball of radius $X$ in $\textrm{SL}_n(\mathbb Z)$ will generate a thin free group with probability tending to $1$ as $X\rightarrow…

We show that on an arbitrary finitely generated non virtually solvable linear group, any two independent random walks will eventually generate a free subgroup. In fact, this will hold for an exponential number of independent random walks.

We introduce a generalisation of Sch\"{u}tz and Trimper's elephant random walk to finitely generated groups. We focus on the simplest non-abelian setting, i.e. groups whose Cayley graphs are homogeneous trees of degree $d \ge 3$. We show…

In Bayesian nonparametric inference, random discrete probability measures are commonly used as priors within hierarchical mixture models for density estimation and for inference on the clustering of the data. Recently, it has been shown…

A convenient framework for dealing with asymptotic limit problems of probabilistic nature is provided. These problems include questions such as finding the asymptotic proportion of terms of a sequence falling inside a given interval, or the…