Variate Generation in Reliability
- 2 Citations
- 1.7k Downloads
Abstract
This chapter considers (1) the generation of random lifetimes via density-based and hazard-based methods, (2) the generation of certain stochastic processes that are useful in reliability and availability analysis, and (3) the generation of random lifetimes for the accelerated life and proportional hazards models. The accurate modeling of failure time distributions is critical for the development of valid Monte Carlo and discrete-event simulation models for applications in reliability and survival analysis. Once an accurate model has been established, it is oftentimes the case that the complexity of the model requires an analysis by simulation. The associated variate generation algorithms for common stochastic models are introduced here. Although the generation of random lifetimes is typically applied to reliability and survival analysis in a simulation setting, their use is widespread in other disciplines as well. The more diverse wider literature on generating random objects includes generating random combinatorial objects, generating random matrices, generating random polynomials, generating random colors, generating random geometric objects, and generating random spawning trees.
Keywords
Poisson Process Hazard Function Failure Time Renewal Process Counting ProcessReferences
- 1.Allison PD (1984) Event history analysis: regression for longitudinal event data. Sage Publications, Newbury Park, CA, USAGoogle Scholar
- 2.Banks J, Carson JS, Nelson BL, Nicol DM (2005) Discrete-event system simulation, 4th edn. Prentice-Hall, Upper Saddle River, NJ, USAGoogle Scholar
- 3.Bender R, Augustin T, Blettner M (2005) Generating survival times to simulate Cox proportional hazards models. Stat Med 24:1713–1723CrossRefMathSciNetGoogle Scholar
- 4.Bender R, Augustin T, Blettner M (2006) Letter to the editor. Stat Med 25:1978–1979CrossRefGoogle Scholar
- 5.Carmeli M (1983) Statistical theory and random matrices. Marcel Dekker, New York, NY, USAzbMATHGoogle Scholar
- 6.Çinlar E (1975) Introduction to stochastic processes. Prentice-Hall, Upper Saddle River, NJ, USAzbMATHGoogle Scholar
- 7.Clarke AB, Disney RL (1985) Probability and random processes: a first course with applications, 2nd edn. John Wiley, New York, NY, USAzbMATHGoogle Scholar
- 8.Cox DR, Isham V (1980) Point processes. Chapman and Hall, Boca Raton, FL, USAzbMATHGoogle Scholar
- 9.Cox DR, Oakes D (1984) Analysis of survival data. Chapman and Hall, Boca Raton, FL, USAGoogle Scholar
- 10.Crowder, MJ (2001) Classical competing risks. Chapman and Hall/CRC Press, Boca Raton, FL, USAzbMATHCrossRefGoogle Scholar
- 11.David HA, Moeschberger ML (1978) The theory of competing risks. Macmillan, New York, NY, USAzbMATHGoogle Scholar
- 12.Deift P (2000) Orthogonal polynomials and random matrices: A Riemann-Hilbert approach. American Mathematical Society, Providence, RI, USAzbMATHGoogle Scholar
- 13.Devroye L (1986) Non-uniform random variate generation. Springer, New York, NY, USAzbMATHGoogle Scholar
- 14.Edelman A, Kostlan E (1995) How many zeros of a random polynomial are real? Bulletin of the Am Math Soc 32(1):1–37zbMATHCrossRefMathSciNetGoogle Scholar
- 15.Edelman A, Kostlan E, Shub M (1994) How many eigenvalues of a random matrix are real? J Am Math Soc 7:247–267zbMATHMathSciNetGoogle Scholar
- 16.Everitt BS, Hand DJ (1981) Finite mixture distributions. Chapman and Hall, Boca Raton, FL, USAzbMATHGoogle Scholar
- 17.Fishman GS (1996) Monte Carlo: Concepts, algorithms, and applications. Springer, New York, NY, USAzbMATHGoogle Scholar
- 18.Ghosh S, Henderson SG (2003) Behavior of the NORTA method for correlated random vector generation as the dimension increases. ACM Trans Model Comput Simul 13:276–294CrossRefGoogle Scholar
- 19.Gilks WR, Richardson S, Spiegelhalter DJ (1996) Markov chain Monte Carlo in practice. Chapman and Hall/CRC, Boca Raton, FL, USAzbMATHGoogle Scholar
- 20.Gross D, Harris CM (1998) Fundamentals of queueing theory, 3rd edn. John Wiley, Hoboken, NJ, USAzbMATHGoogle Scholar
- 21.Hörmann W, Leydold J, Derflinger G (2004) Nonuniform automatic random variate generation. Springer, New York, NY, USAzbMATHGoogle Scholar
- 22.Hastings WK (1970) Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57:97–109zbMATHCrossRefGoogle Scholar
- 23.Knuth DE (1998) The art of computer programming, Vol 2: Seminumerical algorithms, 3rd edn. Addison-Wesley, Reading, MA, USAzbMATHGoogle Scholar
- 24.Law AM (2007) Simulation modeling and analysis, 4th edn. McGraw-Hill, New York, NY, USAGoogle Scholar
- 25.Lawless JF (2003) Statistical models and methods for lifetime data, 2nd edn. John Wiley, New York, NY, USAzbMATHGoogle Scholar
- 26.Lee S, Wilson JR, Crawford MM (1991) Modeling and simulation of a nonhomogeneous Poisson process having cyclic behavior. Commun Stat Simul Comput 20(2&3):777–809zbMATHCrossRefGoogle Scholar
- 27.Leemis LM (1987) Variate generation for the accelerated life and proportional hazards models. Oper Res 35(6):892–894CrossRefGoogle Scholar
- 28.Lewis PAW, Shedler GS (1979) Simulation of nonhomogeneous poisson processes by thinning. Naval Res Logist Quart 26(3)403–413zbMATHCrossRefMathSciNetGoogle Scholar
- 29.Marsaglia G, Olkin I (1984) Generating correlation matrices. SIAM J Sci Stat Comput 5(2):470–475zbMATHCrossRefMathSciNetGoogle Scholar
- 30.McLachlan G, Peel D (2000) Finite mixture models. John Wiley, New York, NY, USAzbMATHCrossRefGoogle Scholar
- 31.Meeker WQ, Escobar LA. (1998) Statistical methods for reliability data. John Wiley, New York, NY, USAzbMATHGoogle Scholar
- 32.Mehta ML (2004) Random matrices, 3rd edn. Elsevier, Amsterdam, The NetherlandszbMATHGoogle Scholar
- 33.Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller AH, Teller E (1953) Equations of state calculations by fast computing machine. J Chem Phys 21:1087–1091CrossRefGoogle Scholar
- 34.Morris SB (1998) Magic tricks, card shuffling and dynamic computer memories. The Mathematical Association of America, Washington D.C., USAzbMATHGoogle Scholar
- 35.Nelson BL (2002) Stochastic modeling: analysis and simulation. Dover Publications, Mineola, NY, USAzbMATHGoogle Scholar
- 36.Nelson BL, Ware P, Cario MC, Harris CA, Jamison SA, Miller JO, Steinbugl J, Yang J (1995) Input modeling when simple models fail. In: Alexopoulos C, Kang K, Lilegdon WR, Goldsman D (eds) Proceedings of the 1995 winter simulation conference, IEEE Computer Society, Washington DC, USA, pp 3–100Google Scholar
- 37.Nelson WB (2003) Recurrent events data analysis for product repairs, disease recurrences and other applications. ASA/SIAM, Philadelphia, PA, USAzbMATHGoogle Scholar
- 38.Nijenhuis A, Wilf HS (1978) Combinatorial algorithms for computers and calculators, 2nd edn. Academic Press, Orlando, FL, USAzbMATHGoogle Scholar
- 39.O’Quigley J (2008) Proportional hazards regression. Springer, New York, NY, USAzbMATHCrossRefGoogle Scholar
- 40.Resnick SI (1992) Adventures in stochastic processes. Birkhäuser, New York, NY, USAzbMATHGoogle Scholar
- 41.Rigdon SE, Basu AP (2000) Statistical methods for the reliability of repairable systems. John Wiley, New York, NY, USAzbMATHGoogle Scholar
- 42.Ross SL (2003) Introduction to probability models, 8th edn. Academic Press, Orlando, FL, USAzbMATHGoogle Scholar
- 43.Schoenberg FP (2003) Multidimensional residual analysis of point process models for earthquake occurrences. J Am Stat Assoc 98:464CrossRefMathSciNetGoogle Scholar
- 44.Schoenberg FP (2003) Multidimensional residual analysis of point process models for earthquake occurrences. J Am Stat Assoc 98:789–795CrossRefMathSciNetGoogle Scholar
- 45.White KP (1999) Simulating a nonstationary Poisson process using bivariate thinning: The case of “typical weekday” arrivals at a consumer electronics store. In: Farrington P, Nembhard PA, Sturrock HB, Evans GW (eds) Proceedings of the 1999 winter simulation conference, ACM, New York, NY, USA, pp 458–461Google Scholar
- 46.Whitt W (2002) Stochastic-process limits: an introduction to stochastic-process limits and their application to queues. Springer, New York, NY, USAzbMATHGoogle Scholar
- 47.Wilf HS (1989) Combinatorial algorithms: an update. SIAM, Philadelphia, PA, USAGoogle Scholar