Interlacing Eigenvalues in Time Reversible Markov Chains

Published Online:https://doi.org/10.1287/moor.24.4.847

References

  • Aldous D. J. Markov chains with almost exponential hitting times. Stochastic Process. Appl. (1982) 13 305 310 CrossrefGoogle Scholar
  • Aldous D. J. , Brown M. , Shaked I. M. , Tong Y. L. Inequalities for rare events in time reversible Markov chains. Stochastic Inequalities (1992) 22 . Institute of Mathematical Statistics Lecture Notes—Monograph Series CrossrefGoogle Scholar
  • Aldous D. J. , Diaconis P. Strong uniform times and finite random walks. Adv. Appl. Math. (1987) 8 69 97 CrossrefGoogle Scholar
  • Aldous D. J. , Fill J. A. Reversible Markov chains and random walks on graphs. (1999) . Forthcoming in 2000 Google Scholar
  • Barlow R. E. , Fusell J. B. , Singurwalla N. D. Reliability and Fault Tree Analysis (1975) (SIAM, Philadelphia, PA) Google Scholar
  • Barlow R. E. , Proschan F. Statistical Theory of Reliability and Life Testing: Probability Models (1975) (Holt, Rinehart and Winston, Inc., New York) Google Scholar
  • Brown M. , Barlow R. E. , Fusell J. B. , Singpurwalla N. D. The first passage time distribution for a parallel exponential system with repair. Reliability and Fault Tree Analysis (1975) (SIAM, Philadelphia, PA) Google Scholar
  • Brown M. Approximating IMRL distributions by exponential distributions, with applications to first passage times. Ann. Probab. (1983) 11 419 427 CrossrefGoogle Scholar
  • Brown M. A useful isometry for time reversible Markov chains with applications to reliability. (1997) . Technical report (July 1997), New York, City College, CUNY Google Scholar
  • Diaconis P. Group Representations in Probability and Statistics (1988) 11 . Institute of Mathematical Statistics Lecture Notes—Monograph Series Google Scholar
  • Diaconis P. , Fill J. A. Strong stationary times via a new form of duality. Ann. Probab. (1990) 18 1483 1522 CrossrefGoogle Scholar
  • Diaconis P. , Stroock W. Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Probab. (1991) 1 36 61 CrossrefGoogle Scholar
  • Gertsbakh I. B. Asymptotic methods in reliability theory: A review. Adv. Appl. Probab. (1984) 16 147 175 CrossrefGoogle Scholar
  • Gertsbakh I. B. Statistical Reliability Theory (1989) (Marcel Dekker, New York) Google Scholar
  • Gnedeko B. V. , Belyaev Yu K. , Solovyev A. D. Mathematical Methods in Reliability Theory (1969) (Academic Press, New York) Google Scholar
  • Horn R. A. , Johnson C. R. Matrix Analysis (1985) (Cambridge University Press, Cambridge, MA) CrossrefGoogle Scholar
  • Keilson J. Markov Chain Models, Rarity and Exponentiality (1979) (Springer-Verlag, New York) CrossrefGoogle Scholar
  • Lang S. Linear Algebra (1966) (Addison-Wesley, Reading, Massachusetts) Google Scholar
  • Marshall A. W. , Okin I. Inequalities: Theory of Majorization and its Applications (1979) (Academic Press, New York) Google Scholar
  • Mirsky L. Matrices with prescribed characteristic roots and diagonal elements. J. London Math. Soc. (1958) 33 14 21 CrossrefGoogle Scholar
  • Rao C. R. Linear Statistical Inference and its Applications (1965) (John Wiley and Sons, New York) Google Scholar
  • Ross S. M. Stochastic Processes (1996) 2nd ed. (John Wiley and Sons, New York) Google Scholar
  • Solovyev A. D. Asymptotic behaviour of the time of first occurrence of a rare event. Engrg. Cybernetics (1971) 9 1038 1048 Google Scholar
  • Solovyev A. D. Asymptotic distribution of the moment of first crossing of a high level by a birth and death process. Proc. 6th Berkeley Symp. Math. Statist. Probab. (1972) 3 71 86 Google Scholar
  • Sumita U. , Masuda Y. Classes of probability density functions having Laplace transforms with negative zeroes and poles. Adv. Appl. Probab. (1987) 19 632 651 CrossrefGoogle Scholar
  • Weinberger H. F. An inequality with alternating signs. Proc. Nat. Acad. Sci. (1952) 38 611 613 . USA CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.