A multiplicative version of the Lindley recursion
| Authors |
|
|---|---|
| Publication date | 08-2021 |
| Journal | Queueing Systems |
| Volume | Issue number | 98 | 3-4 |
| Pages (from-to) | 225-245 |
| Organisations |
|
| Abstract |
This paper presents an analysis of the stochastic recursion Wi+1=[ViWi+Yi]+ that can be interpreted as an autoregressive process of order 1, reflected at 0. We start our exposition by a discussion of the model’s stability condition. Writing Yi=Bi−Ai, for independent sequences of nonnegative i.i.d. random variables {Ai}i∈N0 and {Bi}i∈N0, and assuming {Vi}i∈N0 is an i.i.d. sequence as well (independent of {Ai}i∈N0 and {Bi}i∈N0), we then consider three special cases (i) Vi equals a positive value a with certain probability p∈(0,1) and is negative otherwise, and both Ai and Bi have a rational LST, (ii) Vi attains negative values only and Bi has a rational LST, (iii) Vi is uniformly distributed on [0, 1], and Ai is exponentially distributed. In all three cases, we derive transient and stationary results, where the transient results are in terms of the transform at a geometrically distributed epoch.
|
| Document type | Article |
| Language | English |
| Published at | https://doi.org/10.1007/s11134-021-09698-8 |
| Downloads |
A multiplicative version of the Lindley recursion
(Final published version)
|
| Permalink to this page | |