Randomly Generated Graphs - Intro to Algorithms
This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.
From playlist Introduction to Algorithms
What are Irregular Graphs? (and why they are boring) | Graph Theory
What are irregular graphs? After learning about regular graphs, this is a natural question to ask. Irregular graphs are the opposite of regular graphs, which means that irregular graphs are graphs in which all vertices have distinct degrees. Equivalently, a graph is irregular if and only i
From playlist Graph Theory
On the Number of Hamilton Cycles in Psdueo-Random Graphs - Michael Krivelevich
Michael Krivelevich Tel Aviv University October 17, 2011 A pseudo-random graph is a graph G resembling a typical random graph of the same edge density. Pseudo-random graphs are expected naturally to share many properties of their random counterparts. In particular, many of their enumerati
From playlist Mathematics
Spectral Geometry of Random Graphs - Igor Rivin
Igor Rivin Temple University; Member, School of Mathematics October 20, 2010 we will describe various models of sparse and planar graphs and the associated distributions of eigenvalues (and eigenvalue spacings) which come up. The talk will be light on theorems, and heavy on experimental da
From playlist Mathematics
What are Regular Graphs? | Graph Theory
What is a regular graph? That is the subject of today's math lesson! A graph is regular if and only if every vertex in the graph has the same degree. If every vertex in a graph has degree r, then we say that graph is "r-regular" or "regular of degree r". If a graph is not regular, as in, i
From playlist Graph Theory
Local eigenvalue statistics for random regular graphs - Bauerschmidt
Analysis Seminar Topic: Local eigenvalue statistics for random regular graphs Speaker: Roland Bauerschmidt Date: Wednesday, March 16 I will discuss results on local eigenvalue statistics for uniform random regular graphs. For graphs whose degrees grow slowly with the number of vertic
From playlist Mathematics
What is a Highly Irregular Graph? | Locally Irregular Graph, Graph Theory
Irregular graphs are a bit tricky to define, because the most intuitive definition leads to nothing of interest. In today's math video lesson, we introduce an alternative definition of irregular graph, with plenty of examples, called a highly irregular graph! These graphs are also sometime
From playlist Graph Theory
Omer Bobrowski: Random Simplicial Complexes, Lecture III
A simplicial complex is a collection of vertices, edges, triangles, tetrahedra and higher dimensional simplexes glued together. In other words, it is a higher-dimensional generalization of a graph. In recent years there has been a growing effort in developing the theory of random simplicia
From playlist Workshop: High dimensional spatial random systems
13. Sparse regularity and the Green-Tao theorem
MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62qauV_CpT1zKaGG_Vj5igX After discussion of Ramanujan graphs, Prof. Zhao discusse
From playlist MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019
10. Szemerédi's graph regularity lemma V: hypergraph removal and spectral proof
MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62qauV_CpT1zKaGG_Vj5igX In this first half of this lecture, Prof. Zhao shows how
From playlist MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019
Regularity methods in combinatorics, number theory, and computer science - Jacob Fox
Marston Morse Lectures Topic: Regularity methods in combinatorics, number theory, and computer science Speaker: Jacob Fox Affiliation: Stanford University Date: October 24, 2016 For more videos, visit http://video.ias.edu
From playlist Mathematics
6. Szemerédi's graph regularity lemma I: statement and proof
MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62qauV_CpT1zKaGG_Vj5igX Szemerédi's graph regularity lemma is a powerful tool in
From playlist MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019
Graph regularity and counting lemmas - Jacob Fox
Conference on Graphs and Analysis Jacob Fox June 5, 2012 More videos on http://video.ias.edu
From playlist Mathematics
Catherine Greenhill (UNSW), The small subgraph conditioning method and hypergraphs, 26th May 2020
Speaker: Catherine Greenhill (UNSW) Title: The small subgraph conditioning method and hypergraphs Abstract: The small subgraph conditioning method is an analysis of variance technique which was introduced by Robinson and Wormald in 1992, in their proof that almost all cubic graphs are Ha
From playlist Seminars
Many Nodal Domains in Random Regular Graphs by Nikhil Srivastava
COLLOQUIUM MANY NODAL DOMAINS IN RANDOM REGULAR GRAPHS SPEAKER: Nikhil Srivastava (University of California, Berkeley) DATE: Tue, 21 December 2021, 16:30 to 18:00 VENUE:Online Colloquium ABSTRACT Sparse random regular graphs have been proposed as discrete toy models of physical sys
From playlist ICTS Colloquia
16. Graph limits III: compactness and applications
MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62qauV_CpT1zKaGG_Vj5igX Continuing the discussion of graph limits, Prof. Zhao pro
From playlist MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019
15. Graph limits II: regularity and counting
MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62qauV_CpT1zKaGG_Vj5igX Prof. Zhao explains how graph limits can be used to gener
From playlist MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019
Omer Bobrowski: Random Simplicial Complexes, Lecture I
A simplicial complex is a collection of vertices, edges, triangles, tetrahedra and higher dimensional simplexes glued together. In other words, it is a higher-dimensional generalization of a graph. In recent years there has been a growing effort in developing the theory of random simplicia
From playlist Workshop: High dimensional spatial random systems