Stochastic Complementation, Uncoupling Markov Chains, and the Theory of Nearly Reducible Systems
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
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Since (I − Pii) −1 ≥ 0 [24] and (L + U) ≥ 0, the split- ting above is weak regular.”
From Distributed PageRank computation based on iterative aggregation-disaggregation methods (2005) · cites this paper as [24]
Citations
Cites
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280 · cited 4×
“It is well known (see [19] or [11]) that for every square matrix A and each ǫ > 0, there exists a matrix norm ||| • ||| such that ρ(A) ≤ |||A||| ≤ ρ(A) + ǫ.”
BackgroundInfluentialNonnegative Matrices in the Mathematical Sciences
(1979) · Elsevier eBooks · doi:10.1016/c2013-0-10361-3 · Cited by 5,451
Kemeny, J. G., & Snell, J. L. (1976) · Medical Entomology and Zoology · Cited by 2,813
Introduction to matrix computations
Stewart, G. W. (1973) · International Linear Collider · Cited by 2,381
Bush, K. A., Kemeny, J. G., & Snell, J. L. (1960) · The American Mathematical Monthly · doi:10.2307/2309264 · Cited by 1,546
Aggregation of Variables in Dynamic Systems
Simon, H. A., & Ando, A. (1961) · Econometrica · doi:10.2307/1909285 · Cited by 562
Aggregation of Variables in Dynamic Systems
Simon, H. A. (1977) · Boston Studies in the Philosophy of Science · doi:10.1007/978-94-010-9521-1_12 · Cited by 550 · cited 6×
“The contribution of Simon and Ando [18] was to provide mathematical arguments for what had previously been a rather heuristic theory concerning nearly completely reducible systems.”
BackgroundMethodInfluentialDecomposability: Queueing and Computer System Applications
Courtois, P. (1977) · Cited by 471
Regenerative Analysis and Steady State Distributions for Markov Chains
Grassmann, W. K., Taksar, M. I., & Heyman, D. P. (1985) · Operations Research · doi:10.1287/opre.33.5.1107 · Cited by 364 · cited 1×
“Simple forms of stochastic complementation can be found either explicitly or implicitly in a variety of Markov chain applications such as those in [1], [3]–[6], [8]–[10], [12]–[16], [20], [21], in addition to several others.”
Background
Research works printed but not linked: 3
- Balsamo S., 1988, Computer performance and reliability (Rome, 1987), 73
- Courtois P.-J., 1977, Decomposability
- Gantmacher F. R., 1960, Matrix Theory—Vol. II
Cited by
Items 201–300 of 310
Kemeny’s constant minimization for reversible Markov chains via structure-preserving perturbations
Durastante, F., Gnazzo, M., & Meini, B. (2026) · BIT Numerical Mathematics · doi:10.1007/s10543-026-01152-6 · Cited by 3
“Our comparison addresses three settings: (i) nearly reducible Markov chains [51], (ii) synthetic tests (including a scalability study as the state space grows), and (iii) reversiblechainsarisingfrompowernetworks[18].”
Gursoy, B. B., Kirkland, S., Mason, O., & Sergeev, S. (2014) · Linear Algebra and its Applications · doi:10.1016/j.laa.2014.06.028 · Cited by 3
“max algebra), but we will not give any further details on this. Let us also mention that the State Reduction algorithm can be seen as a special case of the stochastic complements technique, see Meyer [22]. The rest of the paper is organized as follows. In Section 2 we obtain the universal version of the Markov Chain T…”
MethodInfluence of the outlinks of a page on its PageRank
de Kerchove, C., Ninove, L., & Dooren, P. M. V. (2006) · Cited by 3
Efficient learning for decomposing and optimizing random networks
Li, H., Peng, Y., Xu, X., Heidergott, B., & Chen, C. (2022) · Fundamental Research · doi:10.1016/j.fmre.2022.01.018 · Cited by 3
Singularly Perturbed Markov Modulated Fluid Queues
Dendievel, S., Latouche, G., Liu, Y., & Tang, Y. (2022) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/21m1395387 · Cited by 3
Stewart, W. J. (2000) · Lecture notes in computer science · doi:10.1007/3-540-46506-5_15 · Cited by 4
“They are particularly powerful when the Markov chain is NCD — Nearly Completely Decomposable, as the partitions are chosen based on how strongly the states of the Markov chain interact with one another, [13,38].”
BackgroundUncoupling-Coupling Techniques for Metastable Dynamical Systems
Schütte, C., Forster, R., Meerbach, E., & Fischer, A. (2005) · Springer eBooks · doi:10.1007/3-540-26825-1_8 · Cited by 3
On Multivariate Markov Chains for Common and Non-Common Objects in Multiple Networks
Li, X., Li, W., Ng, M. K., & Ye, Y. (2012) · Numerical Mathematics Theory Methods and Applications · doi:10.4208/nmtma.2012.m1108 · Cited by 3
“In addition, their analysis of multivariate Markov chains of three-by-three block is based on the coupling theorem involving Schur complement in [16], and these results are also different from our results in Section 2.”
ResultP-score: a reputation bibliographic index that complements citation counts
Veneroso, J. M. D. F., Dias, M., Ueda, A., Ribas, S., Ribeiro-Neto, B. A., Ziviani, N., & Silva, E. D. S. E. (2019) · Scientometrics · doi:10.1007/s11192-019-03247-0 · Cited by 3
“Therefore, the transition matrix P is reduced to a periodic Markov chain with the following structure: From decomposition theory (Meyer 1989), we can obtain values for ranking the set of reputation sources by solving: where P� = P⟨ST⟩ × P⟨TS⟩ is a stochastic matrix and ⟨S⟩ is a row matrix with |S|…”
BackgroundFouss, F., Renders, J.-M., & Saerens, M. (2004) · Cited by 3
Edward, P. C. K., & Lin, C. (1991) · Stochastic Models · doi:10.1080/15326349108807210 · Cited by 3
Blind identification of fractionally spaced communication channels with Markov inputs
Doğançay, K., & Krishnamurthy, V. (1999) · Signal Processing · doi:10.1016/s0165-1684(99)00040-7 · Cited by 3
A Flexible Iterative Framework for Consensus ClusteringPreprint
Race, S., & Meyer, C. D. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1408.0972 · Cited by 3
Self-citationParallel computing for Markov chains with islands and ports
Basnet, A. J., & Sonin, I. M. (2017) · Annals of Operations Research · doi:10.1007/s10479-017-2727-5 · Cited by 2
“Inthe cluster-based approach, “local” characteristics of each cluster are calculated first and then are used to approximate “global” characteristics for the whole chain (see e.g. Meyer 1989).”
MethodColberg, M., & Schofield, J. (2022) · The Journal of Chemical Physics · doi:10.1063/5.0098612 · Cited by 3
Generalized Perron complements of strictly generalized doubly diagonally dominant matrices
Zhong, Q., Li, L., & Mou, G. (2025) · AIMS Mathematics · doi:10.3934/math.2025629 · Cited by 2
Identifying Failure Scenarios in Complex Systems by Perturbing Markov Chain Models
Dabrowski, C., & Hunt, F. Y. (2011) · ASME Pressure Vessels and Piping Conference (PVP) · doi:10.1115/pvp2011-57683 · Cited by 2
“Perturbation analysis of DTMCs has also been a topic of extensive theoretical [34–36] and computational study [37, 38], but for different purposes than we intend.”
BackgroundPerron Complements Of Diagonally Dominant Matrices And H-Matrices
Li, Z., Xiao, M. X., & Huang, T. (2009) · Cited by 2
Blockwise Perturbation Theory for Markov Chains
Xue, J., & Weiguo, G. (1998) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479895294629 · Cited by 2
“The stochastic complement of Pii [7] is Sii = Pii + Pi∗(I − Pi)−1P∗i, where Pi∗ is an mi × (n −mi) matrix composed of the ith row of blocks of P with Pii removed, P∗i is an (n −mi) ×mi matrix composed of the ith column of blocks of P with Pii removed, and Pi is the principal submatrix of P with the ith row and column…”
BackgroundInequalities for permanents involving Perron complements
Bapat, R. B., & Neumann, M. (2003) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(03)00533-0 · Cited by 2
A new parallel block aggregated algorithm for solving Markov chains
Touzene, A. (2012) · The Journal of Supercomputing · doi:10.1007/s11227-011-0737-7 · Cited by 2
“There are many algorithms related to NCD techniques [12, 13, 16–19], etc.”
MethodA parallel algorithm for computing the group inverse via Perron complementation
Neumann, M., & Xu, J. (2005) · Electronic Journal of Linear Algebra · doi:10.13001/1081-3810.1155 · Cited by 2
Some Recent Results on Ranking Webpages and Websites
Bao, Y., Ma, Z.-M., & Shang, Y. (2009) · Series in contemporary applied mathematics · doi:10.1142/9789812838766_0004 · Cited by 2
“Then, the N × N matrix C(α) = (cij(α)) is the transition matrix between Websites[22].”
BackgroundMethodInfluentialRanking in Dynamic Graphs Using Exponential Centrality
Nathan, E., Fairbanks, J., & Bader, D. A. (2017) · Studies in computational intelligence · doi:10.1007/978-3-319-72150-7_31 · Cited by 2
“By using exact [21] and approximate [27] aggregation techniques, they efficiently update the transition matrix after updates to the graph are made.”
MethodCluster-based network proximities for arbitrary nodal subsets
Berenhaut, K. S., Barr, P. S., Kogel, A. M., & Melvin, R. L. (2018) · Scientific Reports · doi:10.1038/s41598-018-32172-0 · Cited by 2
Infinity Learning: Learning Markov Chains from Aggregate Steady-State Observations
Gao, J., Zahran, M. A., Sheoran, A., Fahmy, S., & Ribeiro, B. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i04.5806 · Cited by 2
Updating of PageRank in Evolving Treegraphs
Abola, B., Biganda, P. S., Engström, C., Mango, J. M., Kakuba, G., & Silvestrov, S. D. (2020) · Wiley eBooks · doi:10.1002/9781119721871.ch2 · Cited by 2
Fast reactions with non-interacting species in stochastic reaction networks
Hoessly, L., & Wiuf, C. (2022) · Mathematical Biosciences & Engineering · doi:10.3934/mbe.2022124 · Cited by 2
“Watched Markov chains appear as a restriction of a bigger Markov chain, which we observe only if the chain is in a specific subset of the state space [21, 24].”
BackgroundHuang, S., & Skoglund, M. (2014) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2014.6875313 · Cited by 2
Bounding stationary results of Tandem networks with MAP input and PH service time distributions
Buchholz, P. (2006) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/1140277.1140300 · Cited by 2
“This result follows from stochastic complementation [9].”
A Direct Algorithm for Computing the Stationary Distribution of a P-Cyclic Markov Chain
Heyman, D. P. (1993) · The IMA volumes in mathematics and its applications · doi:10.1007/978-1-4613-8351-2_13 · Cited by 2
Hidden Markov model signal processing and control
Collings, I. B. (1995) · ANU Open Research (Australian National University) · doi:10.25911/5d63c183d7a2f · Cited by 2
Replacement process decomposition for discounted Markov renewal programming
Schweitzer, P. J., Sumita, U., & Ohno, K. (1991) · Annals of Operations Research · doi:10.1007/bf02283617 · Cited by 2
“This is the analogy to both the elimination-of-variables approach [15] and the stochastic complementation approach in [ 9 ].”
MethodFractionally-spaced blind channel equalisation using hidden Markov models
Krishnamurthy, V., & Doğançay, K. (2002) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1997.604771 · Cited by 2
Adaptive estimation of hidden nearly completely decomposable Markov chains
Krishnamurthy, V. (2002) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1994.389811 · Cited by 2
Cross-layer QoS provisioning in packet wireless CDMA networks
Yu, F. R., & Krishnamurthy, V. (2005) · International Conference on Communications · doi:10.1109/icc.2005.1495043 · Cited by 2
“In this paper, we show that the cross-layer CAC problem in packet CDMA networks has the nearly complete decomposability (NCD) structure, based on which we propose two CAC algorithms that require much less computation than the schemes in [4] and can have good approximation to the optimal solutions.”
InfluentialQualitative Logics and Equivalences for Probabilistic Systems
de Alfaro, L., Chatterjee, K., Faella, M., & Legay, A. (2007) · International Conference on the Quantitative Evaluation of Systems (QEST) · doi:10.1109/qest.2007.15 · Cited by 2
“When the chain is ergodic, there are strong relations with the theory of stochastic complement [6].”
Golubchik, L., & Lui, J. C. S. (2000) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/345063.339416 · Cited by 2
Markov Chains and Ranking Problems in Web Search
Ishii, H., & Tempo, R. (2013) · Springer eBooks · doi:10.1007/978-1-4471-5102-9_135-1 · Cited by 2
Lindner, I., Heidergott, B., Badri, S., & Praum, M. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4851284 · Cited by 3
Dayar, T. (2012) · SpringerBriefs in mathematics · doi:10.1007/978-1-4614-4190-8_1 · Cited by 1
Dependability Model of Electric Power Systems for Assessing Smart City Energy Sustainability
Maevsky, D. A., Kharchenko, V. S., Bardis, N. G., Stetsiuk, D., Maevskaya, E. J., & Кривда, В. І. (2026) · Sustainability · doi:10.3390/su18031512 · Cited by 1
Bebbington, M. (1997) · Parallel Computing · doi:10.1016/s0167-8191(97)89286-1 · Cited by 1
Efficient Transient Analysis of Markovian Models Using a Block Reduction Approach
Silva, E. D. S. E., Leão, R. M. M., & Marie, R. A. (2013) · INFORMS journal on computing · doi:10.1287/ijoc.1120.0537 · Cited by 1
“See Meyer (1989) for item (a).”
Stochastic Clustering: Visualization and Application.
Abbey, R. (2013) · NCSU Libraries Repository (North Carolina State University Libraries) · Cited by 1
Identification of Hidden Markov Models with Grouped State Values
Collings, I. B., & Moore, J. B. (1995) · IFAC Proceedings Volumes · doi:10.1016/s1474-6670(17)45178-0 · Cited by 1
“Much work has been carried out into grouping states associated with Markov chains (see for example, Simon and Ando (1961)).”
BackgroundMethodNonlinearly Perturbed Birth-Death-Type Semi-Markov Processes
Silvestrov, D. S., & Silvestrov, S. D. (2017) · SpringerBriefs in probability and mathematical statistics · doi:10.1007/978-3-319-60988-1_5 · Cited by 1
Examples and Survey of Applied Perturbed Stochastic Models
Silvestrov, D. S., & Silvestrov, S. D. (2017) · SpringerBriefs in probability and mathematical statistics · doi:10.1007/978-3-319-60988-1_6 · Cited by 1
Passive Crowd Speed Estimation With WiFi.
Depatla, S., & Mostofi, Y. (2017) · Cited by 1
Bounds on Biased and Unbiased Random Walks
Parry, D. T. (2009) · Rose-Hulman Scholar (Rose–Hulman Institute of Technology) · Cited by 1
Dayar, T. (2018) · Springer series in operations research/Springer series in operations research and financial engineering · doi:10.1007/978-3-319-97129-2_6 · Cited by 1
Dynamic Sampling Procedure for Decomposable Random Networks
Li, H., Peng, Y., Xu, X., Chen, C., & Heidergott, B. (2019) · Winter Simulation Conference · doi:10.1109/wsc40007.2019.9004795 · Cited by 1
A Dynamic Algorithm for Linear Algebraically Computing Nonbacktracking Walk Centrality
Nathan, E. (2021) · Studies in computational intelligence · doi:10.1007/978-3-030-65351-4_53 · Cited by 1
LN: A Meta-solver for Layered Queueing Network Analysis
Casale, G., Gao, Y., Niu, Z., & Zhu, L. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-16336-4_12 · Cited by 1
Steady-State Probability Estimation IN FSMs CONSIDERING HIGH-ORDER TEMPORAL EFFECTS
Marculescu, D., Mărculescu, R., & Pedram, M. (n.d.) · Cited by 1
R-Score: Reputation-based Scoring of Research GroupsPreprint
Ribas, S., Ribeiro-Neto, B. A., Silva, E. D. S. E., & Ziviani, N. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1308.5286 · Cited by 1
“= [ 0 P12 P21 0 ] From decomposition theory, see Meyer (1989), we can obtain values for ranking the top reference set programs by solving: γ = γP′ (8) where P′ = P12 × P21 is a stochastic matrix and γ = 〈γ1, . . . , γT 〉.”
MethodComputing the fundamental matrix for a nonirreducible Markov chain
Sheskin, T. J. (1997) · International Journal of Mathematical Education in Science and Technology · doi:10.1080/0020739970280503 · Cited by 1
A partitioning algorithm for solving systems of linear equations
Sheskin, T. J. (1996) · International Journal of Mathematical Education in Science and Technology · doi:10.1080/0020739960270502 · Cited by 1
Meo, M., Silva, E. D. S. E., & Marsan, M. A. (2001) · Performance Evaluation · doi:10.1016/s0166-5316(00)00068-7 · Cited by 1
Algebraic Multigrid for Markov Chains and Tensor Decomposition
Miller, K. (2013) · UWSpace (University of Waterloo) · Cited by 1
Predicting bifurcations of almost-invariant patterns: a set-oriented approachPreprint
Ndour, M., & Padberg‐Gehle, K. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2001.01099 · Cited by 1
“From this continuity and the fact that the Qi( ) are nearly stochastic matrices [20], we have that the spectrum of Q( ) includes three parts: (a) the Perron root λ1( ) = 1, (b) the set of k − 1 non-unit eigenvalues, {λ2( ), .”
BackgroundMarkov Chains and Ranking Problems in Web Search
Ishii, H., & Tempo, R. (2015) · Springer eBooks · doi:10.1007/978-1-4471-5058-9_135 · Cited by 1
P-score: A Publication-based Metric for Academic ProductivityPreprint
Ribas, S., Ribeiro-Neto, B. A., Silva, E. D. S. E., Ueda, A., & Ziviani, N. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1503.07496 · Cited by 1
“From decomposition theory, see [2], we can obtain values for ranking the reference groups by solving: γ = γP′ (5) where P = P12 × P21 is a stochastic matrix and γ = 〈γ1, .”
MethodReduced complexity estimation for large scale hidden Markov models
Dey, S., & Mareels, I. (2003) · European Control Conference (ECC) · doi:10.23919/ecc.2003.7086435
A Perturbation and Reduction Based Algorithm
Fourneau, J., & Mokdad, L. (1998) · Lecture notes in computer science · doi:10.1007/3-540-68061-6_12
“This method is related to the stochastic complementation theory [13] and is a generalization of the ad-hoc algorithm proposed by Robertazzi to solve Markov models of some protocols [14].”
MethodReduced complexity spatio-temporal image-based tracking for maneuvering targets
Krishnamurthy, V., & Dey, S. (2003) · International Conference on Information Fusion (FUSION) · doi:10.1109/icif.2002.1021229
Parametric convergence analysis of an aggregated Markov chain
Doğançay, K. (2010) · Adelaide Research & Scholarship (AR&S) (University of Adelaide)
Borges, C. F., & Peters, C. S. (1995) · Defense Technical Information Center (DTIC) · doi:10.21236/ada295810
Decentralized link analysis in peer-to-peer web search networks
Parreira, J. X. (2009) · Max Planck Institute for Plasma Physics · doi:10.22028/d291-25955
Borges, C. F., & Peters, C. S. (1999) · Journal of Applied Probability · doi:10.1017/s0021900200017885
On fast aggregation of Markov chain functionals using stochastic complementation
Doğançay, K., & Krishnamurthy, V. (1999) · Signal Processing · doi:10.1016/s0165-1684(98)00213-8
Stochastic complements in substochastic Matrices∗
Gibson, P. M. (1992) · Linear and Multilinear Algebra · doi:10.1080/03081089208818156
Open problems for threshold-based systems
Golubchik, L., & Lui, J. C. S. (2001) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/544397.544400
“A number of papers, corresponding to various forms of this model using a variety of solution methods, have been pub- lished on this topic, e.g., [11, 12, 15, 5, 7, 16, 6, 4, 8, 9]; many of these works have considered fairly restricted forms of the problem.”
BackgroundAn aggregation-based method for the exact analysis of a class of GI/G/1-type processes
Riska, A., Smirni, E., & Ciardo, G. (2003) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/959143.959161
Markov Chains and Ranking Problems in Web Search
Ishii, H., & Tempo, R. (2021) · Springer eBooks · doi:10.1007/978-3-030-44184-5_135
A Combinatorial Approach to Nearly Uncoupled Markov Chains
Tifenbach, R. M., & Leith, D. J. (2011) · Maynooth University ePrints and eTheses Archive (Maynooth University)
Reductibility considerations for an aggregated Markov chain
Doğançay, K. (2010) · IEEE Region 10 Conference (TENCON) · doi:10.1109/tencon.2010.5686012
“In this paper we aggregate the closed fork-join structure using stochastic complementation [6].”
MethodDayar, T. (2012) · SpringerBriefs in mathematics · doi:10.1007/978-1-4614-4190-8_5
Perron Complements of Strictly Generalized Doubly Diagonally Dominant Matrices
Li, Z., Xiao, M., & Huang, T. (2010) · Journal of Information and Computing Science · doi:10.4208/jics.v5.n4.p261
“Meyer [2] [3] has derived several interesting and useful properties of And such matrices arise in a variety of applications [9] , have been studied most of the 20th century, and have received increasing attention of late (see [4] [5]).”
Silvestrov, D. S., & Silvestrov, S. D. (2017) · SpringerBriefs in probability and mathematical statistics · doi:10.1007/978-3-319-60988-1_2
Reducibility Considerations for An Aggregated
gancay, K. D. ̆. (2010)
Queuing models for cellular networks with generalised Erlang service distributions
Jayasuriya, A. (2003) · Journal of Telecommunications and Information Technology · doi:10.26636/jtit.2003.2.170
“(14) by decoupling an irreducible large Markov chain into smaller irreducible Markov chains [7, 8].”
BackgroundRandom Surfing Revisited: Generalizing PageRank's Teleportation ModelPreprint
Νικολακόπουλος, Α. Ν. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.12916
“Below we present the basic definitions and theorems behind stochastic complementation adopting the notation used by Meyer in [62].”
BackgroundMethodInfluentialModel Checking by Censoring Markov Chains and Stochastic Comparison
Pekergin, N., & Younès, S. (2009)
Rebaza, J. (2012) · Wiley eBooks · doi:10.1002/9781118277188.refs
Dayar, T. (2012) · SpringerBriefs in mathematics · doi:10.1007/978-1-4614-4190-8_6
Kilmer, M. E., & O’Leary, D. P. (2010) · Birkhäuser Boston eBooks · doi:10.1007/978-0-8176-4968-5_11
Johnson, C. R., Smith, R. L., & Tsatsomeros, M. J. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108778619.001
Johnson, C. R., Smith, R. L., & Tsatsomeros, M. J. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108778619.002
Dayar, T. (2012) · SpringerBriefs in mathematics · doi:10.1007/978-1-4614-4190-8_4
Dayar, T. (2012) · SpringerBriefs in mathematics · doi:10.1007/978-1-4614-4190-8_2
Johnson, C. R., Smith, R. L., & Tsatsomeros, M. J. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108778619.004
Johnson, C. R., Smith, R. L., & Tsatsomeros, M. J. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108778619.007
Johnson, C. R., Smith, R. L., & Tsatsomeros, M. J. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108778619.006
Silvestrov, D. S., & Silvestrov, S. D. (2017) · SpringerBriefs in probability and mathematical statistics · doi:10.1007/978-3-319-60988-1_1
Johnson, C. R., Smith, R. L., & Tsatsomeros, M. J. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108778619.005
Johnson, C. R., Smith, R. L., & Tsatsomeros, M. J. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108778619.003
Dayar, T. (2012) · SpringerBriefs in mathematics · doi:10.1007/978-1-4614-4190-8_3
Johnson, C. R., Smith, R. L., & Tsatsomeros, M. J. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108778619.008
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.