IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-00464967.html

Perturbed Markov chains

Author

Listed:
  • Nicolas Vieille

    (GREGH - Groupement de Recherche et d'Etudes en Gestion à HEC - HEC Paris - Ecole des Hautes Etudes Commerciales - CNRS - Centre National de la Recherche Scientifique)

  • Eilon Solan

    (TAU - Tel Aviv University)

Abstract

We study irreducible time-homogenous Markov chains with finite state space in discrete time. We obtain results on the sensitivity of the stationary distribution and other statistical quantities with respect to perturbations of the transition matrix. We define a new closeness relation between transition matrices, and use graph-theoretic techniques, in contrast with the matrix analysis techniques previously used.

Suggested Citation

  • Nicolas Vieille & Eilon Solan, 2003. "Perturbed Markov chains," Post-Print hal-00464967, HAL.
  • Handle: RePEc:hal:journl:hal-00464967
    DOI: 10.1239/jap/1044476830
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    Other versions of this item:

    Citations

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


    Cited by:

    1. Dinah Rosenberg & Eilon Solan & Nicolas Vieille, 2002. "Approximating a Sequence of Observations by a Simple Process," Working Papers hal-00593643, HAL.
    2. Eilon Solan & Nicolas Vieille, 2010. "Computing uniformly optimal strategies in two-player stochastic games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 237-253, January.
    3. Dinah Rosenberg & Eilon Solan & Nicolas Vieille, 2002. "Approximating a Sequence of Approximations by a Simple Process," Discussion Papers 1345, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    4. , Aisdl, 2007. "Weak convergence of first-rare-event times for semi-Markov processes," OSF Preprints q95cv, Center for Open Science.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;

    JEL classification:

    • C44 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Operations Research; Statistical Decision Theory

    Statistics

    Access and download statistics

    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:hal:journl:hal-00464967. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.