AutumnColors

Slides

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

    Graduate level: (Talk at LAGOS 2021, 15 min),

    Coloquium: (Talk at CIRM 2020, 50 min),

    Expert: (Talk at Percolation Today 2021, 45 min).

  2. The size of the giant component in the random d-process.
  3. Properties for extreme-valued degrees in recursive trees (PhD Defense, 20 min).
  4. Properties for extreme-valued degrees in recursive trees (Talk at AofA 2017, 50 min).
  5. Depths of high degree vertices in random recursive trees.
  6. High degrees of random recursive trees.
  7. Hitting time theorems for random matrices.

Videos (Spanish)

  1. Survival for a Galton-Watson tree with cousin mergers

    XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021.

  2. El método de la ecuación diferencial en gráficas aleatorias

    Sesión de Probabilidad y Ecuaciones Diferenciales, VirtUMA, 2020.

  3. Imperios en la evolucion de redes ¿suerte o destino?

    Coloquio en el Instituto de Matemáticas, UNAM, 2017.

  4. Una conjetura sobre teoremas de tiempo de paro

    Seminario de Probabilidad Facultad de Ciencias, UNAM, 2017.

Videos para la comunidad

  1. Algoritmos en la vida cotidiana

    Charlas para madres y padres de familia sobre pensamiento computacional, 2022.

  2. Bullying

    Pregúntale a una matemática, 2022.