Let $(ξ_k,η_k)_{k\in\mathbb{N}}$ be independent identically distributed random vectors with arbitrarily dependent positive components. We call a (globally) perturbed random walk a random sequence $(T_k)_{k\in\mathbb{N}}$ defined by $T_k:=ξ_1+\cdots+ξ_{k-1}+η_k$ for $k\in\mathbb{N}$. Further, by an iterated perturbed random walk is meant the sequence of point processes defining the birth times of individuals in subsequent generations of a general branching process provided that the birth times of the first generation individuals are given by a perturbed random walk. For $j\in\mathbb{N}$ and $t\geq 0$, denote by $N_j(t)$ the number of the $j$th generation individuals with birth times $\leq t$. In this article we prove counterparts of the classical renewal-theoretic results (the elementary renewal theorem, Blackwell's theorem and the key renewal theorem) for $N_j(t)$ under the assumption that $j=j(t)\to\infty$ and $j(t)=o(t^{2/3})$ as $t\to\infty$. According to our terminology, such generations form a subset of the set of intermediate generations.
We study tails of the supremum of a perturbed random walk under regime which was not yet considered in the literature. Our approach is based on a new renewal theorem, which is of independent interest. We obtain first and second order asymptotics of the solution to renewal equation under weak assumptions and we apply these results to obtain first and second order asymptotics of the tail of the supremum of a perturbed random walk.
In this paper, we consider the perturbed renewal risk process. Systems of integro-differential equations for the Gerber-Shiu functions at ruin caused by a claim and oscillation are established, respectively. The explicit Laplase transforms of Gerber-Shiu functions are obtained, while the closed form expressions for the Gerber-Shiu functions are derived when the claim amount distribution is from the rational family. Finally, we present numerical examples intended to illustrate the main results.
We study a simple random walk on Z^2 with constraints on the axis. Motivation comes from physics when particles (a gas for example, see [Dal88]) are submitted to a local field. In our case we assume that the particle evolves freely in the cones but when touching the axis a force pushes it back progressively to the origin. The main result proves that this force can be parametrized in such a way that a renewal structure appears in the trajectory of the random walk. This implies the existence of an ergodic result for the parts of the trajectory restricted to the axis.
Let $(ξ_k,η_k)_{k\in\mathbb{N}}$ be independent identically distributed random vectors with arbitrarily dependent positive components. We call a (globally) perturbed random walk a random sequence $T:=(T_k)_{k\in\mathbb{N}}$ defined by $T_k:=ξ_1+\ldots+ξ_{k-1}+η_k$ for $k\in\mathbb{N}$. Consider a general branching process generated by $T$ and denote by $N_j(t)$ the number of the $j$th generation individuals with birth times $\leq t$. We treat early generations, that is, fixed generations $j$ which do not depend on $t$. In this setting we prove counterparts for $\mathbb{E}N_j$ of the Blackwell …
Given a sequence of i.i.d. random functions $Ψ_{n}:\mathbb{R}\to\mathbb{R}$, $n\in\mathbb{N}$, we consider the iterated function system and Markov chain which is recursively defined by $X_{0}^{x}:=x$ and $X_{n}^{x}:=Ψ_{n-1}(X_{n-1}^{x})$ for $x\in\mathbb{R}$ and $n\in\mathbb{N}$. Under the two basic assumptions that the $Ψ_{n}$ are a.s. continuous at any point in $\mathbb{R}$ and asymptotically linear at the "endpoints" $\pm\infty$, 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 Goldie's implicit …
We consider random walks perturbed at zero which behave like (possibly different) random walks with i.i.d. increments on each half lines and restarts at $0$ whenever they cross that point. We show that the perturbed random walk, after being rescaled in a proper way, converges to a skew Brownian motion whose parameter is defined by renewal functions of the simple random walks and the transition probabilities from $0$.
Consider multiple sums $S_n$ on the $d$-dimensional integer grid,which are generated by i.i.d.\ random variables with a positive expectation. We prove the strong law of large numbers, the law of the iterated logarithm and the distributional limit theorem for random sets ${\mathcal M}_t$ that appear as inversion of the multiple sums, that is, as the set of all arguments $x\in{\mathbb R}_+^d$ such that the interpolated multiple sum $S_x$ exceeds $t$. The moment conditions are identical to those imposed in the almost sure limit theorems for multiple sums. The results are expressed in terms of set…
Consider a general branching process, a.k.a. Crump-Mode-Jagers process, generated by a perturbed random walk $η_1$, $ξ_1+η_2$, $ξ_1+ξ_2+η_3,\ldots$. Here, $(ξ_1,η_1)$, $(ξ_2, η_2),\ldots$ are independent identically distributed random vectors with arbitrarily dependent positive components. Denote by $N_j(t)$ the number of the $j$th generation individuals with birth times $\leq t$. Assume that $j=j(t)\to\infty$ and $j(t)=o(t^a)$ as $t\to\infty$ for some explicitly given $a>0$ (to be specified in the paper). The corresponding $j$th generation belongs to the set of intermediate generations. We pr…
The Bernoulli sieve is a version of the classical `balls-in-boxes' occupancy scheme, in which random frequencies of infinitely many boxes are produced by a multiplicative renewal process, also known as the residual allocation model or stick-breaking. We focus on the number $K_n$ of boxes occupied by at least one of $n$ balls, as $n\to\infty$. A variety of limiting distributions for $K_n$ is derived from the properties of associated perturbed random walks. Refining the approach based on the standard renewal theory we remove a moment constraint to cover the cases left open in previous studies.
We introduce a new random walk with unbounded memory obtained as a mixture of the Elephant Random Walk and the Dynamic Random Walk which we call the Dynamic Elephant Random Walk (DERW). As a consequence of this mixture the distribution of the increments of the resulting random process is time dependent. We prove a strong law of large numbers for the DERW and, in a particular case, we provide an explicit expression for its speed. Finally, we give sufficient conditions for the central limit theorem and the law of the iterated logarithm to hold.
Let A(n) be a sequence of i.i.d. topical (i.e. isotone and additively homogeneous) operators. Let $x(n,x_0)$ be defined by $x(0,x_0)=x_0$ and $x(n,x_0)=A(n)x(n-1,x_0)$. This can modelize a wide range of systems including, task graphs, train networks, Job-Shop, timed digital circuits or parallel processing systems. When A(n) has the memory loss property, we use the spectral gap method to prove limit theorems for $x(n,x_0)$. Roughly speaking, we show that $x(n,x_0)$ behaves like a sum of i.i.d. real variables. Precisely, we show that with suitable additional conditions, it satisfies a central li…
The theoretical description of non-renewal stochastic systems is a challenge. Analytical results are often not available or can only be obtained under strong conditions, limiting their applicability. Also, numerical results have mostly been obtained by ad-hoc Monte--Carlo simulations, which are usually computationally expensive when a high degree of accuracy is needed. To gain quantitative insight into these systems under general conditions, we here introduce a numerical iterated first-passage time approach based on solving the time-dependent Fokker-Planck equation (FPE) to describe the statis…
In this paper, we study the fractional Poisson process (FPP) time-changed by an independent Lévy subordinator and the inverse of the Lévy subordinator, which we call TCFPP-I and TCFPP-II, respectively. Various distributional properties of these processes are established. We show that, under certain conditions, the TCFPP-I has the long-range dependence property and also its law of iterated logarithm is proved. It is shown that the TCFPP-II is a renewal process and its waiting time distribution is identified. Its bivariate distributions and also the governing difference-differential equation are…
We consider linear iterated function systems with a random multiplicative error on the real line. Our system is $\{x\mapsto d_i + λ_i Y x\}_{i=1}^m$, where $d_i\in \R$ and $λ_i>0$ are fixed and $Y> 0$ is a random variable with an absolutely continuous distribution. The iterated maps are applied randomly according to a stationary ergodic process, with the sequence of i.i.d. errors $y_1,y_2,...$, distributed as $Y$, independent of everything else. Let $h$ be the entropy of the process, and let $χ= E[\log(λY)]$ be the Lyapunov exponent. Assuming that $χ< 0$, we obtain a family of conditional meas…
Consider the workload process for a single server queue with deterministic service times in which customers arrive according to a scheduled traffic process. A scheduled arrival sequence is one in which customers are scheduled to arrive at constant interarrival times, but each customer actual arrival time is perturbed from her scheduled arrival time by a random perturbation. In this paper, we consider a critically loaded queue in which the service rate equals the arrival rate. Unlike a queue fed by renewal traffic, this queue can be stable even in the presence of critical loading. We identify a…
Let $V=\mathbb R^d$ be the Euclidean $d$-dimensional space, $μ$ (resp $λ$) a probability measure on the linear (resp affine) group $G=G L (V)$ (resp $H= \Aff (V))$ and assume that $μ$ is the projection of $λ$ on $G$. We study asymptotic properties of the iterated convolutions $μ^n *δ\_{v}$ (resp $λ^n*δ\_{v})$ if $v\in V$, i.e asymptotics of the random walk on $V$ defined by $μ$ (resp $λ$), if the subsemigroup $T\subset G$ (resp.\ $Σ\subset H$) generated by the support of $μ$ (resp $λ$) is "large". We show spectral gap properties for the convolution operator defined by $μ$ on spaces of homogene…
