Comment poussent les arbres (aléatoires) ?

Value of the Information & Strength of the Argument

The talk provides a clear and insightful overview of the Brownian CRT and its role as a universal scaling limit. The argumentation is solid, building from classical results (CLT, Brownian motion) to more advanced concepts (Gromov-Hausdorff convergence, tree growth algorithms). The speaker effectively uses simulations to illustrate abstract ideas. The presentation of ongoing research on tree growth algorithms adds value, showing the current state of the field. The argumentation is rigorous, with definitions and theorems stated precisely, though some technical details are omitted for brevity.

Scientific Rigor, Source Quality, Title Accuracy

The scientific rigor is high: the talk is based on well-established results (Aldous’s CRT) and recent research by the speaker and collaborators. The sources cited are primarily the conference website and implicit references to classical works (Aldous, Erdős–Rényi). The title accurately reflects the content. The presentation is suitable for a mathematical audience, with appropriate technical depth. No inconsistencies or unsupported claims were noted.

The title accurately reflects the content: the talk explains how random trees grow, focusing on the Brownian CRT and its scaling limits.

8/10

The talk is given by a recognized expert in probability theory, presenting established results (CRT convergence) and recent research. The mathematical content is rigorous, with clear definitions and references to classical theorems. The presentation is aimed at a scientific audience, and the speaker acknowledges ongoing work. No obvious errors or unsupported claims were detected.

Markers derived by PSI from the transcript: the creator did not define chapters.

• 00:00Introduction and motivation: from Gaussian law to Brownian motion
• 05:00Definition of binary trees and Catalan numbers
• 10:00Scaling limit of uniform binary trees: convergence to Brownian CRT
• 15:00Gromov-Hausdorff topology and real trees
• 20:00Construction of CRT via Poisson process and branching
• 25:00Applications: Erdős–Rényi graph and Brownian sphere
• 30:00Growth algorithms: Rémy's algorithm and Luczak-Winkler
• 35:00Diffusion on real trees and invariant measure
• 40:00Conclusion and outlook

• SMF 2025 Congress — Conference where the talk was given

• Aldous, D. (1991). The continuum random tree I — Foundational paper introducing the Brownian CRT.
• Le Gall, J.-F. (2019). Brownian geometry — Recent survey on Brownian geometry, including CRT and Brownian sphere.