Omer Bobrowski - Random Simplicial Complexes
Offered By: Hausdorff Center for Mathematics via YouTube
Course Description
Overview
Explore the fascinating world of random simplicial complexes in this third lecture of a minicourse series. Delve into the random Cech complex, a higher-dimensional generalization of the random geometric graph. Learn about connectivity, formation of cycles, and emergence of "giant" connected components in this context. Compare these higher-dimensional phenomena to their lower-dimensional graph counterparts using algebraic topology and homology theory. Gain insights into the Chair Complex, D Complex, Curly Age, and Mode Theory. Examine the differences between connectivity and homological connectivity, and understand the concepts of giant components and giant cycles. Discover the duality theorem and its implications. No prior knowledge is required for this comprehensive exploration of random simplicial complexes and their applications in modern data and network analysis.
Syllabus
Introduction
Models
Chair Complex vs D Complex
Curly Age
Mode Theory
Proof
Connectivity vs homological connectivity
Giant components
Giant cycles
Theorem
Duality
Conclusion
Taught by
Hausdorff Center for Mathematics
Related Courses
Social Network AnalysisUniversity of Michigan via Coursera Intro to Algorithms
Udacity Data Analysis
Johns Hopkins University via Coursera Computing for Data Analysis
Johns Hopkins University via Coursera Health in Numbers: Quantitative Methods in Clinical & Public Health Research
Harvard University via edX