On the public citation graph
On the Sensitivity of the Solution of Nearly Uncoupled Markov Chains
0 signed · 25 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4612-4438-7_1openalex-snapshot
Matrix Perturbation Theory
inferredcites →https://doi.org/10.1007/bf01385767openalex-snapshot
On a direct method for the solution of nearly uncoupled Markov chains
inferredcites →https://doi.org/10.1016/0024-3795(86)90210-7openalex-snapshot
Sensitivity of the stationary distribution vector for an ergodic Markov chain
inferredcites →https://doi.org/10.1016/c2013-0-10361-3openalex-snapshot
Nonnegative Matrices in the Mathematical Sciences
inferredcites →https://doi.org/10.1017/s0021900200110083openalex-snapshot
Perturbation theory and finite Markov chains
inferredcites →https://doi.org/10.1137/0601031openalex-snapshot
The Condition of a Finite Markov Chain and Perturbation Bounds for the Limiting Probabilities
inferredcites →https://doi.org/10.1137/0607031openalex-snapshot
Using the QR Factorization and Group Inversion to Compute, Differentiate, and Estimate the Sensitivity of Stationary Probabilities for Markov Chains
inferredcites →https://doi.org/10.1137/0607065openalex-snapshot
An Approximation to the Stationary Distribution of a Nearly Completely Decomposable Markov Chain and Its Error Analysis
inferredcites →https://doi.org/10.1137/0724062openalex-snapshot
Aggregation/Disaggregation Methods for Computing the Stationary Distribution of a Markov Chain
inferredcites →https://doi.org/10.1145/1634.1637openalex-snapshot
Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by Decomposition
inferredcites →https://doi.org/10.1145/322374.322377openalex-snapshot
Computable Error Bounds for Aggregated Markov Chains
inferredcites →https://doi.org/10.1145/3828.214137openalex-snapshot
Iterative aggregation/disaggregation techniques for nearly uncoupled markov chains
inferredcites →https://doi.org/10.2307/1909285openalex-snapshot
Aggregation of Variables in Dynamic Systems
inferredcites →https://doi.org/10.2307/2004116openalex-snapshot
A Survey of Matrix Theory and Matrix Inequalities
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf01385739openalex-snapshot
Perturbation results for nearly uncoupled Markov chains with applications to iterative methods
inferred← citeshttps://doi.org/10.1016/j.laa.2003.12.019openalex-snapshot
A direct projection method for Markov chains
inferred← citeshttps://doi.org/10.1016/s0024-3795(00)00280-9openalex-snapshot
Blockwise perturbation theory for nearly uncoupled Markov chains and its application
inferred← citeshttps://doi.org/10.1063/1.4972739openalex-snapshot
Asymptotic expansions for stationary and quasi-stationary distributions of perturbed semi-Markov processes
inferred← citeshttps://doi.org/10.1063/5.0025174openalex-snapshot
Optimal dimensionality reduction of Markov chains using graph transformation
inferred← citeshttps://doi.org/10.1103/physreve.104.015301openalex-snapshot
Numerical analysis of first-passage processes in finite Markov chains exhibiting metastability
inferred← citeshttps://doi.org/10.1109/smrlo.2016.18openalex-snapshot
Asymptotic Expansions for Stationary Distributions of Perturbed Semi-Markov Processes
inferred← citeshttps://doi.org/10.1137/s0895479801387279openalex-snapshot
Inverse Forms of Hadamard Inequality
inferred← citeshttps://doi.org/10.1137/s0895479892237562openalex-snapshot
Uniform Stability of Markov Chains
inferred← citeshttps://doi.org/10.1137/s0895479895294629openalex-snapshot
Blockwise Perturbation Theory for Markov Chains
inferred← citeshttps://doi.org/10.1186/1029-242x-2013-460openalex-snapshot
On improvements of Fischer’s inequality and Hadamard’s inequality for K 0 -matrices
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.