Extended renovation theory and limit theorems for stochastic ordered graphs

We extend Borovkov's renovation theory to obtain criteria for coup- ling-convergence of stochastic processes that do not necessarily obey stochastic recursions. The results are applied to an "infinite bin model", a particular system that is an abstraction of a stochastic ordered graph, i.e., a graph on the integers that has (i,j), i < j, as an edge, with probability p, independently from edge to edge. A question of interest is an estimate of the length Ln of a longest path between two vertices at distance n. We give sharp bounds on C = limn!1(Ln/n). This is done by first constructing the unique stationary version of the infinite bin model, using extended renovation theory. We also prove a functional law of large numbers and a functional central limit theorem for the infinite bin model. Finally, we discuss perfect simulation, in connection to extended renovation theory, and as a means for simulating the particular stochastic models considered in this paper.

[1]  Charles M. Newman,et al.  Chain Lengths in Certain Random Directed Graphs , 1992, Random Struct. Algorithms.

[2]  T. Lindvall.  Lectures on the Coupling Method , 1992 .

[3]  H. Thorisson.  Coupling, stationarity, and regeneration , 2000 .

[4]  R. Tweedie,et al.  Perfect simulation and backward coupling , 1998 .

[5]  Pablo A. Ferrari,et al.  Processes with long memory: Regenerative construction and perfect simulation , 2002 .

[6]  V. Anantharam,et al.  Stationary solutions of stochastic recursions describing discrete event systems , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[7]  A. A. Borovkov,et al.  STOCHASTICALLY RECURSIVE SEQUENCES AND THEIR GENERALIZATIONS , 1992 .

[8]  Neil O'Connell,et al.  Review: Torgny Lindvall, Lectures on the Coupling Method , 1995 .

[9]  Thomas L. Saaty,et al.  Elements of queueing theory , 2003 .

[10]  V. Anantharam,et al.  Corrigendum A correction and some additional remarks on: Stationary solutions of stochastic recursions describing discrete event systems , 1999 .

[11]  W. D. Ray.  Stationary Stochastic Models , 1991 .

[12]  A. A. Borovkov,et al.  Asymptotic Methods in Queueing Theory. , 1986 .

[13]  C. Newman,et al.  Community Area and Food-Chain Length: Theoretical Predictions , 1991, The American Naturalist.

[14]  F. Baccelli,et al.  On the saturation rule for the stability of queues , 1995, Journal of Applied Probability.

[15]  P. Franken,et al.  Stationary Stochastic Models. , 1992 .

[16]  Laurent Massoulié,et al.  Imbedded construction of stationary sequences and point processes with a random memory , 1994, Queueing Syst. Theory Appl..

[17]  Persi Diaconis,et al.  Iterated Random Functions , 1999, SIAM Rev..

[18]  Charles M. Newman,et al.  Speed of parallel processing for random task graphs , 1994 .

[19]  David Bruce Wilson,et al.  Exact sampling with coupled Markov chains and applications to statistical mechanics , 1996, Random Struct. Algorithms.

[20]  A correction and some additional remarks on : Stationary solutions of stochastic recursions describing discrete event systems [ Stochastic Process , 1999 .

[21]  S. Foss,et al.  Two ergodicity criteria for stochastically recursive sequences , 1994 .

[22]  A. Borovkov.  Ergodicity and Stability Theorems for a Class of Stochastic Equations and Their Applications , 1979 .

[23]  Joel E. Cohen,et al.  A Stochastic Theory of Community Food Webs , 1990 .