Timeline for Stopping time of a Markov chain
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 19, 2011 at 17:04 | comment | added | folmez | Phase 2 can be proved to require a constant number of rounds the way you suggested. I think a Chernoff bound also works. Thanks for your note for phase 1, I am definitely going to try that. [Chat mode on] my advisor Janet Best and post-doc Deena Schmidt said "Hi!" [Chat mode off] | |
| Dec 17, 2011 at 9:44 | history | answered | Nathanael Berestycki | CC BY-SA 3.0 |