Research

I’m currently thinking about exponential random graph models (ERGMs) as they appear in mathematics. Traditionally, they are used to model social networks. They can be investigated from a mathematical perspective by asking whether this family of probability distributions satisfy some nice conditions, such as negative dependence. In this way, we connect geometry and probability theory. This connection was described in seminal work by Borcea, Brändén, and Liggett. My PhD thesis describes the interplay of these ideas as well as generalizations to other random (hyper)graph models. My latest preprint expands on these ideas and generalizes them in applications to real-world networks.

Achievements

Talks

Summer 2023

  • Generating polynomials of exponential random graphs, PhD defense, August 2023 (slides)

Fall 2022

  • The geometry of Markov random graphs, Geometry and Combinatorics Seminar, The University of Western Ontario, November 2022 (slides)

Summer 2022

Graduate & reading courses

Winter 2022

Fall 2021

Summer 2021

Winter 2021

Fall 2020

Winter 2020

Summer 2018

Winter 2018

Fall 2017