Timeline for Polynomial time mixing Markov chain for multimodal distribution
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 8, 2022 at 17:46 | history | edited | Yuval Peres | CC BY-SA 4.0 |
added 2 characters in body
|
| Sep 8, 2022 at 17:44 | comment | added | Yuval Peres | @NawafBou-Rabee And thank you for sharing your perspective on this important problem. | |
| Sep 8, 2022 at 9:36 | comment | added | Nawaf Bou-Rabee | Thanks for taking the time to share this review; glad you highlighted the comment by @JamesMartin, which is important in practice and sometimes overlooked: one would indeed need that each step of the chain be implementable in poly time for the mixing time result to be of much value. I guess per step of Glauber is $O(1)$ and Swendsen-Wang is $O(n)$. | |
| Sep 8, 2022 at 6:55 | history | answered | Yuval Peres | CC BY-SA 4.0 |