Related papers: An iterated random function with Lipschitz number …

For the iterations of $x\mapsto |x-\theta|$ random functions with Lipschitz number one, we represent the dynamics as a Markov chain and prove its convergence under mild conditions. We also demonstrate that the Wasserstein metric of any two…

Given $X_1,\cdot ,X_N$ random variables whose joint distribution is given as $\mu$ we will use the Martingale Method to show any Lipshitz Function $f$ over these random variables is subgaussian. The Variance parameter however can have a…

Given a real valued and time-inhomogeneous martingale diffusion X, we investigate the properties of functions defined by the conditional expectation f(t,X_t)=E[g(X_T)|F_t]. We show that whenever g is monotonic or Lipschitz continuous then…

In the first part of this thesis, we study a Markov chain on $\mathbb{R}_+ \times S$, where $\mathbb{R}_+$ is the non-negative real numbers and $S$ is a finite set, in which when the $\mathbb{R}_+$-coordinate is large, the $S$-coordinate of…

We construct a Hunt process that can be described as an isotropic $\alpha$-stable L\'evy process reflected from the complement of a bounded open Lipschitz set. In fact, we introduce a new analytic method for concatenating Markov processes.…

We explore two notions of stationary processes. The first is called a random-step Markov process in which the stationary process of states, $(X_i)_{i \in \mathbb{Z}}$ has a stationary coupling with an independent process on the positive…

We consider a Markov chain obtained by random iterations of Lipschitz maps $T_i$ chosen with a probability $p_i(x)$ depending on the current position $x$. We assume this system has a property of "contraction on average", that is $\sum_i…

Markov chains arising from random iteration of functions $S_{\theta}:X\to X$, $\theta \in \Theta$, where $X$ is a Polish space and $\Theta$ is arbitrary set of indices are considerd. At $x\in X$, $\theta$ is sampled from distribution…

An extension of non-deterministic processes driven by the random telegraph signal is introduced in the framework of "piecewise deterministic Markov processes" [Davis], including a broader category of random systems. The corresponding…

Let g : $\Omega$ = [0, 1] d $\rightarrow$ R denote a Lipschitz function that can be evaluated at each point, but at the price of a heavy computational time. Let X stand for a random variable with values in $\Omega$ such that one is able to…

Let $G$ be a real Lie group, $\Lambda\subseteq G$ a lattice, and $X=G/\Lambda$. We fix a probability measure $\mu$ on $G$ and consider the left random walk induced on $X$. It is assumed that $\mu$ is aperiodic, has a finite first moment,…

We develop criteria for recurrence and transience of one-dimensional Markov processes which have jumps and oscillate between $+\infty$ and $-\infty$. The conditions are based on a Markov chain which only consists of jumps (overshoots) of…

Lattice birth-and-death Markov dynamics of particle systems with spins from the set of non-negative integers are constructed as unique solutions to certain stochastic equations. Pathwise uniqueness, strong existence, Markov property and…

Let $L$ be a second order elliptic operator on $R^d$ with a constant diffusion matrix and a dissipative (in a weak sense) drift $b \in L^p_{loc}$ with some $p>d$. We assume that $L$ possesses a Lyapunov function, but no local boundedness of…

We investigate the convergence in distribution of sequential empirical processes of dependent data indexed by a class of functions F. Our technique is suitable for processes that satisfy a multiple mixing condition on a space of functions…

We consider a Markov chain X_1, X_2, ..., X_n belonging to a class of iterated random functions, which is "one-step contracting" with respect to some distance d. If f is any separately Lipschitz function with respect to d, we use a well…

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…

Every exchangeable Feller process taking values in a suitably nice combinatorial state space can be constructed by a system of iterated random Lipschitz functions. In discrete time, the construction proceeds by iterated application of…

We describe a procedure based on the iteration of an initial function by an appropriated operator, acting on continuous functions, in order to get a fixed point. This fixed point will be a calibrated subaction for the doubling map on the…

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…