Lectures related to Graph Theory: Girth and Independence

Focuses on fixed points in graph theory and their implications in algorithms and analysis.

Explores the transition from sparse to dense graphs and their real-world applications.

Introduces the probabilistic method to prove existence results in graph theory.

Covers graphical models for probabilistic distributions using graphs, nodes, and edges.

Explores Belief Propagation in graphical models, factor graphs, spin glass examples, Boltzmann distributions, and graph coloring properties.

Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.

Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.

Explores the Stein algorithm for polynomial identity testing and the minimization of a cut problem.

Covers universality and rotational invariance in isoradial graphs and their implications in statistical mechanics.

Covers the Stochastic Block Model and its application in community detection, exploring its mathematical formulation and challenges.

Explores Belief Propagation for graph coloring and its convergence properties.

Covers fundamental concepts in probability and statistics, emphasizing data analysis techniques and statistical modeling.

Explores dependence, correlation, and conditional expectations in probability and statistics, highlighting their significance and limitations.

Explores continuous random variables, density functions, joint variables, independence, and conditional densities.

Explores graph coloring, directed cycles, LLL algorithm applications, and element dependencies in graphs.

Covers graphical models for probability distributions and factor graphs representation.

Covers the Leighton-Rao algorithm for finding the sparsest cut in a graph, focusing on its steps and theoretical foundations.

Covers applied probability, stochastic processes, Markov chains, rejection sampling, and Bayesian inference methods.

Explores interlacing families of polynomials and 1-sided Ramanujan graphs, focusing on their properties and construction methods.

Covers stochastic properties, network structures, models, statistics, centrality measures, and sampling methods in network data analysis.