Related papers: A backward ergodic theorem along trees and its con…
The classical Gaussian functor associates to every orthogonal representation of a locally compact group $G$ a probability measure preserving action of $G$ called a Gaussian action. In this paper, we generalize this construction by…
Let G be a vertex transitive graph. A study of the range of simple random walk on G and of its bridge is proposed. While it is expected that on a graph of polynomial growth the sizes of the range of the unrestricted random walk and of its…
In an early work from 1896, Maschke established the complete list of all finite planar Cayley graphs. This result initiated a long line of research over the next century, aiming at characterizing in a similar way all planar infinite Cayley…
In this article, we establish maximal inequalities and deduce ergodic theorems for state-preserving actions of amenable, locally compact, second-countable groups on tracial non-commutative $L^1$-spaces. As a further consequence, in…
The problem of how to estimate diffusion on a graph effectively is of importance both theoretically and practically. In this paper, we make use of two widely studied indices, geodesic distance and mean first-passage time ($MFPT$) for random…
We extend a recent result of Tim Austin (see arXiv:0905.0515) to the L^1 setting, thus providing a general version of the Birkhoff ergodic theorem for functions taking values in nonpositively curved spaces. In this setting, the notion of a…
We consider non-conservative positive semigroups and obtain necessary and sufficient conditions for uniform exponential contraction in weighted total variation norm. This ensures the existence of Perron eigenelements and provides…
We prove that a generic p.m.p. action of a countable amenable group $G$ has scaling entropy that can not be dominated by a given rate of growth. As a corollary, we obtain that there does not exist a topological action of $G$ for which the…
There has been much interest in generalizing Kesten's criterion for amenability in terms of a random walk to other contexts, such as determining amenability of a deck covering group by the bottom of the spectrum of the Laplacian or entropy…
Using suitable deformations of simplicial trees and the duality theory for median sets, we show that every free action on a median set can be extended to a free and transitive one. We also prove that the category of median groups is a…
The title refers to the area of research which studies infinite groups using measure-theoretic tools, and studies the restrictions that group structure imposes on ergodic theory of their actions. The paper is a survey of recent developments…
This article shortly provides related proofs of the ergodic theorems of von Neumann, Birkhoff, Wiener, and Rokhlin's lemma for $Z^d$-actions with an invariant measure. It is shown how some deviations of ergodic averages can be structured.…
We generalize the notion of isoperimetric profiles of finitely generated groups to their actions by measuring the boundary of finite subgraphings of the orbit graphing. We prove that like the classical isoperimetric profiles for groups,…
We offer a generalization of the recent result of Tao (building on earlier results of Conze and Lesigne, Furstenberg and Weiss, Zhang, Host and Kra, Frantzikinakis and Kra and Ziegler) that the nonconventional ergodic averages associated to…
In this paper we study ergodic theory of countable Markov shifts. These are dynamical systems defined over non-compact spaces. Our main result relates the escape of mass, the measure theoretic entropy, and the entropy at infinity of the…
Let Gamma be a connected, locally finite graph of finite tree width and G be a group acting on it with finitely many orbits and finite node stabilizers. We provide an elementary and direct construction of a tree T on which G acts with…
We adapt the Ping-Pong Lemma, which historically was used to study free products of groups, to the setting of the homeomorphism group of the unit interval. As a consequence, we isolate a large class of generating sets for subgroups of…
We propose a model of random walks on weighted graphs where the weights are interval valued, and connect it to reversible imprecise Markov chains. While the theory of imprecise Markov chains is now well established, this is a first attempt…
This paper is a survey of applications of the theory of algorithmic randomness to ergodic theory. We establish various degrees of constructivity for asymptotic laws of probability theory. In the framework of the Kolmogorov approach to the…
We study the automorphism groups of free-by-cyclic groups and show these are finitely generated in the following cases: (i) when defining automorphism has linear growth and (ii) when the rank of the underlying free group has rank at most 3.…