Birs- 22w5185: Learning in Networks: Performance Limits and Algorithms

  1. Title:
    Spectral algorithms for community detection

    Speaker:

    Link:

  2. Title:
    Stochastic Bin Packing with Time-Varying Item Sizes

    Speaker:

    Link:

  3. Title:
    Spectral pseudorandomness and the clique number of the Paley graph

    Speaker:

    Link:

  4. Title:
    Correlated stochastic block models: graph matching and community recovery

    Speaker:

    Link:

  5. Title:
    Uniqueness of BP fixed point for Ising models

    Speaker:

    Link:

  6. Title:
    Finite-sample lower bounds on information requirements for causal network inference

    Speaker:

    Link:

  7. Title:
    Attributed Graph Alignment: Fundamental Limits and Efficient Algorithms

    Speaker:

    Link:

  8. Title:
    Average-Case Computational Complexity of Tensor Decomposition

    Speaker:

    Link:

  9. Title:
    Random graph matching at Otter’s threshold via counting chandeliers

    Speaker:

    Link:

  10. Title:
    Optimal Full Ranking from Pairwise Comparisons

    Speaker:

    Link:

  11. Title:
    Title: Revisiting Jerrum’s Metropolis Process for the Planted Clique Problem

    Speaker:

    Link:

  12. Title:
    Detection-Recovery Gap for Planted Dense Cycles

    Speaker:

    Link:

  13. Title:
    On community detection in preferential attachment networks

    Speaker:

    Link: