Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Sampling Graphs Without Forbidden Subgraphs and Unbalanced Expanders With Negligible Error

IEEE via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a 19-minute IEEE conference talk on advanced graph theory and sampling techniques. Dive into the concepts of sampling graphs without forbidden subgraphs and unbalanced expanders with negligible error. Follow along as speakers Benny Applebaum and Eliran Kachlon guide you through key topics including motivation, problem statements, main results, efficient sampler/tester, corollaries, and the main ideas behind sampling and testing. Gain insights into the technical aspects of distinctness gadgets and their applications. Conclude with a comprehensive understanding of these complex graph theory concepts and their practical implications in computer science and mathematics.

Syllabus

Intro
Motivation
Example
First Problem
Second Problem
Main Results: Efficient Sampler/Teste
Corollaries
Negligible-Error Unbalanced Expander
Main idea
Sampling
Testing
Distinctness Gadget
Technicalities
Conclusion

Taught by

IEEE FOCS: Foundations of Computer Science

Reviews

Start your review of Sampling Graphs Without Forbidden Subgraphs and Unbalanced Expanders With Negligible Error

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.