Laura Eslava

activity

20132022

most citedHigh degrees of random recursive trees

14 citations · 33 across the 9 of their papers we have counts for

collaborators

9 papers

math.PR2022

Targeted cutting of random recursive trees

Laura Eslava, Sergio I. López, Marco L. Ortiz

We propose a method for cutting down a random recursive tree that focuses on its higher degree vertices. Enumerate the vertices of a random recursive tree of size $n$ according to…

q-fin.MF2022

Maximum Likelihood Estimation for a Markov-Modulated Jump-Diffusion Model

Laura Eslava, Fernando Baltazar-Larios, Bor Reynoso

We propose a method for obtaining maximum likelihood estimates (MLEs) of a Markov-Modulated Jump-Diffusion Model (MMJDM) when the data is a discrete time sample of the diffusion pr…

math.PR2021★ 6 cited

Fine asymptotics for the maximum degree in weighted recursive trees with bounded random weights

Laura Eslava, Bas Lodewijks, Marcel Ortgiese

A weighted recursive tree is an evolving tree in which vertices are assigned random vertex-weights and new vertices connect to a predecessor with a probability proportional to its…

math.PR2021

A branching process with deletions and mergers that matches the threshold for hypercube percolation

Laura Eslava, Sarah Penington, Fiona Skerman

We define a graph process $G (p, q)$ based on a discrete branching process with deletions and mergers, which is inspired by the 4-cycle structure of both the hypercube $Q_d…

math.CO2020★ 2 cited

The balancing number and list balancing number of some graph classes

Antoine Dailly, Adriana Hansberg, Laura Eslava +1

Given a graph $G$ , a 2-coloring of the edges of $K_{n}$ is said to contain a balanced copy of $G$ if we can find a copy of $G$ such that half of its edges is in each color class. If…

math.PR2017★ 4 cited

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

Laura Eslava

We introduce a non-increasing tree growth process $((T_{n}, σ_{n}), n \geq 1)$ , where $T_{n}$ is a rooted labeled tree on $n$ vertices and $σ_{n}$ is a permutation of the vertex labels. The…

math.PR2016

Depth of vertices with high degree in random recursive trees

Laura Eslava

Let $T_{n}$ be a random recursive tree with $n$ nodes. List vertices of $T_{n}$ in decreasing order of degree as $v^{1}, \dots, v^{n}$ , and write $d^{i}$ and $h^{i}$ for the degree of $v^{i}$ and…

math.CO2015★ 14 cited

High degrees of random recursive trees

Louigi Addario-Berry, Laura Eslava

For $n \geq 1$ , let $T_{n}$ be a random recursive tree on the vertex set $[n] = {1, \dots, n}$ . Let $deg_{T_{n}} (v)$ be the degree of vertex $v$ in $T_{n}$ , that is, the number of…

math.PR2013★ 7 cited

Hitting time theorems for random matrices

Louigi Addario-Berry, Laura Eslava

Starting from an n-by-n matrix of zeros, choose uniformly random zero entries and change them to ones, one-at-a-time, until the matrix becomes invertible. We show that with probabi…