University of Cambridge > Talks.cam > Probability > Random walks on groups and the Kaimanovich-Vershik conjecture

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

Random walks on groups and the Kaimanovich-Vershik conjecture

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Perla Sousi.

In the 1980s, much progress was made in understanding random walks on groups. In particular, characterizations of when there are non-constant bounded harmonic functions were given using asymptotic entropy. Later, Kaimanovich gave criteria for identifying all bounded harmonic functions. However, a conjecture of Kaimanovich and Vershik from 1979 remained open, with the first breakthrough by Erschler in 2011. We present a simple proof of the full conjecture in joint work with Yuval Peres.

This talk is part of the Probability series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Cambridge Network Healthcare SIG Are there limits to evolution? Cambridge Public Policy Events computer science Leadership in the Emerging Markets Institute Seminar

Other talks

How archaeologists resolve the inductive risk argument Polynomial approximation of high-dimensional functions on irregular domains Visual hallucinations in Parkinson’s disease - imbalances in top-down vs. bottom up information processing Finding alternatives: when circumstances suddenly change Development of a Broadly-Neutralising Vaccine against Blood-Stage P. falciparum Malaria
 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity