Random Graphs Courses and Certifications

BIMSA

Structures Robust Under Randomness - Probabilistic Combinatorics and Thresholds

Explore robustness of discrete system substructures under random subsampling, examining thresholds in random graphs and key conjectures in probabilistic combinatorics.

• YouTube
• 54 minutes
• On-Demand
• Free Video

BIMSA

Canonical Colourings in Random Graphs

Explore canonical colourings in random graphs with Nina Kamčev, delving into extremal combinatorics, Ramsey theory, and asymptotic enumeration.

• YouTube
• 51 minutes
• On-Demand
• Free Video

Instituto de Matemática Pura e Aplicada

Discrete Random Models - Minicourse 03

Explore discrete random models in this advanced mathematics workshop. Gain insights into probabilistic techniques for analyzing complex network structures and random processes.

• YouTube
• 1 hour 13 minutes
• On-Demand
• Free Video

Instituto de Matemática Pura e Aplicada

Interacting Particle Systems on Sparse W-Random Graphs

Explore interacting particle systems on sparse W-random graphs in this workshop. Gain insights from leading experts through plenary talks, contributed presentations, and collaborative sessions on randomness and network learning.

• YouTube
• 16 minutes
• On-Demand
• Free Video

Probabilistic Methods in Combinatorics

Master probabilistic methods in combinatorics and theoretical computer science, exploring random constructions, extremal set theory, and advanced mathematical concepts for proving existence of combinatorial objects.

• MIT OpenCourseWare
• On-Demand
• Free Online Course

The Science of Networks - C4 Public Lectures

Explore the emerging science of networks, their structure, and function across diverse systems. Learn about phase transitions, interdependence, and mathematical models for predicting network behavior and consequences.

• YouTube
• 1 hour 21 minutes
• On-Demand
• Free Video

Threshold for a Random Graph to Contain a Triangle - MIT 18.226

Explore probabilistic methods to determine when random graphs develop triangles, using first and second moment analysis techniques in combinatorial mathematics.

• YouTube
• 29 minutes
• On-Demand
• Free Video

Bounded Differences Inequality and Azuma-Hoeffding Inequality

Master probabilistic analysis through the Bounded Differences Inequality, exploring its applications in coupon collection and random graph coloring, with focus on Lipschitz functions and concentration bounds.

• YouTube
• 20 minutes
• On-Demand
• Free Video

IEEE

Optimization of the Sherrington-Kirkpatrick Hamiltonian

Explore the optimization of the Sherrington-Kirkpatrick Hamiltonian, covering stochastic block models, random graphs, and algorithmic insights for solving complex optimization problems.

• YouTube
• 23 minutes
• On-Demand
• Conference Talk

IEEE

Fast Uniform Generation of Random Graphs with Given Degree Sequences

Explore efficient algorithms for generating random graphs with specified degree sequences, focusing on rejection and switching methods.

• YouTube
• 20 minutes
• On-Demand
• Conference Talk

Institute for Advanced Study

Universality of Random Graphs - Gal Kronenberg

Explore 2-universality in random graphs, covering monotone properties, age universality, probability thresholds, and expansion properties with proof techniques and examples.

• YouTube
• 1 hour 9 minutes
• On-Demand
• Free Video

Joint Mathematics Meetings

Interacting Stochastic Processes on Random Graphs

Explore interacting stochastic processes on random graphs, covering models like voter and neuronal hox, and examining challenges in sparse regimes and local convergence.

• YouTube
• 1 hour 11 minutes
• On-Demand
• Conference Talk

Simons Institute

Structures in Random Graphs - New Connections

Exploring structures in random graphs, including cliques and independence numbers in Cayley graphs, thresholds for monotone properties, and edge-colorings of bipartite graphs.

• YouTube
• 1 hour 3 minutes
• On-Demand
• Free Video

International Centre for Theoretical Sciences

Alignment of Random Graphs: Informational and Computational Limits - Lecture 2

Explores informational and computational limits in aligning random graphs, focusing on advanced probabilistic techniques for data science and graph theory applications.

• YouTube
• 1 hour 2 minutes
• On-Demand
• Free Video

International Centre for Theoretical Sciences

Alignment of Random Graphs: Informational and Computational Limits - Lecture 1

Explore informational and computational limits of random graph alignment in this lecture by Laurent Massoulié, part of a data science discussion on probabilistic and optimization methods.

• YouTube
• 48 minutes
• On-Demand
• Free Video