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

YouTube

Fast Uniform Generation of Random Graphs with Given Degree Sequences

IEEE via YouTube

Overview

Explore a comprehensive lecture on generating random graphs with specified degree sequences, covering the problem description, historical context, and literature review. Delve into various approaches including rejection methods, wall mode, and switching techniques. Examine the notation and proofs behind these algorithms, and gain insights into the latest developments in this field of graph theory and computer science.

Syllabus

Introduction
Problem description
History
Literature Review
Other ways
Rejection
Wallmode
Simple graphs
Rejection scheme
Switching
Previous algorithm
Notation
Proof
Conclusion

Taught by

IEEE FOCS: Foundations of Computer Science

Reviews

Start your review of Fast Uniform Generation of Random Graphs with Given Degree Sequences

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.