Learning in Networks: Performance Limits and Algorithms
Videos from CMO Workshop
Julia Gaudio, Northwestern University
Monday Nov 14, 2022 11:00 - 12:02
Spectral algorithms for community detection
Weina Wang, Carnegie Mellon University
Monday Nov 14, 2022 15:00 - 15:46
Stochastic Bin Packing with Time-Varying Item Sizes
Dmitriy Kunisky, Johns Hopkins University
Tuesday Nov 15, 2022 09:30 - 10:33
Spectral pseudorandomness and the clique number of the Paley graph
Miklos Racz, Princeton University
Tuesday Nov 15, 2022 11:00 - 12:00
Correlated stochastic block models: graph matching and community recovery
Yury Polyanskiy, MIT
Tuesday Nov 15, 2022 12:00 - 13:07
Uniqueness of BP fixed point for Ising models
Xiaohan Kang, University of Illinois
Tuesday Nov 15, 2022 15:00 - 15:57
Finite-sample lower bounds on information requirements for causal network inference
Lele Wang, University of British Columbia
Wednesday Nov 16, 2022 09:30 - 10:27
Attributed Graph Alignment: Fundamental Limits and Efficient Algorithms
Alex Wein, UC Davis
Wednesday Nov 16, 2022 11:00 - 12:00
Average-Case Computational Complexity of Tensor Decomposition
Jiaming Xu, Duke University
Thursday Nov 17, 2022 09:30 - 10:30
Random graph matching at Otter’s threshold via counting chandeliers
Chao Gao, University of Chicago
Thursday Nov 17, 2022 12:00 - 13:00
Optimal Full Ranking from Pairwise Comparisons
Ilias Zadik, MIT
Thursday Nov 17, 2022 16:30 - 17:38
Title: Revisiting Jerrum’s Metropolis Process for the Planted Clique Problem
Cheng Mao, Georgia Tech
Friday Nov 18, 2022 09:30 - 10:16
Detection-Recovery Gap for Planted Dense Cycles
Bruce Hajek, University of Illinois
Friday Nov 18, 2022 11:00 - 12:00
On community detection in preferential attachment networks
