scholarly journals A Case of a Random Difference Equation Connected with a Filtered Binary Process

1996 ◽  
Vol 17 (1) ◽  
pp. 88-100 ◽  
Author(s):  
Jean-François Chamayou
1997 ◽  
Vol 34 (02) ◽  
pp. 508-513 ◽  
Author(s):  
J. Preater

We relate the equilibrium size of an M/M/8 type queue having an intermittent arrival stream to a perpetuity, the solution of a random difference equation. One consequence is a classical result for ranked server systems, previously obtained by generating function methods.


1997 ◽  
Vol 29 (1) ◽  
pp. 138-164 ◽  
Author(s):  
Roland Perfekt

We consider extreme value theory for a class of stationary Markov chains with values in ℝd. The asymptotic distribution of Mn, the vector of componentwise maxima, is determined under mild dependence restrictions and suitable assumptions on the marginal distribution and the transition probabilities of the chain. This is achieved through computation of a multivariate extremal index of the sequence, extending results of Smith [26] and Perfekt [21] to a multivariate setting. As a by-product, we obtain results on extremes of higher-order, real-valued Markov chains. The results are applied to a frequently studied random difference equation.


1997 ◽  
Vol 34 (2) ◽  
pp. 508-513 ◽  
Author(s):  
J. Preater

We relate the equilibrium size of an M/M/8 type queue having an intermittent arrival stream to a perpetuity, the solution of a random difference equation. One consequence is a classical result for ranked server systems, previously obtained by generating function methods.


2017 ◽  
Vol 54 (4) ◽  
pp. 1089-1110 ◽  
Author(s):  
Gerold Alsmeyer ◽  
Dariusz Buraczewski ◽  
Alexander Iksanov

Abstract Given a sequence (Mk, Qk)k ≥ 1 of independent and identically distributed random vectors with nonnegative components, we consider the recursive Markov chain (Xn)n ≥ 0, defined by the random difference equation Xn = MnXn - 1 + Qn for n ≥ 1, where X0 is independent of (Mk, Qk)k ≥ 1. Criteria for the null recurrence/transience are provided in the situation where (Xn)n ≥ 0 is contractive in the sense that M1 ⋯ Mn → 0 almost surely, yet occasional large values of the Qn overcompensate the contractive behavior so that positive recurrence fails to hold. We also investigate the attractor set of (Xn)n ≥ 0 under the sole assumption that this chain is locally contractive and recurrent.


1997 ◽  
Vol 25 (1) ◽  
pp. 478-493 ◽  
Author(s):  
Martine Babillot ◽  
Philippe Bougerol ◽  
Laure Elie

2021 ◽  
Vol 31 (4) ◽  
pp. 281-291
Author(s):  
Aleksandr V. Shklyaev

Abstract In this first part of the paper we find the asymptotic formulas for the probabilities of large deviations of the sequence defined by the random difference equation Y n+1=A n Y n + B n , where A 1, A 2, … are independent identically distributed random variables and B n may depend on { ( A k , B k ) , 0 ⩽ k < n } $ \{(A_k,B_k),0\leqslant k \lt n\} $ for any n≥1. In the second part of the paper this results are applied to the large deviations of branching processes in a random environment.


1988 ◽  
Vol 25 (1) ◽  
pp. 142-149 ◽  
Author(s):  
Eric S. Tollar

A characterization of the gamma distribution is considered which arises from a random difference equation. A proof without characteristic functions is given that if V and Y are independent random variables, then the independence of V · Y and (1 – V) · Y results in a characterization of the gamma distribution (after excluding the trivial cases).


1988 ◽  
Vol 25 (01) ◽  
pp. 142-149 ◽  
Author(s):  
Eric S. Tollar

A characterization of the gamma distribution is considered which arises from a random difference equation. A proof without characteristic functions is given that if V and Y are independent random variables, then the independence of V · Y and (1 – V) · Y results in a characterization of the gamma distribution (after excluding the trivial cases).


Sign in / Sign up

Export Citation Format

Share Document