Poisson U Statistics Subgraph and Component Counts in Random Geometric Graphs
Hausdorff Center for Mathematics via YouTube
The Fastest Way to Become a Backend Developer Online
Get 20% off all career paths from fullstack to AI
Overview
AI, Data Science & Cloud Certificates from Google, IBM & Meta — 40% Off
One plan covers every Professional Certificate on Coursera. 40% off Coursera Plus Annual.
Unlock All Certificates
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