Lecture

Graphical Models: Representing Probabilistic Distributions

Related lectures (28)

Stein Algorithm: Polynomial Identity Testing

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

Graphical Models: Probability Distributions and Factor Graphs

Covers graphical models for probability distributions and factor graphs representation.

Introduces network data structures, models, and analysis techniques, emphasizing permutation invariance and Erdős-Rényi networks.

Graphs: Properties and Representations

Covers graph properties, representations, and traversal algorithms using BFS and DFS.

Graphs in Deep Learning: Applications and Techniques

Explores the role of graphs in deep learning, focusing on their structure, applications, and techniques for processing graph data.

Handling Network Data

Covers handling network data, types of graphs, centrality measures, and properties of real-world networks.

Graph Algorithms: Modeling and Traversal

Covers graph algorithms, modeling relationships between objects, and traversal techniques like BFS and DFS.

Belief Propagation

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

Sparsest Cut: ARV Theorem

Covers the proof of the Bourgain's ARV Theorem, focusing on the finite set of points in a semi-metric space and the application of the ARV algorithm to find the sparsest cut in a graph.

Expander Graphs: Properties and Eigenvalues

Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.

Graphical Models: Joint Probability Distribution

Covers the concept of graphical models and joint probability distributions.

Directed Networks & Hypergraphs

Explores directed networks with asymmetric relationships and hypergraphs that generalize graphs by allowing edges to connect any subset of nodes.

Statistical analysis of network data

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

Graph Algorithms: Modeling and Representation

Covers the basics of graph algorithms, focusing on modeling and representation of graphs in memory.

Handling Network Data

Explores handling network data, including types of graphs, real-world network properties, and node importance measurement.

Fixed Points in Graph Theory

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

Handling Networks: Graph Theory

Covers the fundamentals of handling networks and centrality measures in graph theory.

Handling Networks: Graph Theory

Explores graph theory concepts, centrality measures, and real-world network properties, providing insights into handling diverse types of networks.

Convergence of Random Walks

Explores the convergence of random walks on graphs and the properties of weighted adjacency matrices.

Graphs and Networks: Basics and Applications

Introduces the basics of graphs and networks, covering definitions, paths, trees, flows, circulation, and spanning trees.