probability

Blog post explaining my research in the theory of graphons and the content of my undergraduate thesis "Asymptotic Bounds on Homomorphism Densities in Triangle-Constrained Graphons."

Graphs are rigid, discrete objects — hard to compare once they have different numbers of vertices. Graphons fix this by turning graphs into continuous functions, and counting subgraphs into integration.