From Large to Infinite Random Simplicial Complexes
Offered By: Applied Algebraic Topology Network via YouTube
Course Description
Overview
Explore two general models of random simplicial complexes that extend the Erdos-Renyi model for random graphs in this comprehensive lecture. Delve into the probabilistic models of random simplicial complexes from Costa-Farber, Kahle, and Linial-Meshulam as special cases. Examine the Alexander duality relation between these models and its implications for information transfer. Investigate the limitations of this duality with vanishing probability parameters and its effectiveness when parameters are uniformly bounded. Learn about the Rado simplicial complex, the unique infinite random simplicial complex. Gain insights from joint work with Michael Farber, Tahl Nowik, and Lewin Strauss in this advanced exploration of algebraic topology and probability theory.
Syllabus
Lewis Mead (5/27/20): From large to infinite random simplicial complexes
Taught by
Applied Algebraic Topology Network
Related Courses
Fundamentals of Quantitative ModelingUniversity of Pennsylvania via Coursera Теория вероятностей – наука о случайности
Tomsk State University via Stepik Statistics and Data Science
Massachusetts Institute of Technology via edX Natural Language Processing with Probabilistic Models
DeepLearning.AI via Coursera Natural Language Processing
DeepLearning.AI via Coursera