AI, Data Science & Cloud Certificates from Google, IBM & Meta
Get 20% off all career paths from fullstack to AI
Overview
Google, IBM & Meta Certificates – 40% Off
One plan covers every Professional Certificate on Coursera.
Unlock All Certificates
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