ترغب بنشر مسار تعليمي؟ اضغط هنا

Given a sequence of i.i.d. random functions $Psi_{n}:mathbb{R}tomathbb{R}$, $ninmathbb{N}$, we consider the iterated function system and Markov chain which is recursively defined by $X_{0}^{x}:=x$ and $X_{n}^{x}:=Psi_{n-1}(X_{n-1}^{x})$ for $xinmathb b{R}$ and $ninmathbb{N}$. Under the two basic assumptions that the $Psi_{n}$ are a.s. continuous at any point in $mathbb{R}$ and asymptotically linear at the endpoints $pminfty$, we study the tail behavior of the stationary laws of such Markov chains by means of Markov renewal theory. Our approach provides an extension of Goldies implicit renewal theory and can also be viewed as an adaptation of Kestens work on products of random matrices to one-dimensional function systems as described. Our results have applications in quite different areas of applied probability like queuing theory, econometrics, mathematical finance and population dynamics. Our results have applications in quite different areas of applied probability like queuing theory, econometrics, mathematical finance and population dynamics, e.g. ARCH models and random logistic transforms.
We consider random walks on the group of orientation-preserving homeomorphisms of the real line ${mathbb R}$. In particular, the fundamental question of uniqueness of an invariant measure of the generated process is raised. This problem was already s tudied by Choquet and Deny (1960) in the context of random walks generated by translations of the line. Nowadays the answer is quite well understood in general settings of strongly contractive systems. Here we focus on broader class of systems satisfying the conditions: recurrence, contraction and unbounded action. We prove that under these conditions the random process possesses a unique invariant Radon measure on ${mathbb R}$. Our work can be viewed as a subsequent paper of Babillot et al. (1997) and Deroin et al. (2013).
We consider the branching process in random environment ${Z_n}_{ngeq 0}$, which is a~population growth process where individuals reproduce independently of each other with the reproduction law randomly picked at each generation. We focus on the super critical case, when the process survives with a positive probability and grows exponentially fast on the nonextinction set. Our main is goal is establish Fourier techniques for this model, which allow to obtain a number of precise estimates related to limit theorems. As a consequence we provide new results concerning central limit theorem, Edgeworth expansions and renewal theorem for $log Z_n$.
A regenerative random composition of integer $n$ is constructed by allocating $n$ standard exponential points over a countable number of intervals, comprising the complement of the closed range of a subordinator $S$. Assuming that the L{e}vy measure of $S$ is infinite and regularly varying at zero of index $-alpha$, $alphain(0,,1)$, we find an explicit threshold $r=r(n)$, such that the number $K_{n,,r(n)}$ of blocks of size $r(n)$ converges in distribution without any normalization to a mixed Poisson distribution. The sequence $(r(n))$ turns out to be regularly varying with index $alpha/(alpha+1)$ and the mixing distribution is that of the exponential functional of $S$. The result is derived as a consequence of a general Poisson limit theorem for an infinite occupancy scheme with power-like decay of the frequencies. We also discuss asymptotic behavior of $K_{n,,w(n)}$ in cases when $w(n)$ diverges but grows slower than $r(n)$. Our findings complement previously known strong laws of large numbers for $K_{n,,r}$ in case of a fixed $rinmathbb{N}$. As a key tool we employ new Abelian theorems for Laplace--Stiletjes transforms of regularly varying functions with the indexes of regular variation diverging to infinity.
Consider a weighted branching process generated by the lengths of intervals obtained by stick-breaking of unit length (a.k.a. the residual allocation model) and associate with each weight a `box. Given the weights `balls are thrown independently into the boxes of the first generation with probability of hitting a box being equal to its weight. Each ball located in a box of the $j$th generation, independently of the others, hits a daughter box in the $(j+1)$th generation with probability being equal the ratio of the daughter weight and the mother weight. This is what we call nested occupancy scheme in random environment. Restricting attention to a particular generation one obtains the classical Karlin occupancy scheme in random environment. Assuming that the stick-breaking factor has a uniform distribution on $[0,1]$ and that the number of balls is $n$ we investigate occupancy of intermediate generations, that is, those with indices $lfloor j_n urfloor$ for $u>0$, where $j_n$ diverges to infinity at a sublogarithmic rate as $n$ becomes large. Denote by $K_n(j)$ the number of occupied (ever hit) boxes in the $j$th generation. It is shown that the finite-dimensional distributions of the process $(K_n(lfloor j_n urfloor))_{u>0}$, properly normalized and centered, converge weakly to those of an integral functional of a Brownian motion. The case of a more general stick-breaking is also analyzed.
Let $B_n(m)$ be a set picked uniformly at random among all $m$-elements subsets of ${1,2,ldots,n}$. We provide a pathwise construction of the collection $(B_n(m))_{1leq mleq n}$ and prove that the logarithm of the least common multiple of the integer s in $(B_n(lfloor mtrfloor))_{tgeq 0}$, properly centered and normalized, converges to a Brownian motion when both $m,n$ tend to infinity. Our approach consists of two steps. First, we show that the aforementioned result is a consequence of a multidimensional central limit theorem for the logarithm of the least common multiple of $m$ independent random variables having uniform distribution on ${1,2,ldots,n}$. Second, we offer a novel approximation of the least common multiple of a random sample by the product of the elements of the sample with neglected multiplicities in their prime decompositions.
We work under the A{i}d{e}kon-Chen conditions which ensure that the derivative martingale in a supercritical branching random walk on the line converges almost surely to a nondegenerate nonnegative random variable that we denote by $Z$. It is shown t hat $mathbb{E} Zmathbf{1}_{{Zle x}}=log x+o(log x)$ as $xtoinfty$. Also, we provide necessary and sufficient conditions under which $mathbb{E} Zmathbf{1}_{{Zle x}}=log x+{rm const}+o(1)$ as $xtoinfty$. This more precise asymptotics is a key tool for proving distributional limit theorems which quantify the rate of convergence of the derivative martingale to its limit $Z$. The methodological novelty of the present paper is a three terms representation of a subharmonic function of at most linear growth for a killed centered random walk of finite variance. This yields the aforementioned asymptotics and should also be applicable to other models.
We study the asymptotic behavior as $t to infty$ of a time-dependent family $(mu_t)_{t geq 0}$ of probability measures on $mathbb{R}$ solving the kinetic-type evolution equation $partial_t mu_t + mu_t = Q(mu_t)$ where $Q$ is a smoothing transformatio n on $mathbb{R}$. This problem has been investigated earlier, e.g. by Bassetti and Ladelli [Ann. Appl. Probab. 22(5): 1928-1961, 2012] and Bogus, Buraczewski and Marynych [Stochastic Process. Appl. 130(2):677-693, 2020]. Combining the refined analysis of the latter paper, which provides a probabilistic description of the solution $mu_t$ as the law of a suitable random sum related to a continuous-time branching random walk at time $t$, with recent advances in the analysis of the extremal positions in the branching random walk we are able to solve the remaining case that has been left open until now. In the course of our work, we significantly weaken the assumptions in the literature that guarantee the existence (and uniqueness) of a solution to the evolution equation $partial_t mu_t + mu_t = Q(mu_t)$.
The integer points (sites) of the real line are marked by the positions of a standard random walk. We say that the set of marked sites is weakly, moderately or strongly sparse depending on whether the jumps of the standard random walk are supported b y a bounded set, have finite or infinite mean, respectively. Focussing on the case of strong sparsity we consider a nearest neighbor random walk on the set of integers having jumps $pm 1$ with probability $1/2$ at every nonmarked site, whereas a random drift is imposed at every marked site. We prove new distributional limit theorems for the so defined random walk in a strongly sparse random environment, thereby complementing results obtained recently in Buraczewski et al. (2018+) for the case of moderate sparsity and in Matzavinos et al. (2016) for the case of weak sparsity. While the random walk in a strongly sparse random environment exhibits either the diffusive scaling inherent to a simple symmetric random walk or a wide range of subdiffusive scalings, the corresponding limit distributions are non-stable.
A random walk in a sparse random environment is a model introduced by Matzavinos et al. [Electron. J. Probab. 21, paper no. 72: 2016] as a generalization of both a simple symmetric random walk and a classical random walk in a random environment. A ra ndom walk $(X_n)_{nin mathbb{N}cup{0}}$ in a sparse random environment $(S_k,lambda_k)_{kinmathbb{Z}}$ is a nearest neighbor random walk on $mathbb{Z}$ that jumps to the left or to the right with probability $1/2$ from every point of $mathbb{Z}setminus {ldots,S_{-1},S_0=0,S_1,ldots}$ and jumps to the right (left) with the random probability $lambda_{k+1}$ ($1-lambda_{k+1}$) from the point $S_k$, $kinmathbb{Z}$. Assuming that $(S_k-S_{k-1},lambda_k)_{kinmathbb{Z}}$ are independent copies of a random vector $(xi,lambda)in mathbb{N}times (0,1)$ and the mean $mathbb{E}xi$ is finite (moderate sparsity) we obtain stable limit laws for $X_n$, properly normalized and centered, as $ntoinfty$. While the case $xileq M$ a.s. for some deterministic $M>0$ (weak sparsity) was analyzed by Matzavinos et al., the case $mathbb{E} xi=infty$ (strong sparsity) will be analyzed in a forthcoming paper.
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا