A Generalized Fundamental Matrix for Computing Fundamental Quantities of Markov Systems
Li Xia, Peter W. Glynn

TL;DR
This paper introduces a generalized fundamental matrix for Markov systems that allows computation of key quantities like steady state distribution and performance potentials without pre-computing the steady state, enhancing efficiency.
Contribution
The paper proposes a new generalized fundamental matrix $(I - P + e r)^{-1}$ that simplifies the calculation of steady state and performance metrics in Markov systems.
Findings
Allows direct computation of steady state distribution from the generalized matrix
Enables efficient calculation of performance potentials and Q-factors
Provides insights for improved performance optimization in Markov systems
Abstract
As is well known, the fundamental matrix plays an important role in the performance analysis of Markov systems, where is the transition probability matrix, is the column vector of ones, and is the row vector of the steady state distribution. It is used to compute the performance potential (relative value function) of Markov decision processes under the average criterion, such as where is the column vector of performance potentials and is the column vector of reward functions. However, we need to pre-compute before we can compute . In this paper, we derive a generalization version of the fundamental matrix as , where can be any given row vector satisfying . With this generalized fundamental matrix, we can compute . The steady…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Advanced Queuing Theory Analysis · Bayesian Modeling and Causal Inference
