YoVDO

Fast Uniform Generation of Random Graphs with Given Degree Sequences

Offered By: IEEE via YouTube

Tags

IEEE FOCS: Foundations of Computer Science Courses Graph Theory Courses Algorithm Design Courses Network Analysis Courses Random Graphs Courses

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

An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature
IEEE via YouTube
Computation in the Brain Tutorial - Part 2
IEEE via YouTube
Computation in the Brain - Part 1
IEEE via YouTube
Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
IEEE via YouTube
Cookbook Lower Bounds for Statistical Inference in Distributed and Constrained Settings - Part 1
IEEE via YouTube