An Abramov Formula for Stationary Spaces of Discrete Groups
نویسنده
چکیده
Let (G,μ) be a discrete group equipped with a generating probability measure, and let Γ be a finite index subgroup of G. A μ-random walk on G, starting from the identity, returns to Γ with probability one. Let θ be the hitting measure, or the distribution of the position in which the random walk first hits Γ. We prove that the Furstenberg entropy of a (G,μ)-stationary space, with respect to the action of (Γ, θ), is equal to the Furstenberg entropy with respect to the action of (G,μ), times the index of Γ in G. The index is shown to be equal to the expected return time to Γ. As a corollary, when applied to the Furstenberg-Poisson boundary of (G,μ), we prove that the random walk entropy of (Γ, θ) is equal to the random walk entropy of (G,μ), times the index of Γ in G.
منابع مشابه
Numerical algorithm for discrete barrier option pricing in a Black-Scholes model with stationary process
In this article, we propose a numerical algorithm for computing price of discrete single and double barrier option under the emph{Black-Scholes} model. In virtue of some general transformations, the partial differential equations of option pricing in different monitoring dates are converted into simple diffusion equations. The present method is fast compared to alterna...
متن کاملFurstenberg Entropy Realizations for Virtually Free Groups and Lamplighter Groups
Let (G, μ) be a discrete group with a generating probability measure. Nevo shows that if G has property (T) then there exists an ε > 0 such that the Furstenberg entropy of any (G, μ)-stationary space is either zero or larger than ε. Virtually free groups, such as SL2(Z), do not have property (T). For these groups, we construct stationary actions with arbitrarily small, positive entropy. This co...
متن کاملON THE STATIONARY PROBABILITY DENSITY FUNCTION OF BILINEAR TIME SERIES MODELS: A NUMERICAL APPROACH
In this paper, we show that the Chapman-Kolmogorov formula could be used as a recursive formula for computing the m-step-ahead conditional density of a Markov bilinear model. The stationary marginal probability density function of the model may be approximated by the m-step-ahead conditional density for sufficiently large m.
متن کاملNonabelian free group actions: Markov processes, the Abramov-Rohlin formula and Yuzvinskii’s formula
This paper introduces Markov chains and processes over nonabelian free groups and semigroups. We prove a formula for the f -invariant of a Markov chain over a free group in terms of transition matrices that parallels the classical formula for the entropy a Markov chain. Applications include free group analogues of the AbramovRohlin formula for skew-product actions and Yuzvinskii’s addition form...
متن کاملGosper’s Algorithm and Accurate Summation as Definite Summation Tools
Sufficient conditions are given for validity of the discrete Newton-Leibniz formula when the indefinite sum is obtained either by Gosper’s algorithm or by Accurate Summation algorithm. It is shown that sometimes a polynomial can be factored from the summand in such a way that the safe summation range is inreased.
متن کامل