On the public citation graph

Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by Decomposition

0 signed · 129 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-94-010-9521-1_12openalex-snapshot
Aggregation of Variables in Dynamic Systems
inferredcites →https://doi.org/10.1016/0024-3795(69)90031-7openalex-snapshot
Abschätzungen für die eigenwerte positiver linearer operatoren
inferredcites →https://doi.org/10.1016/0024-3795(85)90094-1openalex-snapshot
On polyhedra of Perron-Frobenius eigenvectors
inferredcites →https://doi.org/10.1016/b978-0-12-092250-5.50009-6openalex-snapshot
NONNEGATIVE MATRICES
inferredcites →https://doi.org/10.1016/b978-0-12-092250-5.50011-4openalex-snapshot
SYMMETRIC NONNEGATIVE MATRICES
inferredcites →https://doi.org/10.1016/c2013-0-10361-3openalex-snapshot
Nonnegative Matrices in the Mathematical Sciences
inferredcites →https://doi.org/10.1145/322374.322377openalex-snapshot
Computable Error Bounds for Aggregated Markov Chains
inferredcites →https://doi.org/10.2307/1909285openalex-snapshot
Aggregation of Variables in Dynamic Systems
inferredcites →https://doi.org/10.2307/1913078openalex-snapshot
Error Analysis in Nearly-Completely Decomposable Stochastic Systems
inferredcites →https://doi.org/10.2307/2982422openalex-snapshot
Markov Chains with Stationary Transition Probabilities.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/0471200581.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/0471791571.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/9780470611647.ch18openalex-snapshot
Performance Evaluation in Manufacturing Systems
inferred← citeshttps://doi.org/10.1002/nla.792openalex-snapshot
Bounding reward measures of Markov models using the Markov decision processes
inferred← citeshttps://doi.org/10.1002/nla.795openalex-snapshot
Bounding the equilibrium distribution of Markov population models
inferred← citeshttps://doi.org/10.1007/11549970_8openalex-snapshot
Bounds for Point and Steady-State Availability: An Algorithmic Approach Based on Lumpability and Stochastic Ordering
inferred← citeshttps://doi.org/10.1007/3-540-45798-4_4openalex-snapshot
An Algorithmic Approach to Stochastic Bounds
inferred← citeshttps://doi.org/10.1007/3-540-55676-1_16openalex-snapshot
Hierarchical solution of generalized Stochastic Petri Nets by means of traffic processes
inferred← citeshttps://doi.org/10.1007/3-540-56320-2_51openalex-snapshot
System dependability
inferred← citeshttps://doi.org/10.1007/978-1-4471-4594-3_12openalex-snapshot
Computing Entry-Wise Bounds of the Steady-State Distribution of a Set of Markov Chains
inferred← citeshttps://doi.org/10.1007/978-1-4612-1782-4_13openalex-snapshot
Error Bounds for a Stiff Markov Chain Approximation Technique and an Application
inferred← citeshttps://doi.org/10.1007/978-1-4614-4190-8_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-1-4614-4190-8_2openalex-snapshot
Preliminaries
inferred← citeshttps://doi.org/10.1007/978-1-4614-4190-8_3openalex-snapshot
Iterative Methods
inferred← citeshttps://doi.org/10.1007/978-1-4614-4190-8_4openalex-snapshot
Decompositional Methods
inferred← citeshttps://doi.org/10.1007/978-1-4614-4190-8_5openalex-snapshot
Matrix-Analytic Methods
inferred← citeshttps://doi.org/10.1007/978-1-4614-4190-8_6openalex-snapshot
Conclusion
inferred← citeshttps://doi.org/10.1007/978-1-4615-0805-2_4openalex-snapshot
Singular Perturbations of Markov Chains and Decision Processes
inferred← citeshttps://doi.org/10.1007/978-1-4615-2241-6_18openalex-snapshot
Two Bounding Schemes for the Steady-State Solution of Markov Chains
inferred← citeshttps://doi.org/10.1007/978-1-4757-4828-4_4openalex-snapshot
Numerical Methods for Computing Stationary Distributions of Finite Irreducible Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-032-35298-9_1openalex-snapshot
Stationary and Transient Bounds for Nearly Lumpable or Uncertain Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-319-01604-7_7openalex-snapshot
Computing Bounds of the MTTF for a Set of Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-319-24877-6openalex-snapshot
Markov Chain Aggregation for Agent-Based Models
inferred← citeshttps://doi.org/10.1007/978-3-319-24877-6_2openalex-snapshot
Background and Concepts
inferred← citeshttps://doi.org/10.1007/978-3-319-42105-6_10openalex-snapshot
Asymptotic Expansions for Stationary Distributions of Perturbed Semi-Markov Processes
inferred← citeshttps://doi.org/10.1007/978-3-319-66583-2_2openalex-snapshot
Bounded Aggregation for Continuous Time Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-3-319-97129-2_6openalex-snapshot
Steady-State Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-75211-0_16openalex-snapshot
Censoring Markov Chains and Stochastic Bounds
inferred← citeshttps://doi.org/10.1007/978-3-642-30782-9_15openalex-snapshot
Lumping and Reversed Processes in Cooperating Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-39408-9_27openalex-snapshot
Efficient Steady State Analysis of Multimodal Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-642-76923-8_7openalex-snapshot
Literatur
inferred← citeshttps://doi.org/10.1007/978-3-642-79789-7_28openalex-snapshot
Computable Dependability Bounds for Large Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-642-87472-7_1openalex-snapshot
Analysis of Large Markovian Models by Parts. Applications to Queueing Network Models
inferred← citeshttps://doi.org/10.1007/978-3-7091-9396-9_38openalex-snapshot
Improving Availability Bounds using the Failure Distance Concept
inferred← citeshttps://doi.org/10.1007/bf02031594openalex-snapshot
Guaranteed approximation of Markov chains with applications to multiplexer engineering in ATM networks
inferred← citeshttps://doi.org/10.1007/bfb0024315openalex-snapshot
A new iterative method for solving Large-Scale Markov chains
inferred← citeshttps://doi.org/10.1007/s10479-014-1694-3openalex-snapshot
Lumping and reversed processes in cooperating automata
inferred← citeshttps://doi.org/10.1007/s11227-011-0737-7openalex-snapshot
A new parallel block aggregated algorithm for solving Markov chains
inferred← citeshttps://doi.org/10.1016/0024-3795(85)90094-1openalex-snapshot
On polyhedra of Perron-Frobenius eigenvectors
inferred← citeshttps://doi.org/10.1016/0024-3795(86)90214-4openalex-snapshot
Block iterative algorithms for stochastic matrices
inferred← citeshttps://doi.org/10.1016/0165-6074(90)90007-vopenalex-snapshot
Dependability analysis of fault-tolerant systems: a literature survey
inferred← citeshttps://doi.org/10.1016/0166-5316(91)90058-bopenalex-snapshot
Optimal routing for closed queueing networks
inferred← citeshttps://doi.org/10.1016/0166-5316(92)90003-yopenalex-snapshot
Performability analysis of computer systems: from model specification to solution
inferred← citeshttps://doi.org/10.1016/0166-5316(94)90015-9openalex-snapshot
Bounds for quasi-lumpable Markov chains
inferred← citeshttps://doi.org/10.1016/0305-0548(93)90107-topenalex-snapshot
Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques
inferred← citeshttps://doi.org/10.1016/j.ejor.2001.09.001openalex-snapshot
Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.08.016openalex-snapshot
Sub-stochastic matrix analysis for bounds computation—Theoretical results
inferred← citeshttps://doi.org/10.1016/j.orl.2010.08.004openalex-snapshot
An embedded Markov chain approach to stock rationing
inferred← citeshttps://doi.org/10.1016/j.orl.2018.12.007openalex-snapshot
An embedded Markov chain approach to stock rationing under batch orders
inferred← citeshttps://doi.org/10.1016/j.peva.2005.07.002openalex-snapshot
An improved method for bounding stationary measures of finite Markov processes
inferred← citeshttps://doi.org/10.1016/j.peva.2023.102356openalex-snapshot
Efficient and accurate Lyapunov function-based truncation technique for multi-dimensional Markov chains with applications to discriminatory processor sharing and priority queues
inferred← citeshttps://doi.org/10.1016/j.thbio.2004.04.001openalex-snapshot
Simon?Ando decomposability and fitness landscapes
inferred← citeshttps://doi.org/10.1016/s0166-5316(02)00123-2openalex-snapshot
An iterative bounding method for stochastic automata networks
inferred← citeshttps://doi.org/10.1016/s0166-5316(98)00015-7openalex-snapshot
Tight steady-state availability bounds using the failure distance concept
inferred← citeshttps://doi.org/10.1016/s0166-5316(99)00002-4openalex-snapshot
Bounding steady-state availability models with group repair and phase type repair distributions
inferred← citeshttps://doi.org/10.1017/cbo9781139051705openalex-snapshot
Markov Chains and Dependability Theory
inferred← citeshttps://doi.org/10.1017/s0001867800010910openalex-snapshot
Markovian bounds on functions of finite Markov chains
inferred← citeshttps://doi.org/10.1017/s0001867800028354openalex-snapshot
Near Complete Decomposability: Bounding the Error by a Stochastic Comparison Method
inferred← citeshttps://doi.org/10.1017/s0021900200039085openalex-snapshot
Geometric bounds on iterative approximations for nearly completely decomposable Markov chains
inferred← citeshttps://doi.org/10.1017/s0021900200044880openalex-snapshot
Homogeneous Markov chains by bounded transition matrix
inferred← citeshttps://doi.org/10.1017/s0021900200107338openalex-snapshot
Exact and ordinary lumpability in finite Markov chains
inferred← citeshttps://doi.org/10.1017/s0269964800001479openalex-snapshot
A New Algorithm for Computing the Ergodic Probability Vector for Large Markov Chains
inferred← citeshttps://doi.org/10.1017/s0269964807070155openalex-snapshot
GENERALIZED CLASS [Cscr ] MARKOV CHAINS AND COMPUTATION OF CLOSED-FORM BOUNDING DISTRIBUTIONS
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.1080/15326348908807099openalex-snapshot
Lumpability and time reversibility in the aggregation-disaggregation method for large markov chains
inferred← citeshttps://doi.org/10.1080/15326348908807115openalex-snapshot
Numerical solution of sparse singular systems of equations arising from ergodic markov chains
inferred← citeshttps://doi.org/10.1109/12.40849openalex-snapshot
Bounding availability of repairable systems
inferred← citeshttps://doi.org/10.1109/12.467696openalex-snapshot
Refinable bounds for large Markov chains
inferred← citeshttps://doi.org/10.1109/12.926156openalex-snapshot
Bound computation of dependability and performance measures
inferred← citeshttps://doi.org/10.1109/21.364840openalex-snapshot
Problem formalization techniques for collaborative systems
inferred← citeshttps://doi.org/10.1109/26.241744openalex-snapshot
Analysis of the semisynchronous carrier sense multiple access on the bus topology
inferred← citeshttps://doi.org/10.1109/26.297853openalex-snapshot
A decomposition approximation for the analysis of voice/data integration
inferred← citeshttps://doi.org/10.1109/32.232014openalex-snapshot
LISPACK-a methodology and tool for the performance analysis of parallel systems and algorithms
inferred← citeshttps://doi.org/10.1109/90.251897openalex-snapshot
A histogram-based model for video traffic behavior in an ATM multiplexer
inferred← citeshttps://doi.org/10.1109/cmpeur.1991.257437openalex-snapshot
The complexity of performance analysis in parallel algorithms and systems
inferred← citeshttps://doi.org/10.1109/hicss.1993.284195openalex-snapshot
Problem characteristics for task sharing in collaborative systems
inferred← citeshttps://doi.org/10.1109/hicss.2002.994024openalex-snapshot
Modelling resource management for multi-class traffic in mobile cellular networks
inferred← citeshttps://doi.org/10.1109/infcom.1993.253289openalex-snapshot
Guaranteed bounds for steady state performance measures of a Markov chain with applications to high speed data networks
inferred← citeshttps://doi.org/10.1109/ipds.1995.395814openalex-snapshot
Lumpability and nearly-lumpability in hierarchical queueing networks
inferred← citeshttps://doi.org/10.1109/ipds.1996.540219openalex-snapshot
Bounding asymptotic dependability and performance measures
inferred← citeshttps://doi.org/10.1109/ipds.1998.707728openalex-snapshot
Bounding steady-state availability models with phase type repair distributions
inferred← citeshttps://doi.org/10.1109/iwast.2009.5069040openalex-snapshot
The automated generation of test cases using an extended domain based reliability model
inferred← citeshttps://doi.org/10.1109/jsac.1986.1146398openalex-snapshot
Computable Bounds for Conditional Steady-State Probabilities in Large Markov Chains and Queueing Models
inferred← citeshttps://doi.org/10.1109/mascot.1995.378697openalex-snapshot
An eclectic survey of bounding methods for Markov chain models
inferred← citeshttps://doi.org/10.1109/mwscas.1989.101817openalex-snapshot
On bounds for token probabilities in a class of generalized stochastic Petri nets
inferred← citeshttps://doi.org/10.1109/ngi.2006.1678219openalex-snapshot
Dependability modelling and analysis of networks as taking routing and traffic into account
inferred← citeshttps://doi.org/10.1109/pnpm.1989.68555openalex-snapshot
On bounds for token probabilities in a class of generalized stochastic Petri nets
inferred← citeshttps://doi.org/10.1109/pnpm.1991.238783openalex-snapshot
Subnetwork time distributions as a means for multilevel evaluation of generalized stochastic Petri nets
inferred← citeshttps://doi.org/10.1109/qest.2006.8openalex-snapshot
Bound-Preserving Composition for Markov Reward Models
inferred← citeshttps://doi.org/10.1109/qest.2012.17openalex-snapshot
Aggregation of Markovian Models -- An Alternating Least Squares Approach
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.1109/spdp.1993.395541openalex-snapshot
Solving Markov chains using bounded aggregation on a massively parallel processor
inferred← citeshttps://doi.org/10.1109/tc.1986.1676840openalex-snapshot
An Aggregation Technique for the Transient Analysis of Stiff Markov Chains
inferred← citeshttps://doi.org/10.1137/0607064openalex-snapshot
An Approximation to the Stationary Distribution of a Nearly Completely Decomposable Markov Chain and Its Error Bound
inferred← citeshttps://doi.org/10.1137/0607065openalex-snapshot
An Approximation to the Stationary Distribution of a Nearly Completely Decomposable Markov Chain and Its Error Analysis
inferred← citeshttps://doi.org/10.1137/0614075openalex-snapshot
On the Sensitivity of the Solution of Nearly Uncoupled Markov Chains
inferred← citeshttps://doi.org/10.1137/19m1289625openalex-snapshot
Stationary Distributions of Continuous-Time Markov Chains: A Review of Theory and Truncation-Based Approximations
inferred← citeshttps://doi.org/10.1137/s0895479895294277openalex-snapshot
Quasi Lumpability, Lower-Bounding Coupling Matrices, and Nearly Completely Decomposable Markov Chains
inferred← citeshttps://doi.org/10.1142/9781860948947_0010openalex-snapshot
Stochastic Automata Networks and Lumpable Stochastic Bounds: Bounding Availability
inferred← citeshttps://doi.org/10.1145/1140103.1140300openalex-snapshot
Bounding stationary results of Tandem networks with MAP input and PH service time distributions
inferred← citeshttps://doi.org/10.1145/1140277.1140300openalex-snapshot
Bounding stationary results of Tandem networks with MAP input and PH service time distributions
inferred← citeshttps://doi.org/10.1145/1190366.1190368openalex-snapshot
Conditional steady-state bounds for a subset of states in Markov chains
inferred← citeshttps://doi.org/10.1145/1190366.1190369openalex-snapshot
Bounds based on lumpable matrices for partially ordered state space
inferred← citeshttps://doi.org/10.1145/133057.133100openalex-snapshot
State space exploration in Markov models
inferred← citeshttps://doi.org/10.1145/143242.143340openalex-snapshot
LISA: A new symbolic package for the definition, analysis and resolution of Markovian processes
inferred← citeshttps://doi.org/10.1145/149439.133100openalex-snapshot
State space exploration in Markov models
inferred← citeshttps://doi.org/10.1145/179812.179848openalex-snapshot
Computing bounds on steady state availability of repairable computer systems
inferred← citeshttps://doi.org/10.1145/233008.233049openalex-snapshot
Efficient exploration of availability models guided by failure distances
inferred← citeshttps://doi.org/10.1145/3812.3814openalex-snapshot
On time and space decomposition of complex structures
inferred← citeshttps://doi.org/10.1145/75108.75376openalex-snapshot
Bounding availability of repairable computer systems
inferred← citeshttps://doi.org/10.1145/75372.75376openalex-snapshot
Bounding availability of repairable computer systems
inferred← citeshttps://doi.org/10.1147/rd.322.0268openalex-snapshot
An analysis of hardware and software availability exemplified on the IBM 3725 Communication Controller
inferred← citeshttps://doi.org/10.1155/2010/659432openalex-snapshot
Exact Decomposition Approaches for Markov Decision Processes: A Survey
inferred← citeshttps://doi.org/10.1239/aap/999188326openalex-snapshot
Markovian bounds on functions of finite Markov chains
inferred← citeshttps://doi.org/10.1287/moor.1110.0533openalex-snapshot
Comparing Markov Chains: Aggregation and Precedence Relations Applied to Sets of States, with Applications to Assemble-to-Order Systems
inferred← citeshttps://doi.org/10.4204/eptcs.154.7openalex-snapshot
Model Checking CSL for Markov Population Models
inferred← citeshttps://doi.org/10.48550/arxiv.1007.3130openalex-snapshot
Bounding the Equilibrium Distribution of Markov Population Models
inferred← citeshttps://doi.org/10.70675/3c7100e4z6476z4bf6za209z2f51e9e9756aopenalex-snapshot
Chaînes de Markov Incomplètement spécifiées : analyse par comparaison stochastique et application à l'évaluation de performance des réseaux
inferred← citeshttps://doi.org/10.70675/69cf0cdcz7c29z45d1za018za4deb26626cbopenalex-snapshot
Assessment of reliability indicators from automatically generated partial Markov chains
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.