Random Walks on Groups and the Kaimanovich-Vershik Conjecture for Lamplighter Groups

Subscribers:
344,000
Published on ● Video Link: https://www.youtube.com/watch?v=Cnayfny_IJY



Duration: 1:10:33
1,107 views
17


Let G be an infinite group with a finite symmetric generating set S. The corresponding Cayley graph on G has an edge between x,y in G if their ratio xy^{-1} is in S. Kaimanovich-Vershik (1983), building on fundamental results of Furstenberg, Derrienic and Avez, showed that G admits non-constant bounded harmonic functions iff the entropy of simple random walk on G grows linearly in time; Varopoulos (1985) showed that this is equivalent to the random walk escaping with a positive asymptotic speed. Kaimanovich and Vershik (1983) also described the lamplighter groups (groups of exponential growth consisting of finite lattice configurations) where (in dimension at least 3) the simple random walk has positive speed, yet the probability of returning to the starting point does not decay exponentially. They conjectured a complete description of the bounded harmonic functions on these groups; In dimension 5 and above, their conjecture was proved by Anna Erschler (2011). In the talk, I will discuss the background and present a proof of the Kaimanovich-Vershik conjecture for all dimensions, obtained in joint work with Russ Lyons; the case of dimension 3 is the most delicate. No prior knowledge of group theory will be assumed.




Other Videos By Microsoft Research


2016-07-26Making Reusable Hardware Design IPs Usable: an NoC perspective
2016-07-26Lessons from Megaprojects: The Creators and Destroyers of Capital
2016-07-26Unsupervised Transcription of Historical Documents
2016-07-26Online Learning and Adaptation Over Networks
2016-07-26Easy Generation and Efficient Verification of Unsatisfiability Proofs
2016-07-26Learning to Understand Natural Language in Physically-Grounded Environments
2016-07-26Frontiers of Accessibility: From the Body to the Mind, the Heart, and the Soul
2016-07-26Analyzing neurological disorders using functional and structural brain imaging data
2016-07-26Collaborative, Large-Scale Data Analytics and Visualization with Python
2016-07-26Gap Probabilities for Zeroes of Stationary Gaussian Functions
2016-07-26Random Walks on Groups and the Kaimanovich-Vershik Conjecture for Lamplighter Groups
2016-07-26Sensing without Sensors
2016-07-26Optimal Falsifications for Cyber-Physical Systems using Trajectory Splicing
2016-07-26A Sensor Fusion Approach towards Gesture Recognition on the Wearable Ring Form Factor
2016-07-26Digital Traces in Online Places: Methods, Software, and Applications for Social Behavioral Research
2016-07-26Stabilizer: Statistically Sound Performance Evaluation
2016-07-26Revenue maximization and prophet inequalities
2016-07-26On the Number of Matroids
2016-07-26RealTime Collaborative Analysis with (Almost) Pure SQL: A Case Study in Biogeochemical Oceanography
2016-07-26Who is Afraid of Vectors�Optimizing Cryptography Using SSE, AVX, NEON, and Co.
2016-07-26Programming with People: Integrating Human-Based and Digital Computation



Tags:
microsoft research