Fast Uniform Generation of Random Graphs with Given Degree Sequences
Offered By: IEEE via YouTube
Course Description
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
Tags
Related Courses
Теория вероятностей для начинающихMoscow Institute of Physics and Technology via Coursera Universality of Random Graphs - Gal Kronenberg
Institute for Advanced Study via YouTube The Science of Networks - C4 Public Lectures
Santa Fe Institute via YouTube Optimization of the Sherrington-Kirkpatrick Hamiltonian
IEEE via YouTube Interacting Stochastic Processes on Random Graphs
Joint Mathematics Meetings via YouTube