scientific article; zbMATH DE number 1301966

MaRDI QIDQ4247200zbMATH OpenFDO

Authors Abraham Sharell

Publication date 28 July 2000

zbMATH Keywords

coupling techniqueMarkov chainsmixing timeMonte Carlo method

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Monte Carlo methods (65C05) Linear programming (90C05)

Recommendations

• Bounding fastest mixing
• Faster random generation of linear extensions
• scientific article; zbMATH DE number 1195779
• Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow

Cited in

(6)

• On the conductance of order Markov chains
• Faster random generation of linear extensions
• Mixing time for Markov chain on linear extensions
• Comparison inequalities and fastest-mixing Markov chains
• Upper Bounds on Mixing Time of Finite Markov Chains
• Using Markov-chain mixing time estimates for the analysis of ant colony optimization

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247200)