Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques
type: Item
instance of: scholarly article
title: Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques
zbMATH Open document ID: 0781.60054
DOI: 10.1016/0305-0548(93)90107-T
author: David F. Rogers
author: Robert D. Plante
published in: Computers \& Operations Research
publication date: 1994-01-02T00:00:00Z
Mathematics Subject Classification ID: 60J10
zbMATH DE Number: 474871
zbMATH Keywords: Markov chains
zbMATH Keywords: clustering algorithms
zbMATH Keywords: band diagonal Markov chains
zbMATH Keywords: manpower planning
MaRDI profile type: Publication
cites work: An Iterative Aggregation Procedure for Markov Decision Processes
cites work: Q4054519
cites work: Printer graphics for clustering
cites work: Q3875132
cites work: Q3707148
cites work: Q3707948
cites work: Q4039719
cites work: Fundamental Queries in Aggregation Theory
cites work: Aggregation and Disaggregation Techniques and Methodology in Optimization
cites work: Finite Continuous Time Markov Chains
cites work: Dynamic Inference
cites work: A Markovian Function of a Markov Chain
cites work: Q3282340
cites work: Q5723526
cites work: Collapsed Markov Chains and the Chapman-Kolmogorov Equation
cites work: Functions of Finite Markov Chains
cites work: Sufficient Conditions for a Stationary Process to be a Function of a Finite Markov Chain
cites work: Exchangeable Processes which are Functions of Stationary Markov Chains
cites work: On Stochastic Processes Derived From Markov Chains
cites work: Identification of State-calculable Functions of Finite Markov Chains
cites work: Two Problems in Markov Chains: A Topological Approach
cites work: Functions of Semi-Markov Processes
cites work: Lumpability for non-irreducible finite markov chains
cites work: First passage times and lumpability of semi-Markov processes
cites work: Q4164132
cites work: An Approximate Test of Markov Chain Lumpability
cites work: Weak lumpability in finite Markov chains
cites work: On weak lumpability in Markov chains
cites work: Moments in Markovian systems with lumped states
cites work: Statistical inference for Markov chains with lumped states
cites work: Q4158354
cites work: Q5369168
cites work: On aggregated Markov processes
cites work: Aggregation of Variables in Dynamic Systems
cites work: Stochastic Complementation, Uncoupling Markov Chains, and the Theory of Nearly Reducible Systems
cites work: Error Analysis in Nearly-Completely Decomposable Stochastic Systems
cites work: Q4144754
cites work: Approximation of eigencharacteristics in nearly-completely decomposable stochastic systems
cites work: Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by Decomposition
cites work: Q3783531
cites work: An Approximation to the Stationary Distribution of a Nearly Completely Decomposable Markov Chain and Its Error Bound
cites work: An Approximation to the Stationary Distribution of a Nearly Completely Decomposable Markov Chain and Its Error Analysis
cites work: A singular perturbation approach to modeling and control of Markov chains
cites work: Hierarchical aggregation of singularly perturbed finite state markov processes
cites work: Hierarchical aggregation of linear systems with multiple time scales
cites work: Optimal control of Markov chains admitting strong and weak interactions
cites work: A Reduction Process for Perturbed Markov Chains
cites work: The reduction of perturbed Markov generators
cites work: Multiple time scale decomposition of discrete time Markov chains
cites work: Computable Error Bounds for Aggregated Markov Chains
cites work: Exact Aggregation in Exponential Queueing Networks
cites work: Aggregation with an error of O (ε 2 )
cites work: Equivalence and decomposition in queueing systems—A unified approach
cites work: A Queueing System with Auxiliary Servers
cites work: A Queueing System with General-Use and Limited-Use Servers
cites work: Q3765615
cites work: Iterative Methods for Computing Stationary Distributions of Nearly Completely Decomposable Markov Chains
cites work: Iterative aggregation/disaggregation techniques for nearly uncoupled markov chains
cites work: Lumpability and time reversibility in the aggregation-disaggregation method for large markov chains
cites work: Iterative Aggregation-Disaggregation Procedures for Discounted Semi-Markov Reward Processes
cites work: Posterior bounds on the equilibrium distribution of a finite markov chain
cites work: A Method to Calculate Steady-State Distributions of Large Markov Chains by Aggregating States
cites work: Methods of aggregation

Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques (cites work)
cites work: Acceleration by aggregation of successive approximation methods

Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques (cites work)
cites work: Aggregation/Disaggregation Methods for Computing the Stationary Distribution of a Markov Chain

Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques (cites work)
cites work: More on Rayleigh–Ritz Refinement Technique for Nearly Uncoupled Stochastic Matrices

Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques (cites work)
cites work: A local convergence proof for the iterative aggregation method

Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques (cites work)
cites work: Q3795523

Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques (cites work)
cites work: Adaptive aggregation methods for infinite horizon dynamic programming

Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques (cites work)
cites work: Perturbation Theory and Undiscounted Markov Renewal Programming

Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques (cites work)
cites work: Q3976662

Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques (cites work)
cites work: Approximations of Dynamic Programs, I

Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques (cites work)
cites work: Approximations of Dynamic Programs, II

Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques (cites work)
cites work: Q5646157

Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques (cites work)
cites work: Q5615108

Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques (cites work)
cites work: The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach

Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques (full work available at URL)
full work available at URL: 0305-0548(93)90107-t

Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques (OpenAlex ID)
OpenAlex ID: W2065539760