Date: February 9, 2026
Speaker:
University of Twente
Traditional social network analysis often models homophily, the tendency of similar individuals to form connections. using a single parameter. We will show that in many important applications, such as hypergraphs or temporal contact networks, homophily occurs at several different scales. We present a model that integrates these different homophily values through a random graph model with a maximum entropy approach. We demonstrate that the interaction between different levels of homophily results in complex percolation thresholds. Furthermore, we show that our model fits remarkably well on a wide range of data sets, capturing their homophily patterns accurately.
Clara Stegehuis is an associate professor at the University of Twente. She works at the intersection of probability theory, graph theory and stochastic networks, with an emphasis on asymptotic analysis, stochastic process limits, and randomized algorithms. Problems she investigates are often inspired by applications in network science, physics and computer science.
Date: March 2, 2026
Speaker:
University of Illinois at Urbana-Champaign
TBD
TBD
Date: March 30, 2026
Speaker:
Stanford University
TBD
TBD
Date: April 13, 2026
Speaker:
University of Amsterdam
TBD
TBD
Date: April 20, 2026
Speaker:
Yale University
TBD
TBD
Date: May 4, 2026
Speaker:
Stanford University
TBD
TBD
Date: May 11, 2026
Speaker:
University of Pennsylvania
TBD
TBD
Date: May 18, 2026
Speaker:
Carnegie Mellon University
TBD
TBD