Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Geometry: Eulerian Circuits
Graph Chatbot
Related lectures (54)
Open Balls and Topology in Euclidean Spaces
Log in to Mediaspace to watch this video
Covers open balls in Euclidean spaces, their properties, and their significance in topology.
Vectors: Definitions and Operations
Log in to Mediaspace to watch this video
Introduces vector definitions, displacement, addition, and applications in geometry.
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.
Assembly: Physics of Manufacturing
Log in to Mediaspace to watch this video
Discusses the importance of assembly in manufacturing and covers common couplings, stability, and spatial vectors.
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.
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.
Elliptical Arch Construction
Log in to Mediaspace to watch this video
Explores the construction of elliptical arches using a single ellipse arc.
Statistical analysis of network data
Log in to Mediaspace to watch this video
Covers stochastic properties, network structures, models, statistics, centrality measures, and sampling methods in network data analysis.
Handshake Problem: Graph Representation
Log in to Mediaspace to watch this video
Explores a classic handshake problem at a party using graph representation.
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 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.
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.
Shortest Paths: Negative Weights
Log in to Mediaspace to watch this video
Explores Bellman-Ford algorithm for negative weight graphs and currency exchange rates.
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.
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.
Graph Sketching: Connected Components
Log in to Mediaspace to watch this video
Covers the concept of graph sketching with a focus on connected components.
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.
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.
Distances and Motif Counts
Log in to Mediaspace to watch this video
Explores distances on graphs, cut norms, spanning trees, blockmodels, metrics, norms, and ERGMs in network data analysis.
Expander Graphs: Properties and Eigenvalues
Log in to Mediaspace to watch this video
Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.
Previous
Page 2 of 3
Next