Graph Theory: 50. Maximum vs Maximal
Here we describe the difference between two similar sounding words in mathematics: maximum and maximal. We use concepts in graph theory to highlight the difference. In particular, we define an independent set in a graph and a component in a graph and look at some examples. -- Bits of Gra
From playlist Graph Theory part-9
Julia Komjathy: Weighted distances in scale free random graph models
Abstract: In this talk I will review the recent developments on weighted distances in scale free random graphs as well as highlight key techniques used in the proofs. We consider graph models where the degree distribution follows a power-law such that the empirical variance of the degrees
From playlist Probability and Statistics
Topics in Combinatorics lecture 10.0 --- The formula for entropy
In this video I present the formula for the entropy of a random variable that takes values in a finite set, prove that it satisfies the entropy axioms, and prove that it is the only formula that satisfies the entropy axioms. 0:00 The formula for entropy and proof that it satisfies the ax
From playlist Topics in Combinatorics (Cambridge Part III course)
Minimum and Maximum Degree Vertices in Complement Graphs | Graph Complements, Graph Theory
How do we know what vertices will have the minimum and maximum degree of a complement graph based on the degrees of the original graph? We go over properties about just this topic in today's video graph theory lesson! Let G be a graph with vertices v and u such that the degree of v is the
From playlist Graph Theory
Entropy production during free expansion of an ideal gas by Subhadip Chakraborti
Abstract: According to the second law, the entropy of an isolated system increases during its evolution from one equilibrium state to another. The free expansion of a gas, on removal of a partition in a box, is an example where we expect to see such an increase of entropy. The constructi
From playlist Seminar Series
From playlist Contributed talks One World Symposium 2020
Computing Limits from a Graph with Infinities
In this video I do an example of computing limits from a graph with infinities.
From playlist Limits
Physics - Thermodynamics 2: Ch 32.7 Thermo Potential (10 of 25) What is Entropy?
Visit http://ilectureonline.com for more math and science lectures! In this video explain and give examples of what is entropy. 1) entropy is a measure of the amount of disorder (randomness) of a system. 2) entropy is a measure of thermodynamic equilibrium. Low entropy implies heat flow t
From playlist PHYSICS 32.7 THERMODYNAMIC POTENTIALS
Bound on the Sum of Minimum Degrees of Graphs and their Complements | Graph Theory Proofs
We know the degree of a vertex in a simple graph with n vertices has an upper bound of n-1. The degree of a vertex is n-1 when it is adjacent to every vertex in the graph except for itself (it cannot be adjacent to itself). Then certainly the minimum degree of a graph is less than or equal
From playlist Graph Theory
Optimal Mixing of Glauber Dynamics: Entropy Factorization via High-Dimensional Expan - Zongchen Chen
Computer Science/Discrete Mathematics Seminar I Topic: Optimal Mixing of Glauber Dynamics: Entropy Factorization via High-Dimensional Expansion Speaker: Zongchen Chen Affiliation: Georgia Institute of Technology Date: February 22, 2021 For more video please visit http://video.ias.edu
From playlist Mathematics
Rick Kenyon - The multinomial Ising model
The multinomial Ising model on a graph $G=(V,E)$ is the Ising model on the N-fold “blow-up” $G_N$ of $G$, whose vertices are $V\times[N]$, and edges connect $(u,i)$ to $(v,j)$ iff $u$ and $v$ are adjacent. In the limit of large $N$ we find the critical temperature, phase transitions,
From playlist 100…(102!) Years of the Ising Model
Learning models: connections between boosting...and regularity II - Russell Impagliazzo
Computer Science/Discrete Mathematics Seminar II Topic: Learning models: connections between boosting...regularity II Speaker: Russell Impagliazzo Affiliation: University of California, San Diego Date: November 14, 2017 For more videos, please visit http://video.ias.edu
From playlist Mathematics
AQC 2016 - The Quantum Spin Glass Transition on the Regular Random Graph
A Google TechTalk, June 28, 2016, presented by Antonello Scardicchio (ICTP) ABSTRACT: I will report on our work aimed at understanding the properties of the quantum spin glass transition (at zero temperature) of the Ising spin glass with transverse field. We have performed a Montecarlo s
From playlist Adiabatic Quantum Computing Conference 2016
Probabilistic analysis of random CSPs - Nike Sun
Marston Morse Lectures Topic: Probabilistic analysis of random CSPs Speaker: Nike Sun Affiliation: Massachusetts Institute of Technology Date: April 21, 2021 For more video please visit http://video.ias.edu
From playlist Mathematics
Statistical Rethinking - Lecture 13
Lecture 13 - Generalized Linear Models (intro) - Statistical Rethinking: A Bayesian Course with R Examples
From playlist Statistical Rethinking Winter 2015
Recursively Applying Constructive Dense Model Theorems and Weak Regularity - Russell Impagliazzo
Russell Impagliazzo University of California, San Diego; Member, School of Mathematics February 7, 2011 For more videos, visit http://video.ias.edu
From playlist Mathematics
Carlo Baldassi: "On the existence of wide flat minima in neural network landscapes: analytic and..."
Machine Learning for Physics and the Physics of Learning 2019 Workshop IV: Using Physical Insights for Machine Learning "On the existence of wide flat minima in neural network landscapes: analytic and algorithm approaches" Carlo Baldassi - Bocconi University Abstract: The techniques c
From playlist Machine Learning for Physics and the Physics of Learning 2019
Regularized Functional Inequalities and Applications to Markov Chains by Pierre Youssef
PROGRAM: TOPICS IN HIGH DIMENSIONAL PROBABILITY ORGANIZERS: Anirban Basak (ICTS-TIFR, India) and Riddhipratim Basu (ICTS-TIFR, India) DATE & TIME: 02 January 2023 to 13 January 2023 VENUE: Ramanujan Lecture Hall This program will focus on several interconnected themes in modern probab
From playlist TOPICS IN HIGH DIMENSIONAL PROBABILITY
Uncovering universality in the entanglement of strongly chaotic subsystems by Arul Lakshminarayan
Indian Statistical Physics Community Meeting 2016 URL: https://www.icts.res.in/discussion_meeting/details/31/ DATES Friday 12 Feb, 2016 - Sunday 14 Feb, 2016 VENUE Ramanujan Lecture Hall, ICTS Bangalore This is an annual discussion meeting of the Indian statistical physics community wh
From playlist Indian Statistical Physics Community Meeting 2016
Largest Possible Number of Edges for Various Types of Graphs
The video explains how to determine the maximum number of possible edges for various types of graphs. mathispower4u.com
From playlist Graph Theory (Discrete Math)