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
Belief Propagation on Trees
Graph Chatbot
Related lectures (32)
Statistical Physics of Clusters
Explores the statistical physics of clusters, focusing on complexity and equilibrium behavior.
Graph Coloring: Random vs Symmetrical
Compares random and symmetrical graph coloring in terms of cluster colorability and equilibrium.
Curie Weiss Model
Covers the Curie-Weiss model in Statistical Physics, including magnetization probability, free entropy, and the cavity method.
Random Field Ising Model: Overview and Analysis
Provides an in-depth analysis of the Random Field Ising Model, covering model description, free entropy, and mean field algorithm.
Phase Equilibria: Understanding Vapor-Liquid Separation
Provides an overview of vapor-liquid phase diagrams and their role in separation processes, focusing on phase equilibria and the Gibbs phase rule.
Replica Symmetry Breaking: Full Solution & Condensation
Explores Replica Symmetry Breaking in the Random Energy Model, discussing configurational entropy and condensation.
Complexity & Induction: Algorithms & Proofs
Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.
Random-Subcube Model
Introduces the Random-Subcube Model (RSM) for constraint satisfaction problems, exploring its structure, phase transitions, and variable freezing.
Phase Transition in Ising Model
Explores phase transitions in the Ising model, discussing equilibrium states, magnetization, and critical points.
Algorithmic Complexity: Travel Time Analysis
Covers algorithmic complexity and travel time analysis, focusing on measuring the time taken by algorithms and evaluating their performance.
Second Law of Thermodynamics
Explores the Second Law of Thermodynamics, Gibbs Free Energy, equilibrium constants, and Le Châtelier's Principle.
Symmetry and Conservation in the Cell
Explores exceptions to thermodynamics, entropy, free energy, entropic springs, phase transitions, and polymer mixtures in cellular organization.
Understanding Complexity: Tractable Problems and NP-Complete
Covers complexity classes, effect on computer time, tractable problems, class NP, and NP-complete problems.
Understanding Complexity: Algorithms and NP Problems
Covers complexity classes, tractable problems, the class NP, NP-complete problems, and summarizes the concept of tractable problems.
Algorithmic Challenges: Solutions and Optimization
Explores algorithmic challenges, time complexity, optimization, recursion, and probability calculations.
Energy Minimization in Biological Systems: Equilibrium Models
Covers energy minimization models in biological systems, focusing on equilibrium and the roles of entropy and hydrophobicity.
Free-energy of solids: origins and consequences of the 1983 CECAM workshop
Explores the historical significance of the 1983 CECAM workshop on the free-energy of solids and its impact on developing free-energy methods for hard-core models.
Dynamic Programming: Solving Sequential Problems Efficiently
Explores dynamic programming for efficient problem-solving, illustrated with binomial coefficients and Pascal's triangle.
Theory of Computation: Decidability and Complexity
Log in to Mediaspace to watch this video
Delves into the theory of computation, covering decidability, complexity, P vs. NP, and reductions.
Graph Coloring: Entropy and Free Energy
Log in to Mediaspace to watch this video
Explains entropy and free energy computation in graph coloring.
Previous
Page 1 of 2
Next
