Sieving random iterative function systems

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

It is known that backward iterations of independent copies of a contractive random Lipschitz function converge almost surely under mild assumptions. By a sieving (or thinning) procedure based on adding to the functions time and space components, it is possible to construct a scale invariant stochastic process. We study its distribution and paths properties. In particular, we show that it is càdlàg and has finite total variation. We also provide examples and analyse various properties of particular sieved iterative function systems including perpetuities and infinite Bernoulli convolutions, iterations of maximum, and random continued fractions.

Cite

CITATION STYLE

APA

Marynych, A., & Molchanov, I. (2021). Sieving random iterative function systems. Bernoulli, 27(1), 34–65. https://doi.org/10.3150/20-BEJ1221

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free