An Iterated Random Function with Lipschitz Number One
In a recent paper, \textit{P. Diaconis} and \textit{D. Freedman} [SIAM Rev. 41, 45--76 (1999; Zbl 0926.60056)] described a general method for studying Markov chains. This method consists of viewing a state transition of the chain as the action of a function chosen at random from a family of state transformations. The Markov process can then be expressed as an iteration of these functions. When the state space is a metric space, e.g. \(\mathbb{R}\), they show that if the functions exhibit a certain average contractivity, then running the iteration backward rather than forward produces geometric convergence to a unique stationary distribution for the chain. An example of a Markov process originally proposed by \textit{G. Letac} [in: Random matrices and their applications. Contemp. Math. 50, 263--273 (1986; Zbl 0587.60057)] is defined on the nonnegative reals \(\mathbb{R}^+= [0,+\infty)\) by starting with a point \(x_0\in \mathbb{R}^+\) and for \(k= 0,1,\dots\) setting \[ x_{k+1}= f_{\theta_{k+ 1}} (x_k)\equiv |\theta_{k+1}- x_k|,\tag{1} \] where \(\theta_k \in \mathbb{R}^+\) are chosen independently from a fixed distribution \(\mu\) (on \(\mathbb{R}^+\)). The authors prove Letac's conjecture for compactly supported \(\mu\). Theorem 1. Let \(\mu\) be a distribution on a bounded interval \(Y\subset \mathbb{R}^+\) with \(\mu\) not supported on a lattice. Then \(\pi_\mu\) is a unique stationary distribution for the process (1). Moreover, if \(x_0\) is chosen according to an initial distribution \(\pi_0\), then the distribution \(\pi_0\) of \(x_0\) converges to \(\pi_p\) on the weak topology. The authors prove this theorem in Sections 2 and 3, and in Sections 4 and 5 they analyze the special case of \(\mu\) supported on just two points. Also the authors learned of a paper by \textit{J. C. Mattingly} [Theory Probab. Appl. 47, 333--343 (2002) and Teor. Veroyatn. Primen 47, 388--397 (2002; Zbl 1032.60064)] addressing related questions, that the paper contains results similar to ours.
- scientific article; zbMATH DE number 1366707
- A simple proof of a basic theorem on iterated random functions
- Locally contracting iterated functions and stability of Markov chains
- scientific article; zbMATH DE number 4034811
- -ergodic theory and reliability theory
- Ergodic theorems for Markov chains represented by iterated function systems
- Regeneration and general Markov chains
- On the asymptotic behavior of the Diaconis-Freedman chain on \([0, 1]\)
- Limit theorems for iterated random functions by regenerative methods.
- Establishing geometric drift via the Laplace transform of symmetric measures
- Dubins-Freedman processes and RC filters
- Limits of the Letac principle: the discrete case
- Asymptotic behavior for Markovian iterated function systems
- Lipschitz partition processes
- Ergodic theorems for Markov chains represented by iterated function systems
- Markov chains and de-initializing processes
- scientific article; zbMATH DE number 3928036 (Why is no real title available?)
- scientific article; zbMATH DE number 3942642 (Why is no real title available?)
- On the asymptotic behavior of the diaconis-freedman chain in a multi-dimensional simplex
- A simple proof of a basic theorem on iterated random functions
- Markov chains and mappings of distributions on compact spaces
- On the stationary tail index of iterated random Lipschitz functions
- Iterated random functions and slowly varying tails
- Marche aléatoire sur le semi-groupe des contractions de \({\mathbb{R}}^ d\). Cas de la marche aléatoire sur \({\mathbb{R}}_+\) avec choc élastique en zéro. (Random walk on the semigroup of contractions of \({\mathbb{R}}^ d\). Case of the random walk on \({\mathbb{R}}_+\) with elastic bound at zero)
This page was built for publication: An Iterated Random Function with Lipschitz Number One
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4442903)