Found 1 result(s)
regular seminar Zsuzsanna Baran (Cambridge)
at: 14:00 - 15:00 KCL, Strand room: S0.12 abstract: | It is well-known that a random walk on a (connected, finite, non-bipartite) graph converges to its invariant distribution. For some graphs it has been observed that this convergence happens rather abruptly. This phenomenon is called cutoff, and it has been established widely, but in general there is little understanding for what causes it.
|