Clusters in Markov chains via singular vectors of Laplacian matrices
نویسندگان
چکیده
Suppose that T is a stochastic matrix. We propose an algorithm for identifying clusters in the Markov chain associated with T. The recursive nature, and order to identify clusters, it uses sign pattern of left singular vector second smallest value Laplacian matrix I−T. prove number results justify algorithm's approach, illustrate performance several numerical examples.
منابع مشابه
On Clusters in Markov Chains
Motivated by the computational difficulty of analyzing very large Markov chains, we define a notion of clusters in (not necessarily reversible) Markov chains, and explore the possibility of analyzing a cluster “in vitro,” without regard to the remainder of the chain. We estimate the stationary probabilities of the states in the cluster using only transition information for these states, and bou...
متن کاملFinding Generators for Markov Chains via Empirical Transition Matrices
In this paper we identify conditions under which a true generator does or does not exist for an empirically observed Markov transition matrix. We show how to search for valid generators and choose the \correct" one that is the most compatible with bond rating behaviors. We also show how to obtain an approximate generator when a true generator does not exist.
متن کاملEmpirical Bayes Estimation in Nonstationary Markov chains
Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical Bayes estimators for the transition probability matrix of a finite nonstationary Markov chain. The data are assumed to be of a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...
متن کاملTransition Effect Matrices and Quantum Markov Chains
A transition effect matrix (TEM) is a quantum generalization of a classical stochastic matrix. By employing a TEM we obtain a quantum generalization of a classical Markov chain. We first discuss state and operator dynamics for a quantum Markov chain. We then consider various types of TEMs and vector states. In particular, we study invariant, equilibrium and singular vector states and investigat...
متن کاملExit Frequency Matrices for Finite Markov Chains
Consider a finite irreducible Markov chain on state space S with transition matrix M and stationary distribution π. Let R be the diagonal matrix of return times, Rii = 1/πi. Given distributions σ, τ and k ∈ S, the exit frequency xk(σ, τ) denotes the expected number of times a random walk exits state k before an optimal stopping rule from σ to τ halts the walk. For a target distribution τ , we d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2023
ISSN: ['1873-1856', '0024-3795']
DOI: https://doi.org/10.1016/j.laa.2022.11.015