I am a PhD. Student at the Dept. Mathematics and Statistics, in McGill University under the supervision of Louigi Addario-Berry.
I like to work on problems related to Probabilistic Combinatorics and random structures. Specially stochastic processes on random networks.
Winter 2016: MATH 363 Discrete Mathematics
Publications:3. Laura Eslava, Depth of vertices with high degree in random recursive trees, preprint.
2. Louigi Addario-Berry, Laura Eslava, High degrees of random recursive trees, submitted to Random Structures and Algorithms.
1. Louigi Addario-Berry, Laura Eslava, Hitting time theorems for random matrices, Combinatorics, Probability and Computing.Vol 23 (2014), 635-669.
Some slides:3. Depths of high degree vertices in random recursive trees.
2. High degrees of random recursive trees.
1. Hitting time theorems for random matrices.
2013 M.A. Mathematics
Dept. Mathematics and Statistics, McGill university
Thesis: The rank of symmetric random matrices via a graph process
Advisor: Louigi Addario-Berry.
2010 B.Sc. (Hons) Mathematics
Facultad de Ciencias, UNAM
Honours Thesis: El teorema de Kesten sobre percolación de aristas en el plano, (Spanish)
Advisor: Gerónimo Uribe.
When I'm thinking,
all that remains outside become silent.
Inside my mind resounds a clear, loud voice.
Then I come back.
I'm afraid that people around me could have noticed
the cheerful and ebullient discussions inside myself.
(What a great feeling to sink in thought!)