Mutations and Card Shuffling
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Elena Yudovina.
We consider the process of random transpositions of n particles on a circle, where transpositions only occur if the spacing is at most some number L = L(n). We look in particular at the evolution of parsimony distance used by biologists in the context of studying mutations in chromosomal structure. The proof relies on a comparison with a suitable spatial random graph and we discuss the importance of the appearance of its giant component.
This talk is part of the Statistical Laboratory Graduate Seminars series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
|