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
Percolation: Random Graph Models
Graph Chatbot
Related lectures (45)
Graphical Models: Representing Probabilistic Distributions
Covers graphical models for probabilistic distributions using graphs, nodes, and edges.
Probabilistic method and its applications
Introduces the probabilistic method to prove existence results in graph theory.
Fixed Points in Graph Theory
Focuses on fixed points in graph theory and their implications in algorithms and analysis.
Percolation Theory
Covers percolation theory, absorbed polymers, giant molecules, phase transition, scaling assumptions, and universal behavior in percolation models.
Phase Transitions: Percolation in 2D Networks
Explores phase transitions through percolation in 2D networks.
Belief Propagation
Explores Belief Propagation in graphical models, factor graphs, spin glass examples, Boltzmann distributions, and graph coloring properties.
Graph Models and Brain Connectomics
Explores graph theory in brain connectomics, MRI applications, network analysis relevance, and individual fingerprinting.
Networked Control Systems: Opportunities
Explores coordination in networked control systems, graph theory, and consensus algorithms.
Stochastic Block Model
Covers the Stochastic Block Model and its application in community detection, exploring its mathematical formulation and challenges.
Random Field Ising Model on Graphs
Explores the Random Field Ising Model on random graphs, discussing belief propagation updates and population dynamics.
Graph Theory: Girth and Independence
Log in to Mediaspace to watch this video
Covers girth, independence, probability, union bound, sets, and hypergraph recoloring.
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.
Graph Coloring and Directed Cycles
Log in to Mediaspace to watch this video
Explores graph coloring, directed cycles, LLL algorithm applications, and element dependencies in graphs.
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
Log in to Mediaspace to watch this video
Introduces network data structures, models, and analysis techniques, emphasizing permutation invariance and Erdős-Rényi networks.
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.
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.
Probability & Stochastic Processes
Log in to Mediaspace to watch this video
Covers applied probability, stochastic processes, Markov chains, rejection sampling, and Bayesian inference methods.
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.
Conditional Statements & Graph Theory
Log in to Mediaspace to watch this video
Covers conditional statements and graph theory, including proof techniques and concepts related to graphs, paths, connectivity, and gossip protocols.
Previous
Page 1 of 3
Next
