ABSTRACT
Here we study large deviations in networks that are more likely to result from the accumulation of many slightly unusual events. We are particularly interested in analyzing large deviations where the most probable path changes direction. These deviations arise when a large deviation in one part of the system cascades across the network to produce a large deviation in another part of the network.
- Ivo J. B. F. Adan, Robert D. Foley, David R. McDonald, (2009). Exact asymptotics for the stationary distribution of a Markov chain: a production model. Queueing Syst., 311--344Google Scholar
- V. Anantharam, P. Heidelberger, P. Tsoucas, (1990). Analysis of Rare Events in Continuous Time Markov Chains via Time Reversal and Fluid Approximation. Research Report, RC 16280, Computer Science Division, IBM T. J. Watson Center, Yorktown Heights, New York.Google Scholar
- F Baccelli, P. Bremaud, (2003). Elements of Queueing Theory Springer Verlag.Google Scholar
- F Baccelli, D McDonald, (1997). Rare events for stationary processes. Stochastic Processes and their Applications Vol. 89. 141--173Google Scholar
- A. A. Borovkov and A. A. Mogul'skii, (2001). Limit Theorems in the Boundary Hitting Problem for a Multidimensional Random Walk. Siberian Mathematical Journal 4, 245--270.Google ScholarCross Ref
- R. Foley, D. McDonald, (2001). Join the Shortest Queue: Stability and Exact Asymptotics, Annals of Applied Probability, 11. 11, 569--607.Google ScholarCross Ref
- Foley, R. and McDonald, D., (2004). Large Deviations of a Modified Jackson Network: Stability and Rough Asymptotics, Ann. Appl. Probab., 15, 519--541.Google Scholar
- Foley, R. D. and D. R. McDonald, (2005). "Bridges and Networks: Exact Asymptotics," Annals of Applied Probability, 15, pp. 542--586.Google ScholarCross Ref
- Foley, R. D., McDonald, D. R. Constructing a harmonic function for an irreducible non-negative matrix with convergence parameter R > 1. Accepted subject to revisions London Mathematical Society.Google Scholar
- Irina Ignatiouk-Robert and Christophe Loree, (2010). Martin boundary of a killed random walk on a quadrant Ann. Probab. 38, 1106--1142.Google ScholarCross Ref
- Kurtz, T. G., (1978). Strong approximation theorems for density dependent Markov chains, Stoch. Proc. Appl. 6, 223--240.Google ScholarCross Ref
- K. Majewski, K. Ramanan, (2008). How large queue lengths build up in a Jackson network. preprint.Google Scholar
- S. P. Meyn, R. L. Tweedie, (1993). Markov chains and stochastic stability. Springer-Verlag, London. Available at: probability.ca/MT.Google Scholar
- Masakiyo Miyazawa, Yiqiang Zhao, (2009). Tail Decay Rates in Double QBD Processes and Related Reflected Random Walks Mathematics of Operations Research, 34, 547--575. Google ScholarDigital Library
- V. Nicola, T. Zaburnenko, (2007). Efficient Importance Sampling Heuristics for the Simulation of Population Overflow in Jackson Networks. ACM Transactions on Modeling and Computer Simulation, 17. Google ScholarDigital Library
Index Terms
- Networks with cascading overloads
Recommendations
Experiencing the Improbable: Rare Events and Organizational Learning
Organizations that go through rare and unusual events, whether they are costly or beneficial, face the challenge of interpreting and learning from these experiences. Although research suggests that organizations respond to this challenge in a variety of ...
Bayesian analysis of rare events
In many areas of engineering and science there is an interest in predicting the probability of rare events, in particular in applications related to safety and security. Increasingly, such predictions are made through computer models of physical systems ...
On Optimal Importance Sampling for Discrete Time Markov Chains
QEST '05: Proceedings of the Second International Conference on the Quantitative Evaluation of SystemsImportance sampling is a variance reduction technique for efficient simulation via a change of measure. In particular, it can be applied to rare event simulation of Markov chains. An optimal change of measure yielding a zero variance estimator always ...
Comments