Structures in Random Graphs - New Connections
Offered By: Simons Institute via YouTube
Course Description
Overview
Explore the fascinating world of random graph theory in this illuminating lecture by Huy Tuan Pham from Stanford University. Delve into recent developments in combinatorics and probability, focusing on structures emerging in random graphs. Discover intriguing connections to additive combinatorics, theoretical computer science, and probability theory. Examine studies on random Cayley graphs of general groups, investigating clique and independence numbers, and progress towards Alon's conjecture. Learn about thresholds in random graph structures, including the resolution of Talagrand's selector process conjecture and the proof of the Kahn-Kalai conjecture. Investigate the challenges of studying expectation obstructions and their connections to other areas of mathematics. Gain insights into determining thresholds for edge-colorings of complete bipartite graphs using the Lovasz Local Lemma and local uniformity properties.
Syllabus
Structures in Random Graphs: New Connections
Taught by
Simons Institute
Related Courses
Automata TheoryStanford University via edX Intro to Theoretical Computer Science
Udacity Computing: Art, Magic, Science
ETH Zurich via edX 理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX Quantitative Formal Modeling and Worst-Case Performance Analysis
EIT Digital via Coursera