SearcharxivSearch

arXiv · 1005.2265

Stochastic dynamical systems with weak contractivity properties (with a chapter featuring results of Martin Benda)

Abstract

Consider a proper metric space X and a sequence of i.i.d. random continuous mappings F_n from X to X. It induces the stochastic dynamical system (SDS) X_n^x = F_n(X_{n-1}^x) starting at x in X. In this paper, we study existence and uniqueness of invariant measures, as well as recurrence and ergodicity of this process. In the first part, we elaborate, improve and complete the unpublished work of Martin Benda on local contractivity, which merits publicity and provides an important tool for studying stochastic iterations. We consider the case when the F_n are contractions and, in particular, discuss recurrence criteria and their sharpness for reflected random walk. In the second part, we consider the case where the F_n are Lipschitz mappings. The main results concern the case when the associated Lipschitz constants are log-centered. Prinicpal tools are the Chacon-Ornstein theorem and a hyperbolic extension of the space X as well as the process (X_n^x). The results are applied to the reflected affine stochastic recursion on the non-negative half-line.

Explore related subjects

Keep this discovery

BibTeXRIS

Marc Peigné, Wolfgang Woess. 2010-05-13. Stochastic dynamical systems with weak contractivity properties (with a chapter featuring results of Martin Benda). https://arxiv.org/abs/1005.2265

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR