Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
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.
