Unusually large components in near-critical Erdős-Rényi graphs via ballot theorems. - Umberto De Ambroggio; Matthew I. Roberts (Comb. Probab. Comput., 2022)

An elementary approach to component sizes in critical random graphs. - Umberto De Ambroggio (J. Appl. Probab., 2022)

Limit Laws for Critical Dispersion on Complete Graphs. - Umberto De Ambroggio; Tamás Makai; Konstantinos Panagiotou; Annika Steibel (AofA, 2024)

Small maximal clusters are very unlikely in critical random graphs. - Umberto De Ambroggio (CoRR, 2024)

Balanced Bidirectional Breadth-First Search on Scale-Free Networks. - Sacha Cerf; Benjamin Dayan; Umberto De Ambroggio; Marc Kaufmann; Johannes Lengler; Ulysse Schaller (CoRR, 2024)

A Simple Path to Component Sizes in Critical Random Graphs. - Umberto De Ambroggio (SIAM J. Discret. Math., 2024)

Dispersion on the Complete Graph. - Umberto De Ambroggio; Tamás Makai; Konstantinos Panagiotou (Random Struct. Algorithms, 2025)