Poisson U Statistics Subgraph and Component Counts in Random Geometric Graphs
Offered By: Hausdorff Center for Mathematics via YouTube
Course Description
Overview
Explore Poisson U statistics, subgraph counts, and component counts in random geometric graphs through this 47-minute lecture delivered as part of the Hausdorff Trimester Program on Applied and Computational Algebraic Topology. Delve into the mathematical concepts presented by Matthias Reitzner, gaining insights into the intricate relationships between these statistical and graph-theoretical elements. Enhance your understanding of advanced topics in algebraic topology and their applications in geometric probability.
Syllabus
Matthias Reitzner: Poisson U statistics Subgraph and Component Counts in Random Geometric Graphs
Taught by
Hausdorff Center for Mathematics
Related Courses
Optimal Topological Simplification of SurfacesApplied Algebraic Topology Network via YouTube Approximation of Compact Metric Spaces by Finite Samples
Applied Algebraic Topology Network via YouTube Computing Optimal Homotopies
Applied Algebraic Topology Network via YouTube Žiga Virk - Information Encoded in Persistence Diagrams
Applied Algebraic Topology Network via YouTube Barbara Giunti - Average Complexity of Barcode Computation for Vietoris-Rips Filtrations
Applied Algebraic Topology Network via YouTube