Red light green light method for solving large Markov chains
From MaRDI portal
Publication:2674164
DOI10.1007/s10915-022-01976-8zbMath1503.60092arXiv2008.02710OpenAlexW3047463426MaRDI QIDQ2674164
Publication date: 22 September 2022
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.02710
Computational methods in Markov chains (60J22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical analysis or methods applied to Markov chains (65C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A scaling analysis of a cat and mouse Markov chain
- Entrywise perturbation theory and error analysis for Markov chains
- The jump start power method: a new approach for computing the ergodic projector of a finite Markov chain
- Similarities on graphs: kernels versus proximity measures
- Distributed randomized algorithms for PageRank computation: recent advances
- Non-negative matrices and Markov chains.
- PageRank Beyond the Web
- Random Graphs and Complex Networks
- A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning
- Revisiting Asynchronous Linear Solvers
- Bookmark-Coloring Algorithm for Personalized PageRank Computing
- Strong Localization in Personalized PageRank Vectors
- Ordinal Ranking for Google's PageRank
- Regenerative Analysis and Steady State Distributions for Markov Chains
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius
- Numerical Methods in Markov Chain Modeling
- Turnpike Theory
- Asynchronous Iterative Methods for Multiprocessors
- Introduction to Matrix Analytic Methods in Stochastic Modeling
- Asynchronous Distributed Algorithms for Solving Linear Algebraic Equations
- Convergence Rates for Markov Chains
- Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
- Local Computation of PageRank Contributions
- Numerical Methods for Structured Markov Chains
- Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments
- Large deviations for renewal processes
