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.
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.
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.
Scaling Exponents in Stationary Random Graphs
Explore scaling exponents in stationary random graphs, examining relationships between fractal dimension, walk dimension, resistance, spectral dimension, and extremal growth in statistical physics.
Sharp Threshold for Rigidity of Random Graphs
Explore the evolution of random graphs and discover key moments when they become rigid and globally rigid, with implications for vertex embedding and distance preservation.
Graph Limit for Interacting Particle Systems on Weighted Deterministic and Random Graphs
Explore graph limits for interacting particle systems on weighted deterministic and random structures in this advanced mathematical lecture.
Spectral Gap of the Laplacian for Random Hyperbolic Surfaces
Explore spectral gap of Laplacian for random hyperbolic surfaces in large genus limit. Delve into Weil-Petersson measure, Mirzakhani's work, and trace method applications.
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.
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.
Spectral Gap of the Laplacian for Random Hyperbolic Surfaces - Part 2
Explore spectral gap of Laplacian for random hyperbolic surfaces using trace method and asymptotic expansions in large genus limit. Analyze Weil-Petersson measure and Friedman-Ramanujan property.
The K-Distribution of Random Graph C*-Algebras
Explore the K-distribution of random graph C*-algebras, delving into advanced mathematical concepts and their applications in algebraic structures.
Towards an Optimal Spectral Gap Result for Random Compact Hyperbolic Surfaces
Explore recent progress in proving near-optimal spectral gaps for hyperbolic surfaces. Delve into trace methods, challenges, and new tools developed to improve bounds in spectral geometry.
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.
Canonical Colourings in Random Graphs
Explore canonical colourings in random graphs with Nina Kamčev, delving into extremal combinatorics, Ramsey theory, and asymptotic enumeration.
Partitioning a Tournament into Sub-Tournaments of High Connectivity
Explore tournament partitioning techniques to create highly connected sub-tournaments, delving into extremal and probabilistic combinatorics, Ramsey theory, and random graphs.
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.
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.
Global Synchronization: New Theorems and Puzzles in Kuramoto Oscillator Networks
Explore global synchronization in Kuramoto oscillator networks, examining critical connectivity thresholds and unsolved puzzles in network behavior.
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.
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.
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.