Birs- 22w5185: Learning in Networks: Performance Limits and Algorithms
-
Title: Spectral algorithms for community detection
Speaker:
Link:
-
Title: Stochastic Bin Packing with Time-Varying Item Sizes
Speaker:
Link:
-
Title: Spectral pseudorandomness and the clique number of the Paley graph
Speaker:
Link:
-
Title: Correlated stochastic block models: graph matching and community recovery
Speaker:
Link:
-
Title: Uniqueness of BP fixed point for Ising models
Speaker:
Link:
-
Title: Finite-sample lower bounds on information requirements for causal network inference
Speaker:
Link:
-
Title: Attributed Graph Alignment: Fundamental Limits and Efficient Algorithms
Speaker:
Link:
-
Title: Average-Case Computational Complexity of Tensor Decomposition
Speaker:
Link:
-
Title: Random graph matching at Otter’s threshold via counting chandeliers
Speaker:
Link:
-
Title: Optimal Full Ranking from Pairwise Comparisons
Speaker:
Link:
-
Title: Title: Revisiting Jerrum’s Metropolis Process for the Planted Clique Problem
Speaker:
Link:
-
Title: Detection-Recovery Gap for Planted Dense Cycles
Speaker:
Link:
-
Title: On community detection in preferential attachment networks
Speaker:
Link: