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.
Fast Uniform Generation of Random Graphs with Given Degree Sequences
Overview
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
Tags
Related Courses
-
Random K-Out Subgraph Leaves Only O-N-K- Inter-Component Edges
-
Isomorphism Testing for Graphs Excluding Small Minors
-
Finding Large Cliques in Random and Semi-Random Graphs
-
High-Precision Estimation of Random Walks in Small Space
-
Planar Graphs Have Bounded Queue-Number
-
Dichotomy for Graph Homomorphisms with Complex Values on Bounded Degree Graphs
