Approximation of Vertex Transitive Graphs by Nilpotent Groups and Applications to Probability
Simons Semester on Dynamics via YouTube
Master Production-Ready Machine Learning, Step by Step
The Fastest Way to Become a Backend Developer Online
Overview
Google, IBM & Meta Certificates – 40% Off
One plan covers every Professional Certificate on Coursera.
Unlock All Certificates
Explore a 47-minute mathematics lecture from the Simons Semester on Dynamics where Matthew Tointon from the University of Bristol discusses the approximation of vertex-transitive graphs by nilpotent groups and their applications to probability theory. Delivered at the Będlewo Mathematical Research and Conference Center as part of the conference on Nilpotent structures in topological dynamics, ergodic theory and combinatorics, delve into advanced mathematical concepts connecting graph theory, group theory, and probabilistic applications. Learn from this specialized academic presentation that bridges multiple mathematical disciplines while examining the relationship between vertex-transitive graphs and nilpotent group structures.
Syllabus
Approximation of vertex transitive graphs by nilpotent groups, and applications to probability
Taught by
Simons Semester on Dynamics