Skip header Section
Skip Bibliometrics Section
Mathematical Aspects of Mixing Times in Markov Chains (Foundations and Trends(R) in Theoretical Computer Science)May 2006
- Authors:
- Ravi R. Montenegro,
- Prasad Tetali
Abstract
No abstract available.
Cited By
-
Blanca A, Chen Z, Štefankovič D and Vigoda E (2024). Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling, ACM Transactions on Algorithms, 10.1145/3686799
- Koehler F, Lifshitz N, Minzer D and Mossel E Influences in Mixing Measures Proceedings of the 56th Annual ACM Symposium on Theory of Computing, (527-536)
- Makur A and Polyanskiy Y (2018). Comparison of Channels: Criteria for Domination by a Symmetric Channel, IEEE Transactions on Information Theory, 64:8, (5704-5725), Online publication date: 1-Aug-2018.
- Chan T, Louis A, Tang Z and Zhang C (2018). Spectral Properties of Hypergraph Laplacian and Approximation Algorithms, Journal of the ACM, 65:3, (1-48), Online publication date: 27-Mar-2018.
- Blanca A, Caputo P, Sinclair A and Vigoda E Spatial mixing and non-local markov chains Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, (1965-1980)
- Louis A Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms Proceedings of the forty-seventh annual ACM symposium on Theory of Computing, (713-722)
- Desai V, Farias V and Moallemi C (2012). Pathwise Optimization for Optimal Stopping Problems, Management Science, 58:12, (2292-2308), Online publication date: 1-Dec-2012.
- Song Y, Wong S and Lee K Optimal gateway selection in multi-domain wireless networks Proceedings of the 17th annual international conference on Mobile computing and networking, (325-336)
- Shah D and Shin J Dynamics in congestion games Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems, (107-118)
- Shah D and Shin J (2010). Dynamics in congestion games, ACM SIGMETRICS Performance Evaluation Review, 38:1, (107-118), Online publication date: 12-Jun-2010.
Please enable JavaScript to view thecomments powered by Disqus.
Recommendations
Rapidly Mixing Markov Chains with Applications in Computer Science and Physics
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 ...
Upper Bounds on Mixing Time of Finite Markov Chains
We provide a general framework for computing mixing times of finite Markov chains whose semigroup's minimal ideal is left zero. Our analysis is based on combining results by Brown and Diaconis with our previous work on stationary distributions of finite ...