
Explore the intersection of probability and geometry in non-Euclidean spaces through Hugo Parlier's insightful conference talk on graphs and curves.

Explore tail bounds for detection times in mobile hyperbolic graphs. Gain insights into probability and geometry in non-Euclidean spaces through this mathematical conference talk.

Explore combinatorial maps and hyperbolic surfaces in high genus through Baptiste Louf's insightful conference talk, delving into advanced mathematical concepts and their applications.

Explore random maps and 2D geometries, examining scaling limits, combinatorial tools, and connections to conformal random fields. Gain insights into discrete random metric surfaces and their convergence properties.

Explore asymptotics of graph complex Euler characteristics with M. Borinsky, delving into algebra, topology, and the Grothendieck-Teichmüller group.

Explore integrality gaps for vertex covers on sparse Bernoulli hypergraphs with insights from ETH Zurich researcher D. Dmitriev.

Explore the intersection graph of finite simple groups in this concise mathematical presentation by S.D Freedman from the University of St Andrews.

Explore analytic techniques in dynamics and geometry, focusing on Lorentzian scattering rigidity and stationary metrics.

Explore inverse isoperimetric problems in graphs, focusing on the Fourier-Entropy-Influence conjecture and related inequalities. Progress and applications in PAC learning discussed.

Explore inverse isoperimetric problems in graphs, focusing on the Fourier-Entropy-Influence conjecture and related inequalities. Progress and applications discussed.

Explores inverse isoperimetric problems in graphs, focusing on the Fourier-Entropy-Influence conjecture and related inequalities, with applications to PAC learning and other areas.

Explore inverse isoperimetric problems in graphs, focusing on the Fourier-Entropy-Influence conjecture and related inequalities. Discover applications to PAC learning and recent progress in the field.

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.

Explore dynamics of heterogeneous networks with Tiago Pereira at IMPA's International Conference on Dynamical Systems, celebrating Marcelo Viana's 60th birthday and featuring top researchers.

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.

Explore cutting-edge research in randomness and network learning. Engage with experts, attend minicourses, and collaborate on open problems in discrete probability and network statistics.

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.

Explore recent advancements in dynamic graph algorithms, focusing on efficient data structures and techniques for handling evolving network structures.

Explore expanders and property testing in graph theory, focusing on their applications and connections to theoretical computer science.

Explore Fiedler vector perturbation and its applications in graph measures and shape analysis, gaining insights into advanced mathematical concepts.

Discover practical discrete math concepts to enhance your programming skills, from Boolean algebra to graph theory, without complex equations.