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
Separation Conditions: Graph and Saturations
Graph Chatbot
Related lectures (55)
Compact Embedding: Theorem and Sobolev Inequalities
Log in to Mediaspace to watch this video
Covers the concept of compact embedding in Banach spaces and Sobolev inequalities.
Graph Theory: Girth and Independence
Log in to Mediaspace to watch this video
Covers girth, independence, probability, union bound, sets, and hypergraph recoloring.
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.
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.
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.
Convergence of Random Walks
Log in to Mediaspace to watch this video
Explores the convergence of random walks on graphs and the properties of weighted adjacency matrices.
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.
Sparsest Cut: Leighton-Rao Algorithm
Log in to Mediaspace to watch this video
Covers the Leighton-Rao algorithm for finding the sparsest cut in a graph, focusing on its steps and theoretical foundations.
Connectivity-Informed Brain Activity Interpretation
Log in to Mediaspace to watch this video
Explores integrating brain connectivity to decode and interpret brain activity using graph signal processing and spectral residual networks.
Pseudorandomness: Expander Mixing Lemma
Log in to Mediaspace to watch this video
Explores pseudorandomness and the Expander Mixing Lemma in the context of d-regular graphs.
Cheeger's Inequality
Log in to Mediaspace to watch this video
Explores Cheeger's inequality and its implications in graph theory.
Linearity of Expectation
Log in to Mediaspace to watch this video
Covers Linearity of Expectation, Markov's inequality, random variables, and transitive tournaments.
Building Ramanujan Graphs
Log in to Mediaspace to watch this video
Explores the construction of Ramanujan graphs using polynomials and addresses challenges with the probabilistic method.
Isogenic Graphs: Spectral Analysis and Mathematical Applications
Log in to Mediaspace to watch this video
Explores isogenic graphs, spectral properties, and mathematical applications in modular forms and cryptography.
Bellman Ford Algorithm
Log in to Mediaspace to watch this video
Explores the Bellman Ford algorithm for finding the shortest path in graphs with negative edge weights.
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.
Position Space Approach: Analyzing Banana Feynman Diagrams
Log in to Mediaspace to watch this video
Presents the position space approach to banana Feynman diagrams and their differential equations.
Differentiable Functions and Lagrange Multipliers
Log in to Mediaspace to watch this video
Covers differentiable functions, extreme points, and the Lagrange multiplier method for optimization.
Approximation by Smooth Functions
Log in to Mediaspace to watch this video
Discusses approximation by smooth functions and the convergence of function sequences in normed vector spaces.
Preliminaries in Measure Theory
Log in to Mediaspace to watch this video
Covers the preliminaries in measure theory, including loc comp, separable, complete metric space, and tightness concepts.
Previous
Page 2 of 3
Next