Random k-out subgraphs - Or Zamir
Random k-out subgraph leaves only O(n/k) inter-component edges
Finding Dense Subgraphs
Quanquan Liu - Differential Privacy from Locally Adjustable Graph Algorithms
Motif Counting via Subgraph Sampling
5. Forbidding a subgraph IV: dependent random choice
Andrew McGregor - UMass Amherst - Reconstructing Graphs via Sampling Random Subgraphs
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 12.3 - Finding Frequent Subgraphs
Gal Kronenberg - "Independent sets in random subgraphs of the hypercube" | MoCCA'20
mod04lec19 - Random Separation and Subgraph Isomorphism
Counting Subgraphs in Sublinear Time
STOC 2021 - Efficient and Near-Optimal Algorithms for Sampling Connected Subgraphs
Tractable and Consistent Random Graph Models
Highly connected subgraphs in sparse graphs
Giuliamaria Menara (3/27/24): Eulerian magnitude homology: subgraph structure and random graphs
Theory of excluding induced subgraphs Lecture 1
Lecture 21: Small subgraphs in Erdos-Renyi random graphs: Part 1
Omer Angel - Loop O(1) and even subgraphs as factors of IID
Random Graphs with Prescribed K-Core Sequences: A New Null Model for Network Analysis
Graph Matching in Correlated Random Graphs via Small Subgraph Statistics
