The Markov embedding problem revisited (and some of its applications)
A talk in the CRC Seminar series by
Michael Baake
| Abstract: | The continuous-time interpolation of discrete time Markov chains
is an almost one century old problem that became famous due
to work by Elfving and Kingman. Despite the effort of many,
until around 1995, only the case for d=3 was solved, and the
interest in this problem faded after that.
In recent years, due to the need in phylogeny and population
genetics, the question saw renewed interest, and the practically
important case d=4 was finally solved in the last few years.
I'll give some introduction and overview, and show some of the
unexpectedly subtle hurdles that one has to overcome for new
and useful answers, part of which is based on joint work with
Ellen Baake and Jeremy Sumner. Zoom Meeting ID: 647 0432 3651 Passcode: 078107 $\href{https://uni-bielefeld.zoom.us/j/64704323651?pwd=OXhLSDluak9WTWkxU1RObmhGek9QQT09}{\textbf{Join Zoom Meeting}}$ |