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 > Isaac Newton Institute Seminar Series > A central limit theorem in the framework of the Thompson group F
A central limit theorem in the framework of the Thompson group FAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact nobody. QIAW02 - New trends at the intersection of quantum information theory, quantum groups and operator algebras The classical central limit theorem states that the average of an infinite sequence of independent and identically distributed random variables, when suitably rescaled, tends to a normal distribution. In fact, this classical result can be stated purely algebraically, using the combinatorics of pair partitions. In the 1980s, Voiculescu proved an analog of the central limit theorem in free probability theory, wherein the normal distribution is replaced by Wigner’s semicircle distribution. Later, Speicher provided an algebraic proof of the free central limit theorem, based on the combinatorics of non-crossing pair partitions. Since then, various algebraic central limit theorems have been studied in noncommutative probability, for instance, in the context of symmetric groups. My talk will discuss a central limit theorem for the Thompson group F, and show that the central limit law of a naturally defined sequence in the group algebra of F is the normal distribution. Our combinatorial approach employs abstract reduction systems to arrive at this result. This talk is part of the Isaac Newton Institute Seminar Series series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listscambridge-lectures The Shrinking Commons Symposium: Plenary Lectures CUSPE ForumOther talksCorrelated Resetting Gas Welcome and Introduction Bounds for the error of sampling discretization and discretization in Orlicz spaces Active Particles Learning Functionalities First passage percolation for random interlacements Inference theme - Comparing inferences from stochastic and deterministic models |