Directed forests with application to algorithms related to Markov chains

DOI10.4064/AM-26-4-395-414zbMath0998.60070OpenAlexW1503548593MaRDI QIDQ4522978

Piotr Pokarowski

Publication date: 7 January 2001

Published in: Applicationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/219248

zbMATH Keywords

simulated annealingGibbs samplersystems of linear equationsmatrix tree theoremaggregation algorithmsdirected forest expansionsMarkov chain Monte Carlo procedures

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Monte Carlo methods (65C05) Graph theory (including graph drawing) in computer science (68R10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Inequalities involving eigenvalues and eigenvectors (15A42) Roundoff error (65G50) Continuous-time Markov processes on discrete state spaces (60J27) Direct numerical methods for linear systems and matrix inversion (65F05) Connectivity (05C40) Stochastic matrices (15B51)

Related Items (1)

Uncoupling Measures and Eigenvalues of Stochastic Matrices

This page was built for publication: Directed forests with application to algorithms related to Markov chains