Random Graphs Courses and Certifications

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

International Centre for Theoretical Sciences

The Random Friend Tree by Serte Donderwinkel

Explore the Random Friend Tree model in network science, examining its structural properties, dynamics, and applications in social networks and complex systems.

• YouTube
• 1 hour 16 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

International Centre for Theoretical Sciences

Spectrum of Sparse Inhomogeneous Random Graphs

Explore the spectrum of sparse inhomogeneous random graphs, examining structural properties and applications in network science, probability theory, and statistical physics.

• YouTube
• 1 hour 1 minute
• On-Demand
• Free Video

International Centre for Theoretical Sciences

Path Convergence of Markov Chains on Large Graphs

Explore path convergence of Markov chains on large graphs, examining theoretical aspects and applications in network science, probability theory, and complex systems analysis.

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

International Centre for Theoretical Sciences

Detecting Geometry in Networks

Explore methods for uncovering geometric structures in complex networks, focusing on innovative techniques and applications in network analysis and data science.

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

International Centre for Theoretical Sciences

Algorithms on Networks

Explore algorithms for network analysis, optimization, and control. Learn techniques for solving complex problems on graphs and networks, with applications in various fields.

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

International Centre for Theoretical Sciences

Best Arm Identification Through Fluid-Based Methods

Explore fluid-based methods for best arm identification in multi-armed bandit problems. Learn innovative techniques to optimize decision-making in uncertain environments.

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

International Centre for Theoretical Sciences

Well Posedness for Hamilton-Jacobi Equations for Linearly Controlled Gradient Flows

Explore well-posedness of Hamilton-Jacobi equations for linearly controlled gradient flows, examining mathematical foundations and applications in optimization and control theory.

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

International Centre for Theoretical Sciences

Asymptotics of Invariant Measures of Mean-field Markov Models on Countable State Spaces

Explore asymptotics of invariant measures in mean-field Markov models on countable spaces. Gain insights into network science, probability theory, and applications in complex systems and data analysis.

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

International Centre for Theoretical Sciences

The Friendship Paradox for Sparse Random Graphs

Explore the friendship paradox in sparse random graphs, examining structural properties and implications for network analysis and social dynamics.

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

Applied Algebraic Topology Network

Eulerian Magnitude Homology - Subgraph Structure and Random Graphs

Explore connections between magnitude homology group ranks and graph substructures. Introduces eulerian and discriminant magnitude homology, relating them to subgraph counts and random graph models.

• YouTube
• 47 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

Society for Industrial and Applied Mathematics

Random Monomial Ideals - Seminar on Applied Geometry and Algebra

Explore probabilistic models of random monomial ideals, their properties, and applications in algebraic geometry. Gain insights into average behavior of ideals and potential for generating algebraic objects.

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

Institute for Advanced Study

A New Approach to Strong Convergence - Lecture 1

Explore a novel approach to strong convergence in graph theory, addressing Alon's conjecture and extending Friedman's theorem with applications to random graphs, geometry, and operator algebras.

• YouTube
• 2 hours 7 minutes
• On-Demand
• Free Video