YoVDO

Structures in Random Graphs - New Connections

Offered By: Simons Institute via YouTube

Tags

Theoretical Computer Science Courses Probability Courses Random Graphs Courses Additive Combinatorics Courses Cayley Graphs Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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

Design of Computer Programs
Stanford University via Udacity
Intro to Statistics
Stanford University via Udacity
Health in Numbers: Quantitative Methods in Clinical & Public Health Research
Harvard University via edX
Mathematical Biostatistics Boot Camp 1
Johns Hopkins University via Coursera
Statistics
San Jose State University via Udacity