Polynomial Identity TestingCovers polynomial identity testing using oracles and random point evaluation, with applications in graph theory and algorithmic aspects.
Stochastic Block ModelCovers the Stochastic Block Model and its application in community detection, exploring its mathematical formulation and challenges.
Geometry: Eulerian CircuitsExplores Eulerian circuits through the Königsberg bridges problem, leading to the development of graph theory and topology.
Szemerédi Regularity LemmaExplores the Szemerédi Regularity Lemma, e-regularity in bipartite graphs, supergraph structure, and induction techniques.
Conditional Statements & Graph TheoryCovers conditional statements and graph theory, including proof techniques and concepts related to graphs, paths, connectivity, and gossip protocols.
Distances and Motif CountsExplores distances on graphs, cut norms, spanning trees, blockmodels, metrics, norms, and ERGMs in network data analysis.
