AutumnColors
  1. L. Eslava, Depth of vertices with high degree in random recursive trees (19 pages).

    ALEA, Lat. Am. J. Probab. Math. Stat. 10.30757/ALEA.v19-33

  2. L. Eslava, S. Penington, F. Skerman Survival for a Galton-Watson tree with cousin mergers (8 pages)

    Procedia Computer Science. doi:10.1016/j.procs.2021.11.054

  3. L. Eslava, A non-increasing tree growth process for recursive trees and applications (26 pages).

    Combinatorics, Probability and Computing. doi:10.1017/S0963548320000073

  4. L. Addario-Berry, L. Eslava, High degrees of random recursive trees (15 pages)

    Random Structures and Algorithms. doi:10.1002/rsa.20753

  5. L. Addario-Berry, L. Eslava, Hitting time theorems for random matrices (31 pages)

    Combinatorics, Probability and Computing. doi:10.1017/S0963548314000285

  1. B. Reynoso, F. Baltazar-Larios, L. Eslava Maximum Likelihood Estimation for a Markov-Modulated Jump-Diffusion Model (15 pages)

  1. L. Eslava, S. Penington, F. Skerman A branching process with deletions and mergers that matches the threshold for hypercube percolation (43 pages)

  2. A. L. Eslava, B. Lodewijks, M. Ortgiese Fine asymptotics for the maximum degree in weighted recursive trees with bounded random weights (47 pages)

  3. A. Dailly, A. Hansberg, L. Eslava, D. Ventura The balancing number and list balancing number of some graph classes (16 pages)