COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Probability > Mixing and cut-off for random walks on finite fields and random polynomials
Mixing and cut-off for random walks on finite fields and random polynomialsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Perla Sousi. I will report on joint work with Peter Varjú in which we investigate the ax+b random walk on a finite field F_p. Work from the 1990s by Chung-Diaconis-Graham established good upper bounds on mixing time when a=2. We refine their methods to understand the case when a is arbitrary in F_p. Using our previous work on irreducibility of polynomials of large degree, we obtain sharp bounds for the mixing time and prove, conditionally on the Generalized Riemann Hypothesis, that a sharp cut-off occurs. This talk is part of the Probability series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsStem Cells & Regenerative Medicine Soul Food Cancer Genetic Epidemiology Seminar SeriesOther talksComputing Green functions in small characteristics The maternal imprint: gender, heredity and the biosocial body Technocolonialism: digital humanitarianism as extraction Dissecting tissue mechanics in the early chicken embryo The intriguing lives of post-starburst galaxies |