A Multiplicative Version of the Lindley Recursion

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 non-negative 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 attains negative values only and Bi has a rational LST, (ii) 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, (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.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…