Statistical analysis of network data

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (55)

Sparsest Cut: ARV Theorem Log in to Mediaspace to watch this video

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.

Statistical Analysis of Network Data: Noisy Sampled Networks Log in to Mediaspace to watch this video

Explores statistical analysis of network data, covering noisy sampled networks, likelihood estimation, multilayer networks, and directed networks.

Graph Theory Fundamentals Log in to Mediaspace to watch this video

Explores fundamental graph theory concepts, Erdős' results, Chromatic Lemma, and Union Bound theorem in graph theory.

Interlacing Families and Ramanujan Graphs Log in to Mediaspace to watch this video

Explores interlacing families, Ramanujan graphs, and their construction using signed adjacency matrices.

Graphical Models: Probability Distributions and Factor Graphs Log in to Mediaspace to watch this video

Covers graphical models for probability distributions and factor graphs representation.

Graph Theory and Network Flows Log in to Mediaspace to watch this video

Introduces graph theory, network flows, and flow conservation laws with practical examples and theorems.

Expander Graphs: Properties and Eigenvalues Log in to Mediaspace to watch this video

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

Embedding Graphs into Trees Log in to Mediaspace to watch this video

Covers embedding graphs into trees with a focus on minimizing distortion and Bartal Tree embeddings.

Cheeger's Inequalities Log in to Mediaspace to watch this video

Explores Cheeger's inequalities for random walks on graphs and their implications.

Interlacing Families and Ramanujan Graphs Log in to Mediaspace to watch this video

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

Reformulating Problems: Tools and Intuition Log in to Mediaspace to watch this video

Focuses on open problems and the importance of reformulating problems with better tools and intuition.

Message passing in graphical models Log in to Mediaspace to watch this video

Explains message passing in graphical models and the matching problem in graph theory.

Cartesian Product: Graph Operations Log in to Mediaspace to watch this video

Explores the Cartesian product operation on graphs and introduces the concept of cubes.

Belief Propagation on Graphs Log in to Mediaspace to watch this video

Explores belief propagation on graphs, emphasizing normalization, recursive relations, and iterative computation of the partition function.

Dijkstra's Algorithm Overview Log in to Mediaspace to watch this video

Demonstrates the iterative process of applying Dijkstra's algorithm to find optimal paths.

Graph Algorithms: Modeling and Representation Log in to Mediaspace to watch this video

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

Shortest Paths: Negative Weights Log in to Mediaspace to watch this video

Explores Bellman-Ford algorithm for negative weight graphs and currency exchange rates.

Handshake Problem: Graph Representation Log in to Mediaspace to watch this video

Explores a classic handshake problem at a party using graph representation.

Graph Sketching: Connected Components Log in to Mediaspace to watch this video

Covers the concept of graph sketching with a focus on connected components.

Graph Theory Basics Log in to Mediaspace to watch this video

Introduces graph theory basics, Ramsey theory, and graph coloring concepts.

Page 2 of 3