Perturbation bounds for the stationary probabilities of a finite Markov chain
The DOI matches its OpenAlex record.
Abstract
This paper discusses perturbation bounds for the stationary distribution of a finite indecomposable Markov chain. Existing bounds are reviewed. New bounds are presented which more completely exploit the stochastic features of the perturbation and which also are easily computable. Examples illustrate the tightness of the bounds and their application to bounding the error in the Simon–Ando aggregation technique for approximating the stationary distribution of a nearly completely decomposable Markov chain.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Opinion Dynamics and Learning in Social Networks
Acemoglu, D., & Ozdaglar, A. (2011) · Dynamic Games and Applications · doi:10.1007/s13235-010-0004-1 · Cited by 705
Spread of (mis)information in social networks
Acemoglu, D., Ozdaglar, A., & ParandehGheibi, A. (2010) · Games and Economic Behavior · doi:10.1016/j.geb.2010.01.005 · Cited by 444
Stochastic Complementation, Uncoupling Markov Chains, and the Theory of Nearly Reducible Systems
Meyer, C. D. (1989) · SIAM Review · doi:10.1137/1031050 · Cited by 316
Aggregation/Disaggregation Methods for Computing the Stationary Distribution of a Markov Chain
Haviv, M. (1987) · SIAM Journal on Numerical Analysis · doi:10.1137/0724062 · Cited by 64
Self-citation
Metadata
- Authors
- Haviv, M., & der Heyden, L. V.
- Venue
- Advances in Applied Probability
- Publisher
- Cambridge University Press
- Published
- 1984-12-01
- Volume
- 16
- Issue
- 04
- Pages
- 804-818
- ISSN
- 0001-8678 (ISSN-L)
- OpenAlex
- W2069026191
- Cited by
- 81
- References
- 0
- FWCI
- 2.62
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Perturbation bounds for the stationary probabilities of a finite Markov chain. https://app.cochat.ai/papers/10.1017/s0001867800022941
- The paper
- Haviv, M., & der Heyden, L. V. (1984). Perturbation bounds for the stationary probabilities of a finite Markov chain. Advances in Applied Probability. https://doi.org/10.1017/s0001867800022941
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.