SearcharxivSearch

arXiv · 0907.0300

A min-type stochastic fixed-point equation related to the smoothing transformation

Abstract

This paper is devoted to the study of the stochastic fixed-point equation X \stackrel{d}{=} \inf_{i \geq 1: T_i > 0} X_i/T_i and the connection with its additive counterpart $X \stackrel{d}{=} \sum_{i\ge 1}T_{i}X_{i}$ associated with the smoothing transformation. Here $\stackrel{d}{=}$ means equality in distribution, $T := (T_i)_{i \geq 1}$ is a given sequence of nonnegative random variables and $X, X_1, ...$ is a sequence of nonnegative i.i.d. random variables independent of $T$. We draw attention to the question of the existence of nontrivial solutions and, in particular, of special solutions named $α$-regular solutions $(α>0)$. We give a complete answer to the question of when $α$-regular solutions exist and prove that they are always mixtures of Weibull distributions or certain periodic variants. We also give a complete characterization of all fixed points of this kind. A disintegration method which leads to the study of certain multiplicative martingales and a pathwise renewal equation after a suitable transform are the key tools for our analysis. Finally, we provide corresponding results for the fixed points of the related additive equation mentioned above. To some extent, these results have been obtained earlier by Iksanov.

Explore related subjects

Keep this discovery

BibTeXRIS

Gerold Alsmeyer, Matthias Meiners. 2009-07-02. A min-type stochastic fixed-point equation related to the smoothing transformation. https://arxiv.org/abs/0907.0300

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