Optimizing the eigenvector computation algorithm with diffusion approach
Abstract
In this paper, we apply the ideas of the matrix column based diffusion approach to define a new eigenvector computation algorithm of a stationary probability of a Markov chain.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.