On counting subgraphs and why counting seeds makes more sense (if one thinks about it clearly)

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=1QeROlBFyTM


Duration: 0:00
89 views
0

Talya Eden
https://simons.berkeley.edu/talks/talya-eden-2024-08-05
Workshop on Local Algorithms (WoLA)

I will survey the current landscape of sublinear subgraph counting and sampling, where a vast majority of the works are joint works with Dana.



Other Videos By Simons Institute for the Theory of Computing


2024-10-02Distribution Learning Meets Graph Structure Sampling
2024-10-02On the instance optimality of detecting collisions and subgraphs
2024-10-02Low Degree Testing over the Reals
2024-10-02Talk By Tal Herman
2024-10-02Verifiable Data Science via Interactive Proofs
2024-10-02Dana is NOT average
2024-10-02Monotonicity testing, routing, and a theorem of Lehman and Ron
2024-10-02Conditional Sampling for Distribution Testing
2024-09-05Challenges in Making LLMs Safe and Robust
2024-09-04Understanding and Steering Generative AI Systems
2024-08-04On counting subgraphs and why counting seeds makes more sense (if one thinks about it clearly)
2024-08-01Are there graphs whose shortest path structure requires large edge weights?
2024-08-01Graph Connectivity Using Star Contraction
2024-08-01Agnostic Proper Learning of Monotone Functions: Beyond the Black-Box Correction Barrier
2024-08-01Sparsifying Set Systems for Coverage Problems
2024-07-31Recent Progress on Euclidean Spanners
2024-07-31Space is a latent sequence: A theory of hippocampus and PFC
2024-06-21Robust Equation Discovery and Sparse Sensing with Guarantees
2024-06-21Data is as Data Does: The Influence of Computation on Inference
2024-06-21Some thoughts on ML-based protein engineering
2024-06-21Machine learning models of differential gene expression