Graph Matching in Correlated Random Graphs via Small Subgraph Statistics

Channel:

Subscribers:

68,700

Published on October 23, 2020 7:39:10 PM ● Video Link: https://www.youtube.com/watch?v=6sVX5c3fZCM

Duration: 1:02:50

482 views

Other Videos By Simons Institute for the Theory of Computing

2020-10-27	Robust Algorithms for Secretaries and Bandits
2020-10-27	Regret Minimization for Stochastic Shortest Paths
2020-10-27	Pandora's Box with Correlations: Learning and Approximation
2020-10-26	Learning Outcomes in Queueing Systems
2020-10-26	Gradient Descent-Ascent Provably Converges to Strict Local Minmax Equilibria with a Finite Timescale
2020-10-26	Pure Exploration Problems
2020-10-26	Selfish Robustness and Equilibria in Multi-Player Bandits
2020-10-26	Multi-Task Optimal Experiment Design
2020-10-26	Online Multiserver Convex Chasing and Optimization
2020-10-23	Lower Estimates of Marginal Density
2020-10-23	Graph Matching in Correlated Random Graphs via Small Subgraph Statistics
2020-10-23	The (Non-)Concentration of the Chromatic Number
2020-10-23	Log Concavity and Concentration of Measure on the Discrete Hypercube
2020-10-22	Sharp Poincare and log-Sobolev Inequalities for the Switch Chain on Regular Bipartite Graphs
2020-10-22	Rates of Normal Approximation for Typical Weighted Sums
2020-10-22	The Langevin Algorithm in the Non Smooth Log-Concave Case
2020-10-22	Moments of the Distance Between Independent Random Vectors
2020-10-21	Sharp Thresholds for Random Subspaces, and Applications
2020-10-21	Gaussian Regularization of the Pseudospectrum and Numerical Linear Algebra
2020-10-21	Reducing Isotropy to KLS, A Faster Sampling Algorithm
2020-10-21	Random Concave Functions on an Equilateral Lattice with Periodic Hessians

Tags:

Simons Institute

theoretical computer science

UC Berkeley

Computer Science

Theory of Computation

Theory of Computing

Concentration of Measure Phenomena

Tselil Schramm