Component Finite Subgraphs of Treeings
Offered By: Centre de recherches mathématiques - CRM via YouTube
Course Description
Overview
Explore the mathematical concepts of component finite subgraphs of treeings in this 22-minute conference talk by Riley Thornton at the Centre de recherches mathématiques (CRM). Delve into the upper and lower bounds on the size of measurable component finite subgraphs of regular treeings, which is equivalent to bounding the measure of hyperfinite subgraphs of the associated Bernoulli graphing. Discover how sharp bounds are achieved for d=3, and learn about the estimates for d greater than 3 using the differential equations method from probabilistic combinatorics. Gain insights into this specialized topic within measured group theory as part of the "Théories des groups mesurée/ Measured Group Theory" conference held in March 2023.
Syllabus
Riley Thornton: Component finite subgraphs of treeings
Taught by
Centre de recherches mathématiques - CRM
Related Courses
Aplicaciones de la teoría de grafos a la vida realMiríadax Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X] Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer