Random Graphs Courses and Certifications

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

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

Fields Institute

Sharp Thresholds for 1-Balanced Factors in Random Graphs

Explore the mathematical concept of sharp thresholds for 1-balanced factors in random graphs with Fabian Burghart from Eindhoven University of Technology.

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

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

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

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

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

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

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

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

BIMSA

The Chromatic Number of Random Graphs

Explore the chromatic number of random graphs, focusing on lower bounds for G(n,1/2) and its limiting distribution. Discover recent advancements in graph theory and probabilistic methods.

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

BIMSA

Simonovits's Theorem in Random Graphs

Explore Simonovits's theorem in random graphs with Wojciech Samotij. Gain insights into extremal and probabilistic combinatorics from an award-winning mathematician.

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

ACM SIGPLAN

Probabilistic Programming Interfaces for Random Graphs: Markov Categories, Graphons, and Nominal Sets - POPL 2024

Explore semantic models of probabilistic programming languages over graphs, connecting graphons to equational theories through Markov categories, measure-theoretic probability, and nominal sets.

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

Hausdorff Center for Mathematics

Clara Stegehuis- Optimization-Based Analysis of Random Graphs I

Explore random graph models, focusing on power-law degree distributions and optimization-based methods to analyze network properties and underlying geometries.

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