Laura Eslava

According to our database, Laura Eslava authored at least 8 papers between 2014 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

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

2023

The Balancing Number and Generalized Balancing Number of Some Graph Classes.

Antoine Dailly, Laura Eslava, Adriana Hansberg, Denae Ventura

Electron. J. Comb., 2023

2021

A non-increasing tree growth process for recursive trees and applications.

Laura Eslava

Comb. Probab. Comput., 2021

Survival for a Galton-Watson tree with cousin mergers.

Laura Eslava, Sarah Penington, Fiona Skerman

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2018

High degrees in random recursive trees.

Louigi Addario-Berry, Laura Eslava

Random Struct. Algorithms, 2018

2016

Depth of vertices with high degree in random recursive trees.

Laura Eslava

CoRR, 2016

2015

High degrees in recursive trees.

Laura Eslava, Louigi Addario-Berry

Electron. Notes Discret. Math., 2015

2014

Hitting Time Theorems for Random Matrices.

Louigi Addario-Berry, Laura Eslava

Comb. Probab. Comput., 2014