scientific article; zbMATH DE number 176066

MaRDI QIDQ4035166zbMATH OpenFDO

Authors David Aldous

Publication date 18 May 1993

zbMATH Keywords

randomized algorithmsimulating Markov chains

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Recommendations

• Approximate counting, uniform generation and rapidly mixing Markov chains
• scientific article; zbMATH DE number 1566488
• scientific article; zbMATH DE number 420886
• scientific article; zbMATH DE number 1789923
• scientific article; zbMATH DE number 1342087

Cited in

(9)

• Approximate counting, uniform generation and rapidly mixing Markov chains
• Approximate counting of standard set-valued tableaux
• An efficient algorithm for counting Markov equivalent DAGs
• scientific article; zbMATH DE number 6683543 (Why is no real title available?)
• scientific article; zbMATH DE number 4172979 (Why is no real title available?)
• scientific article; zbMATH DE number 3911365 (Why is no real title available?)
• Approximation for counts of 2-runs in a two state Markov chain
• scientific article; zbMATH DE number 1067837 (Why is no real title available?)
• The distance approach to approximate combinatorial counting

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 Q4035166)