AutumnColors

Publications and Preprints

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

    Annals of Institute Henri Poincaré B doi:10.1214/23-AIHP1361

  2. A. Dailly, A. Hansberg, L. Eslava, D. Ventura The balancing number and list balancing number of some graph classes

    Electronic Journal of Combinatorics doi:10.37236/10032

  3. A. L. Eslava, B. Lodewijks, M. Ortgiese Fine asymptotics for the maximum degree in weighted recursive trees with bounded random weights

    Stochastic Processes and their Applications doi:10.1016/j.spa.2023.01.012

  4. B. Reynoso, F. Baltazar-Larios, L. Eslava Maximum Likelihood Estimation for a Markov-Modulated Jump-Diffusion Model

    Springer Proceedings in Mathematics & Statistics doi:10.1007/978-3-031-12778-6_11

  5. L. Eslava, Depth of vertices with high degree in random recursive trees.

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

  6. L. Eslava, S. Penington, F. Skerman Survival for a Galton-Watson tree with cousin mergers

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

  7. L. Eslava, A non-increasing tree growth process for recursive trees and applications.

    Combinatorics, Probability and Computing. doi:10.1017/S0963548320000073

  8. L. Addario-Berry, L. Eslava, High degrees of random recursive trees.

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

  9. L. Addario-Berry, L. Eslava, Hitting time theorems for random matrices.

    Combinatorics, Probability and Computing. doi:10.1017/S0963548314000285

Preprints

  1. L. Eslava, S.I. López-Ortega, M.A. López-Ortiz Targeted cutting for random recursive trees .

Thesis dissertations