IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v43y1995i3p509-519.html
   My bibliography  Save this article

On the Choice of Alternative Measures in Importance Sampling with Markov Chains

Author

Listed:
  • Sigrún Andradóttir

    (University of Wisconsin, Madison, Wisconsin)

  • Daniel P. Heyman

    (Bell Communications Research, Morristown, New Jersey)

  • Teunis J. Ott

    (Bell Communications Research, Morristown, New Jersey)

Abstract

In the simulation of Markov chains, importance sampling involves replacing the original transition matrix, say P , with a suitably chosen transition matrix Q that tends to visit the states of interest more frequently. The likelihood ratio of P relative to Q is an important random variable in the importance sampling method. It always has expectation one, and for any interesting pair of transition matrices P and Q , there is a sample path length that causes the likelihood ratio to be close to zero with probability close to one. This may cause the variance of the importance sampling estimator to be larger than the variance of the traditional estimator. We develop sufficient conditions for ensuring the tightness of the distribution of the logarithm of the likelihood ratio for all sample path lengths, and we show that when these conditions are satisfied, the likelihood ratio is approximately lognormally distributed with expected value one. These conditions can be used to eliminate some choices of the alternative transition matrix Q that are likely to result in a variance increase. We also show that if the likelihood ratio is to remain well behaved for all sample path lengths, the alternative transition matrix Q has to approach the original transition matrix P as the sample path length increases. The practical significance of this result is that importance sampling can be difficult to apply successfully in simulations that involve long sample paths.

Suggested Citation

  • Sigrún Andradóttir & Daniel P. Heyman & Teunis J. Ott, 1995. "On the Choice of Alternative Measures in Importance Sampling with Markov Chains," Operations Research, INFORMS, vol. 43(3), pages 509-519, June.
  • Handle: RePEc:inm:oropre:v:43:y:1995:i:3:p:509-519
    DOI: 10.1287/opre.43.3.509
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.43.3.509
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.43.3.509?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. T. P. I. Ahamed & V. S. Borkar & S. Juneja, 2006. "Adaptive Importance Sampling Technique for Markov Chains Using Stochastic Approximation," Operations Research, INFORMS, vol. 54(3), pages 489-504, June.
    2. Cheng-Der Fuh & Yanwei Jia & Steven Kou, 2023. "A General Framework for Importance Sampling with Latent Markov Processes," Papers 2311.12330, arXiv.org.
    3. Julia L. Higle, 1998. "Variance Reduction and Objective Function Evaluation in Stochastic Linear Programs," INFORMS Journal on Computing, INFORMS, vol. 10(2), pages 236-247, May.
    4. Kaynar, Bahar & Ridder, Ad, 2010. "The cross-entropy method with patching for rare-event simulation of large Markov chains," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1380-1397, December.
    5. Fakhouri H. & Nasroallah A., 2009. "On the simulation of Markov chain steady-state distribution using CFTP algorithm," Monte Carlo Methods and Applications, De Gruyter, vol. 15(2), pages 91-105, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:43:y:1995:i:3:p:509-519. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.