On stochastic recursive equations of sum and max type

In this paper we consider stochastic recursive equations of sum type, , and of max type, , where A i , b i , and b are random, (X i ) are independent, identically distributed copies of X, and denotes equality in distribution. Equations of these types typically characterize limits in the probabilistic analysis of algorithms, in combinatorial optimization problems, and in many other problems having a recursive structure. We develop some new contraction properties of minimal L s -metrics which allow us to establish general existence and uniqueness results for solutions without imposing any moment conditions. As an application we obtain a one-to-one relationship between the set of solutions to the homogeneous equation and the set of solutions to the inhomogeneous equation, for sum- and max-type equations. We also give a stochastic interpretation of a recent transfer principle of Rösler from nonnegative solutions of sum type to those of max type, by means of random scaled Weibull distributions.

[1]  Uwe Rösler,et al.  On the analysis of stochastic divide and conquer algorithms , 2001, Algorithmica.

[2]  L. Rüschendorf,et al.  Analysis of Algorithms by the Contraction Method: Additive and Max-recursive Sequences , 2005 .

[3]  R. Neininger,et al.  On the contraction method with degenerate limit equation , 2004, math/0410177.

[4]  L. Rüschendorf,et al.  A general limit theorem for recursive algorithms and combinatorial structures , 2004 .

[5]  D. Aldous,et al.  A survey of max-type recursive distributional equations , 2004, math/0401388.

[6]  The best constant in the Topchii-Vatutin inequality for martingales , 2003 .

[7]  A. Caliebe,et al.  Fixed points with finite variance of a smoothing transformation , 2003 .

[8]  Luc Devroye,et al.  ON THE PROBABILISTIC WORST-CASE TIME OF “FIND” , 2001 .

[9]  J. Hutchinson,et al.  Random fractals and probability metrics , 2000, Advances in Applied Probability.

[10]  Svante Janson,et al.  A characterization of the set of fixed points of the Quicksort transformation , 2000, ArXiv.

[11]  Ludger Rüschendorf,et al.  Selfsimilar Fractals and Selfsimilar Random Fractals , 2000 .

[12]  Uwe Rr Osler.  The Contraction Method for Recursive Algorithms , 1999 .

[13]  Uwe Rr Osler,et al.  A Limit Theorem for "quicksort" , 1999 .

[14]  Quansheng Liu.  Fixed points of a generalized smoothing transformation and applications to the branching random walk , 1998, Advances in Applied Probability.

[15]  J. Hutchinson,et al.  RANDOM FRACTAL MEASURES VIA THE CONTRACTION METHOD , 1998 .

[16]  Andreas E. Kyprianou,et al.  SENETA-HEYDE NORMING IN THE BRANCHING RANDOM WALK , 1997 .

[17]  Rudolf Grübel,et al.  Asymptotic distribution theory for Hoare's selection algorithm , 1996, Advances in Applied Probability.

[18]  Ludger Rüschendorf,et al.  Convergence of a branching type recursion , 1996 .

[19]  S. Rachev,et al.  Probability metrics and recursive algorithms , 1995, Advances in Applied Probability.

[20]  Russell Lyons,et al.  Conceptual proofs of L log L criteria for mean behavior of branching processes , 1995 .

[21]  S. Rachev,et al.  Rate of Convergence for Sums and Maxima and Doubly Ideal Metrics , 1993 .

[22]  U. Rösler.  A fixed point theorem for distributions , 1992 .

[23]  J. Freeman.  Probability Metrics and the Stability of Stochastic Models , 1991 .

[24]  Yves Guivarc'h,et al.  Sur une extension de la notion de loi semi-stable , 1990 .

[25]  R. Durrett,et al.  Fixed points of the smoothing transformation , 1983 .

[26]  Thomas M. Liggett,et al.  Generalized potlatch and smoothing processes , 1981 .

[27]  J. Biggins,et al.  Martingale convergence in the branching random walk , 1977, Journal of Applied Probability.

[28]  J. Kahane,et al.  Sur certaines martingales de Benoit Mandelbrot , 1976 .

[29]  J. Doob.  Stochastic processes , 1953 .