Hitting Time Theorems for Random Matrices. - Louigi Addario-Berry; Laura Eslava (Comb. Probab. Comput., 2014)

High degrees in recursive trees. - Laura Eslava; Louigi Addario-Berry (Electron. Notes Discret. Math., 2015)

Depth of vertices with high degree in random recursive trees. - Laura Eslava (CoRR, 2016)

High degrees in random recursive trees. - Louigi Addario-Berry; Laura Eslava (Random Struct. Algorithms, 2018)

Survival for a Galton-Watson tree with cousin mergers. - Laura Eslava; Sarah Penington; Fiona Skerman (LAGOS, 2021)

A non-increasing tree growth process for recursive trees and applications. - Laura Eslava (Comb. Probab. Comput., 2021)

The Balancing Number and Generalized Balancing Number of Some Graph Classes. - Antoine Dailly; Laura Eslava; Adriana Hansberg; Denae Ventura (Electron. J. Comb., 2023)

Quenched worst-case scenario for root deletion in targeted cutting of random recursive trees. - Laura Eslava; Sergio I. López; Marco Antonio López-Ortiz (J. Appl. Probab., 2025)