Timeline for Show that the Markov chain of random tiling is irreducible
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 9, 2019 at 18:03 | comment | added | user102900 | Thanks a lot. I see. | |
| Oct 6, 2019 at 3:08 | vote | accept | CommunityBot | ||
| Oct 5, 2019 at 9:39 | comment | added | Martin Hairer | @LoveGQY More or less. A natural height function $h(n,m)$ would rather be $h(n,m) = \sup\{i\,:\, f_i(n) \le m\}$ with the convention that it is $0$ if the set is empty, so the $f_i$ are the level lines of $h$. | |
| Oct 3, 2019 at 16:33 | history | answered | Martin Hairer | CC BY-SA 4.0 |