Home /  Workshop /  Schedules /  The largest common subtree of uniform attachment trees

The largest common subtree of uniform attachment trees

Introductory Workshop: Probability and Statistics of Discrete Structures January 27, 2025 - January 31, 2025

January 30, 2025 (03:30 PM PST - 04:30 PM PST)
Speaker(s): Miklós Rácz (Northwestern University)
Location: SLMath: Eisenbud Auditorium, Online/Virtual
Primary Mathematics Subject Classification No Primary AMS MSC
Secondary Mathematics Subject Classification No Secondary AMS MSC
Video

The largest common subtree of uniform attachment trees

Abstract

Zoom Link

Consider two independent uniform attachment trees with n nodes each -- how large is their largest common subtree? Our main result gives a lower bound of n^{0.83}. We also give some upper bounds and bounds for general random tree growth models. This is based on joint work with Johannes Bäumler, Bas Lodewijks, James Martin, Emil Powierski, and Anirudh Sridhar.

Supplements No Notes/Supplements Uploaded
Video/Audio Files

The largest common subtree of uniform attachment trees

Troubles with video?

Please report video problems to itsupport@slmath.org.

See more of our Streaming videos on our main VMath Videos page.