Related papers: Regular sets and counting in free groups
Finding independent sets of maximum size in fixed graphs is well known to be an NP-hard task. Using scaling limits, we characterise the asymptotics of sequential degree-greedy explorations and provide sufficient conditions for this…
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…
We introduce the discrete affine group of a regular tree as a finitely generated subgroup of the affine group. We describe the Poisson boundary of random walks on it as a space of configurations. We compute isoperimetric profile and Hilbert…
In this article, we study connections between components of the Cayley graph $\mathrm{Cay}(G,A)$, where $A$ is an arbitrary subset of a group $G$, and cosets of the subgroup of $G$ generated by $A$. In particular, we show how to construct…
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,…
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…
For a large class of amenable transient weighted graphs $G$, we prove that the sign clusters of the Gaussian free field on $G$ fall into a regime of strong supercriticality, in which two infinite sign clusters dominate (one for each sign),…
We construct explicit generating sets S_n and \tilde S_n of the for the alternating and the symmetric groups, which turn the Cayley graphs C(Alt(n), S_n) and C(Sym(n), \tilde S_n) into a family of bounded degree expanders for all n. This…
We study the problem of determining the distribution of vertices of a particular given type in the set of all Feynman tree graphs in quantum field theories. We show that in almost all cases a Gaussian distribution arises asymptotically, and…
We introduce asymptotic R\'enyi entropies as a parameterized family of invariants for random walks on groups. These invariants interpolate between various well-studied properties of the random walk, including the growth rate of the group,…
Our main result is an extension of Pansu's theorem to random metrics, where the edges of the Cayley are i.i.d. random variable with some finite exponential moment. Based on a previous work by the second author, the proof relies on…
In several scale free graph models the asymptotic degree distribution and the characteristic exponent change when only a smaller set of vertices is considered. Looking at the common properties of these models, we present sufficient…
We determine the range of Furstenberg entropy for stationary ergodic actions of nonabelian free groups by an explicit construction involving random walks on random coset spaces.
In the previous chapters, we explored the effects of resetting on networks considering one and two nodes. In this chapter, we will describe a generalization of random walks with resetting to an arbitrary number of nodes $\mathcal{M}$. In…
We prove that the boundary action of a sofic random subgroup of a finitely generated free group is conservative. This addresses a question asked by Grigorchuk, Kaimanovich, and Nagnibeda, who studied the boundary actions of individual…
A finite set is "hidden" if its elements are not directly enumerable or if its size cannot be ascertained via a deterministic query. In public health, epidemiology, demography, ecology and intelligence analysis, researchers have developed a…
Let $S$ be a class of groups and let $f_S (n)$ be the number of isomorphism classes of groups in $S$ of order $n$. Let $f(n)$ count the number of groups of order $n$ up to isomorphism. The asymptotic bounds for $f(n)$ behave differently…
Random walk on the set of irreducible representations of a finite group is investigated. For the symmetric and general linear groups, a sharp convergence rate bound is obtained and a cutoff phenomenon is proved. As related results, an…
In this article we prove existence of the asymptotic capacity of the range of random walks on free products of graphs. In particular, we will show that the asymptotic capacity of the range is almost surely constant and strictly positive.…
In this paper we study double cosets of finite rank free groups. We focus our attention on cancellation types in double cosets and their formal language properties.