CoChat

Stochastic Complementation, Uncoupling Markov Chains, and the Theory of Nearly Reducible Systems

Meyer, Carl D. · 1989 · SIAM Review

The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.

Abstract

A concept called stochastic complementation is an idea which occurs naturally, although not always explicitly, in the theory and application of finite Markov chains. This paper brings this idea to the forefront with an explicit definition and a development of some of its properties. Applications of stochastic complementation are explored with respect to problems involving uncoupling procedures in the theory of Markov chains. Furthermore, the role of stochastic complementation in the development of the classical Simon–Ando theory of nearly reducible system is presented

Overview

Integrity signals

Registry

Crossref · 10.1137/1031050

Cites

22 of 22 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 22 references

Research works printed but not linked: 3

  1. Balsamo S., 1988, Computer performance and reliability (Rome, 1987), 73
  2. Courtois P.-J., 1977, Decomposability
  3. Gantmacher F. R., 1960, Matrix Theory—Vol. II

Cited by

Items 101–200 of 310

Metadata

Authors
Meyer, C. D.
Corresponding author
Meyer, Carl D.
Venue
SIAM Review
Published
1989-06
Volume
31
Issue
2
Pages
240-272
ISSN
  • 0036-1445 (ISSN-L)
  • 1095-7200
OpenAlex
W2042624802
Cited by
316
References
21
Citations by year
2026: 2 · 2025: 4 · 2024: 3 · 2023: 4 · 2022: 7 · 2021: 14 · 2020: 17 · 2019: 12 · 2018: 6 · 2017: 14 · 2016: 8 · 2015: 8 · 2014: 9 · 2013: 15 · 2012: 18
FWCI
3.53
Type
journal article
Language
en
Open access
closed
Locations
SIAM Review (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
  • Physical Sciences › Mathematics › Statistics and Probability › Probability and Statistical Research
  • Physical Sciences › Mathematics › Mathematical Physics › Mathematical Dynamics and Fractals
Keywords
finite Markov chains, Markov chain decomposition, stochastic matrices

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

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.