2000 character limit reached
Iterated function systems with place dependent probabilities and application to the Diaconis-Friedman's chain on [0,1]
Published 23 Jul 2017 in math.PR | (1707.07237v1)
Abstract: We study Markov chains generated by iterated Lipschitz functions systems with possibly place dependent probabilities. Under general conditions, we prove uniqueness of the invariant probability measure for the associated Markov chain, by using quasi-compact linear operators technics. We use the same approach to describe the behavior of the Diaconis-Friedman's chain on [0,1] with possibly place dependent probabilities.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.