YoVDO

Eulerian Magnitude Homology - Subgraph Structure and Random Graphs

Offered By: Applied Algebraic Topology Network via YouTube

Tags

Graph Theory Courses Asymptotic Analysis Courses Random Graphs Courses Algebraic Topology Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the connection between graph magnitude homology group ranks and subgraph structure in this 47-minute talk by Giuliamaria Menara. Delve into the concepts of eulerian magnitude homology and discriminant magnitude homology, introduced in collaboration with Chad Giusti. Examine the relationship between eulerian magnitude homology group ranks on the first diagonal and specific subgraph class counts. Investigate the limiting behavior of eulerian magnitude homology groups for Erdos-Renyi random graphs and random geometric graphs, uncovering vanishing thresholds and characterizing magnitude homology group generators. Gain insights into the asymptotic estimate of expected eulerian magnitude homology rank along the first diagonal for these random graph models.

Syllabus

Giuliamaria Menara (3/27/24): Eulerian magnitude homology: subgraph structure and random graphs


Taught by

Applied Algebraic Topology Network

Related Courses

Analytic Combinatorics, Part I
Princeton University via Coursera
Analytic Combinatorics
Princeton University via Coursera
Algorithmic Thinking (Part 1)
Rice University via Coursera
Capstone: Analyzing (Social) Network Data
University of California, San Diego via Coursera
Теория функций комплексного переменного
Higher School of Economics via Coursera