Directed forests with application to algorithms related to Markov chains
aggregation algorithmsdirected forest expansionsGibbs samplerMarkov chain Monte Carlo proceduresmatrix tree theoremsimulated annealingsystems of linear equations
Connectivity (05C40) Inequalities involving eigenvalues and eigenvectors (15A42) Stochastic matrices (15B51) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Computational methods in Markov chains (60J22) Continuous-time Markov processes on discrete state spaces (60J27) Monte Carlo methods (65C05) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Roundoff error (65G50) Graph theory (including graph drawing) in computer science (68R10)
- Analysis of Markov chain algorithms on spanning trees, rooted forests, and connected subgraphs
- Aggregation algorithms for perturbed Markov chains with applications to networks modeling
- An Introduction to Markov Processes
- Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs
- How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
- Two applications of random spanning forests
- The matrix of maximum out forests of a digraph and its applications
- Uncoupling Measures and Eigenvalues of Stochastic Matrices
- Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs
- Aggregation algorithms for perturbed Markov chains with applications to networks modeling
- A version of the random directed forest and its convergence to the Brownian web
This page was built for publication: Directed forests with application to algorithms related to Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4522978)
