Random K-Out Subgraph Leaves Only O-N-K- Inter-Component Edges
Offered By: IEEE via YouTube
Course Description
Overview
Explore a 22-minute IEEE conference talk on random k-out subgraphs and their impact on inter-component edges. Delve into the research presented by Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, and Uri Zwick as they discuss the problem, previous studies, and applications in both general and dense graphs. Learn about connectivity, high-level proofs, sampling techniques, and edge removal processes. Examine the IDE components, the degrees method, and challenges associated with multigraphs. Gain insights into this complex topic through examples and a comprehensive exploration of the subject matter.
Syllabus
Introduction
Example
Problem
Warmup
Previous studies
General graphs
Dense graphs
Applications
Connectivity
Highlevel proof
How to sample
How to remove edges
Example of removing edges
Sampling edges
IDE components
The degrees method
Challenges
Multigraphs
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
An Introduction to Computer NetworksStanford University via Independent Introduction to Systems Biology
Icahn School of Medicine at Mount Sinai via Coursera Network Analysis in Systems Biology
Icahn School of Medicine at Mount Sinai via Coursera Networks, Crowds and Markets
Cornell University via edX Networking Leadership 101: Building Your Core Professional Network
Center for Creative Leadership via Acumen Academy