Related papers: A backward ergodic theorem along trees and its con…

We consider a nonstationary random walk on a compact metrizable abelian group. Under a classical strict aperiodicity assumption we establish a weak-* convergence to the Haar measure, Ergodic Theorem and Large Deviation Type Estimate.

In this paper, we reduce pointwise convergence of polynomial ergodic averages of general measure-preserving system acted by $\mathbb{Z}^{d}$ to the case of measure-preserving system acted by $\mathbb{Z}^{d}$ with zero entropy. As an…

Let $G$ be a closed permutation group on a countably infinite set $\Omega$, which acts transitively but not highly transitively. If $G$ is oligomorphic, has no algebraicity and weakly eliminates imaginaries, we prove that any probability…

We show that doubling at some large scale in a Cayley graph implies uniform doubling at all subsequent scales. The proof is based on the structure theorem for approximate subgroups proved by Green, Tao and the first author. We also give a…

The purpose of this article is to discuss the circle method and its quantitative role in understanding pointwise almost everywhere convergence phenomena for polynomial ergodic averaging operators. Specifically, we will use the circle method…

We establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For instance, we show that in all these statements…

We prove a ratio ergodic theorem for non-singular free $Z^d$ and $R^d$ actions, along balls in an arbitrary norm. Using a Chacon-Ornstein type lemma the proof is reduced to a statement about the amount of mass of a probability measure that…

The aim of this note is to present an elementary proof of a variation of Harris' ergodic theorem of Markov chains. This theorem, dating back to the fifties essentially states that a Markov chain is uniquely ergodic if it admits a ``small''…

Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll k \lesssim \log |G|$. The results of this article supplement those in the three main papers on random Cayley…

Tree graphs are routinely used in statistics. When estimating a Bayesian model with a tree component, sampling the posterior remains a core difficulty. Existing Markov chain Monte Carlo methods tend to rely on local moves, often leading to…

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 consider a transitive action of a finitely generated group $G$ and the Schreier graph $\Gamma$ defined by this action for some fixed generating set. For a probability measure $\mu$ on $G$ with a finite first moment we show that if the…

Consider a uniformly sampled random $d$-regular graph on $n$ vertices. If $d$ is fixed and $n$ goes to $\infty$ then we can relate typical (large probability) properties of such random graph to a family of invariant random processes (called…

We develop the complex-analytic viewpoint on the tree convolutions studied by the second author and Weihua Liu in "An operad of non-commutative independences defined by trees" (Dissertationes Mathematicae, 2020, doi:10.4064/dm797-6-2020),…

We introduce a class of spaces, called real cubings, and study the stucture of groups acting nicely on these spaces. Just as cubings are a natural generalisation of simplicial trees, real cubings can be regarded as a natural generalisation…

The mean ergodic theorem is equivalent to the assertion that for every function K and every epsilon, there is an n with the property that the ergodic averages A_m f are stable to within epsilon on the interval [n,K(n)]. We show that even…

We consider "randomized" statistics constructed by using a finite number of observations a random field at randomly chosen points. We generalize the invariance principle (the functional CLT), the Glivenko--Cantelli theorem, the theorem…

A connected graph is called \emph{geodetic} if there is a unique geodesic between each pair of vertices. In this paper we prove that if a finitely generated group admits a Cayley graph which is geodetic, then the group must be virtually…

We investigate the relationship between geometric, analytic and probabilistic indices for quotients of the Cayley graph of the free group ${\rm Cay}(F_n)$ endowed with variable edge lengths, by an arbitrary subgroup $G$ of $F_n$. Our main…

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…