![](https://ccweb.imgix.net/https%3A%2F%2Fwww.classcentral.com%2Fimages%2Ficon-black-friday.png?auto=format&ixlib=php-4.1.0&s=fe56b83c82babb2f8fce47a2aed2f85d)
Overview
![](https://ccweb.imgix.net/https%3A%2F%2Fwww.classcentral.com%2Fimages%2Ficon-black-friday.png?auto=format&ixlib=php-4.1.0&s=fe56b83c82babb2f8fce47a2aed2f85d)
This course teaches learners how to efficiently generate random graphs with specified degree sequences. The course covers topics such as problem description, literature review, rejection schemes, switching, and previous algorithms. By the end of the course, students will have the skills to generate random graphs quickly and effectively using the methods discussed. The teaching method involves presenting theoretical concepts and algorithms related to random graph generation. This course is intended for individuals interested in graph theory, network analysis, and algorithm design.
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