Skip to content

README.md

Latest commit

 

History

History
11 lines (7 loc) · 884 Bytes

README.md

File metadata and controls

11 lines (7 loc) · 884 Bytes

Notebooks

This repository contains a collection of iPython notebooks implementing various algorithms that we encounter. The following is a list of all notebooks with a brief description of the contents for each. Github only serves static snapshots of the notebooks listed. If you want to interact with them, you can launch this repository in binder.

Binder

[FA18] Beyond Worst Case Analysis

  • lec3-spectral-planted-clique implements the AKS spectral algorithm for recovering a planted clique of size O(sqrt(k)).
  • lec6-approx-sbm.ipynb implements the spectral algorithm for approximately recovering partitions in a Stochastic Block Model.
  • lec7-exact-sbm.ipynb implements the SDP algorithm for exactly recovering partitions in a Stochastic Block Model.