YoVDO

Universality of Random Graphs - Gal Kronenberg

Offered By: Institute for Advanced Study via YouTube

Tags

Graph Theory Courses Discrete Mathematics Courses Random Graphs Courses

Course Description

Overview

Explore the concept of 2-universality in random graphs through this comprehensive seminar talk by Gal Kronenberg from Tel Aviv University. Delve into monotone increasing graph properties, age universality, and the determination of probability thresholds. Learn about the key theorem and its proof, including the connecting lemma and expansion properties. Examine examples and problems related to the topic, gaining insights into this fascinating area of discrete mathematics and computer science.

Syllabus

Intro
monotone increasing graph properties
examples
age
universality
Determining the probability threshold
Theorem
Proof
Connecting lemma
Expansion properties
Example
Problem


Taught by

Institute for Advanced Study

Related Courses

Теория вероятностей для начинающих
Moscow Institute of Physics and Technology via Coursera
The Science of Networks - C4 Public Lectures
Santa Fe Institute via YouTube
Optimization of the Sherrington-Kirkpatrick Hamiltonian
IEEE via YouTube
Fast Uniform Generation of Random Graphs with Given Degree Sequences
IEEE via YouTube
Interacting Stochastic Processes on Random Graphs
Joint Mathematics Meetings via YouTube