✳flâneur — a map of the web's best reading
anna
abrandenberger.github.io · 792 words · saved by 11 readers
I am a PSI masters' student at the Perimeter Institute for Theoretical Physics. I'm also building Curius, a social bookmarker - check it out!
anna --> --> Anna Brandenberger MIT Mathematics abrande[at]mit.edu I'm currently a PhD candidate at MIT, advised by Elchanan Mossel . The largest common subtree of two random trees . 2026. Asymptotics for the harmonic descent chain and applications to critical beta-splitting trees . 2025. Detecting Abrupt Changes in Point Processes: Fundamental Limits and Applications . 2025. Finding the root in random nearest neighbor trees . 2024. Errors are Robustly Tamed in Cumulative Knowledge Processes . 2023. Universal height and width bounds for random trees . 2022. The Horton-Strahler number of condit
Explore this link on the map →saved by
- Martyna Stawna
- Jaime Redondo Yuste
- Linda
- Aryan Naik
- Christian Larsen
- Benedict Neo
- Stephen Fay
- Ellie Popoca
- 4606
- Yingfan
- agniv sarkar
related reading
- What's new | Updates on my research and expository papers, discussion of open problems, and other maths-related topics. By Terence Taoterrytao.wordpress.com
- Elicit: AI for scientific researchelicit.com
- random_graphs.pdfinst.eecs.berkeley.edu
- Elicit: AI for scientific researchelicit.org
- LNCS 1879 - K-D Trees Are Better When Cut on the Longest Sideweb.cs.ucdavis.edu
- Nike Sunmath.mit.edu
- GitHub - socketteer/loom: Multiversal tree writing interface for human-AI collaboration · GitHubgithub.com
- Random forest - Wikipediaen.wikipedia.org
- Emergent Ventures Winnersevwinners.org
- Arborescences of Random Covering Graphsarxiv.org
- Patrick Morrissites.google.com
- Cover times - spectralarxiv.org