SearcharxivSearch

arXiv subjects

Behrang Forghani

Publications and source records attributed to Behrang Forghani.

12 recordsLinked to original sources

Non-stability of Liouville measures under convex combinations

For every non-hyper-FC-central countable amenable group and every $k\geq 2$, we provide a sequence of symmetric, fully supported probability measures such that their convex combination is non-Liouville (that is it admits a non-constant bounded harmonic function, equivalently, the Poisson boundary is non-trivial) if and only if at least $k$ of them appear in the convex combination. Particularly, our result implies that the set of Liouville measures is not closed under convex combination, which answers a question of Kaimanovich. We also provide a similar result under the additional assumption of finite entropy for those non-hyper-FC-central countable groups with the property that every symmetric, finitely supported probability measure is Liouville. These groups are the only known non-trivial examples of countable groups that admit Liouville measures with finite entropy. Examples include the lamplighter group over $\mathbb{Z}$ and $\mathbb{Z}^2$, and the infinite symmetric group of finite permutations on $\mathbb{Z}$.

math.GR

Singularity of compound stationary measures

We show that the product or convex combination of two Markov operators with equivalent stationary measures need not have a stationary measure from the same measure class. More specifically, we exhibit examples of a hitherto undescribed phenomenon: maximal entropy random walks for which the resulting compound random walks no longer have maximal entropy. The underlying group in these examples is $PSL(2,\mathbb Z)\cong{{\mathbb Z}_2}*{{\mathbb Z}_3}$, and the associated harmonic measures belong to the canonical Minkowski and Denjoy measure classes on the boundary. These examples also demonstrate that a number of other natural families of random walks are not closed under convolutions or convex combinations of step distributions.

math.DS

The Poisson boundary of hyperbolic groups without moment conditions

We prove that the Poisson boundary of a random walk with finite entropy on a non-elementary hyperbolic group can be identified with its hyperbolic boundary, without assuming any moment condition on the measure. We also extend our method to groups with an action by isometries on a hyperbolic metric space containing a WPD element; this applies to a large class of non-hyperbolic groups such as relatively hyperbolic groups, mapping class groups, and groups acting on CAT(0) spaces.

math.GR

Compactifications of horospheric products

We define and study a new compactification, called the height compactification of the horospheric product of two infinite trees. We will provide a complete description of this compactification. In particular, we show that this compactification is isomorphic to the Busemann compactification when all the vertices of both trees have degrees of at least three, which also leads to a precise description of the Busemann functions in terms of the points in the geometric compactification of each tree. We will discuss an application to the asymptotic behavior of integrable ergodic cocycles with values in the isometry group of such horospheric product.

math.GN

Shannon's theorem for locally compact groups

We consider random walks on locally compact groups, extending the geometric criteria for the identification of their Poisson boundary previously known for discrete groups. First, we prove a version of the Shannon-McMillan-Breiman theorem, which we then use to generalize Kaimanovich's ray approximation and strip approximation criteria. We give several applications to identify the Poisson boundary of locally compact groups which act by isometries on nonpositively curved spaces, as well as on Diestel-Leader graphs and horocylic products.

math.DS

On Transformations of Markov Chains and Poisson Boundary

A discrete-time Markov chain can be transformed into a new Markov chain by looking at its states along iterations of an almost surely finite stopping time. By the optional stopping theorem, any bounded harmonic function with respect to the transition function of the original chain is harmonic with respect to the transition function of the transformed chain. The reverse inclusion is in general not true. Our main result provides a sufficient condition on the stopping time which guarantees that the space of bounded harmonic functions for the transformed chain embeds in the space of bounded harmonic sequences for the original chain. We also obtain a similar result on positive unbounded harmonic functions, under some additional conditions. Our work was motivated by and is analogous to Forghani-Kaimanovich, the well-studied case when the Markov chain is a random walk on a discrete group.

math.PR

Random walks of infinite moment on free semigroups

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 w-logarithmic moment, and we show that if a random walk on a free semigroup has either finite entropy or finite w-logarithmic moment for some word w, then the space of infinite words with the resulting hitting measure is the Poisson boundary.

math.DS

Positive harmonic functions of transformed random walks

In this paper, we will study the behavior of the space of positive harmonic functions associated with the random walk on a discrete group under the change of probability measure by a randomized stopping time. We show that this space remains unchanged after applying a bounded randomized stopping time.

math.PR

Amenability of trees

We will give a criterion for the amenability of arbitrary locally finite trees. The criterion is based on the trimming operator which is defined on the space of trees. As an application, we obtain a necessary and sufficient condition for that amenability of Galton-Watson trees.

math.CO

Asymptotic entropy of transformed random walks

We consider general transformations of random walks on groups determined by Markov stopping times and prove that the asymptotic entropy (resp., rate of escape) of the transformed random walks is equal to the asymptotic entropy (resp., rate of escape) of the original random walk multiplied by the expectation of the corresponding stopping time. This is an analogue of the well-known Abramov's formula from ergodic theory, its particular cases were established earlier by Kaimanovich [1983] and Hartman, Lima, Tamuz [2014].

math.DS