How Can Markov Models Be Used to Compare Transition State Matrices?

  • Thread starter Thread starter fsteveb
  • Start date Start date
  • Tags Tags
    Compare Matrices
AI Thread Summary
Markov models can effectively compare transition state matrices, but challenges arise due to the zero element in the 4x4 matrices. Averaging the diagonal elements is insufficient as it discards valuable data from the other matrix elements. The determinant is also not a viable option due to its sensitivity to single value changes. Eigenvalues and eigenvectors are suggested as a more reliable method for comparison, particularly when there are no absorbing states. Utilizing these mathematical concepts can provide a clearer understanding of the similarities between the transition state matrices.
fsteveb
Messages
3
Reaction score
0
I have a problem where I get 3 or 4x4 matrices and I'd like to compare them. The matrices are transition states so markov models are applicable, but I can't find anything about how to compare the matrices for similarity. One solution that has been done is to agv the diagonal, but since the 4,4 element is always zero, your only using 3 numbers of the 16 and throwing the rest away. The determinant has no correlation between the system so can't be used since it is too affected by single value changes. Does anyone know of another method I might be able to use?
Steve Brailsford
 
Physics news on Phys.org
I would use eigenvalues. If the processes don't have any absorbing states then the eigenvectors corresponding to eigenvector 1 is the stationary state.
 

Thread 'Deductive proof in logic formal systems'

I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
View full post »

Similar threads

The infinite limits of the probability transition matrix for Markov chain
Replies
24
Views
4K
Can any one clear me the concept of hidden markov model?
Replies
2
Views
2K
Can you Combinie two transition probability matrices?
2
Replies
65
Views
19K
Understanding Conditional Expectation, Variance, and Precision Matrices
Replies
0
Views
763
MHB How Can Uniform Random Variables Simulate a Markov Chain?
Replies
3
Views
2K
A The Blessings of Dimensionality and Hilbert's 6th Problem
Replies
4
Views
2K
I Direct limit of multiverse models of ZFC
Replies
2
Views
2K
A 2D space and 1D time evolution of a random field
Replies
5
Views
2K
A Diagonalization of 2x2 Hermitian matrices using Wigner D-Matrix
Replies
4
Views
4K
Markov Chain aggregation method
Replies
1
Views
2K

Hot Threads

Recent Insights

Back
Top