The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - March/April (2006 vol.8)
pp: 30-41
Dana Randall , Georgia Institute of Technology
ABSTRACT
Monte Carlo algorithms often depend on Markov chains to sample from very large data sets. A key ingredient in the design of an efficient Markov chain is determining rigorous bounds on how quickly the chain "mixes," or converges, to its stationary distribution. This survey provides an overview of several useful techniques.
INDEX TERMS
Markov processes, Monte Carlo simulation, analysis of algorithm and problem complexity
CITATION
Dana Randall, "Rapidly Mixing Markov Chains with Applications in Computer Science and Physics", Computing in Science & Engineering, vol.8, no. 2, pp. 30-41, March/April 2006, doi:10.1109/MCSE.2006.30
8 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool