“This project aims to analyze and identify well-behaved graph limits for sparse random graph models, specifically focusing on influential models developed in the investigator’s previous NSF-funded research related to real-world networks. The goal is to ensure that conclusions drawn from these models are realistic by verifying that their limits are graphides.”