activity
20162020
most citedMixing Time of Vertex-Weighted Exponential Random Graphs

9 citations · 16 across the 6 of their papers we have counts for

collaborators

6 papers

math.CO2020★ 1 cited

Interval parking functions

Emma Colaric, Ryan DeMuse, Jeremy L. Martin +1

Interval parking functions (IPFs) are a generalization of ordinary parking functions in which each car is willing to park only in a fixed interval of spaces. Each interval parking…

math.PR2019

Dimension reduction in vertex-weighted exponential random graphs

Ryan DeMuse, Mei Yin

We investigate the behavior of vertex-weighted exponential random graphs. We show that vertex-weighted exponential random graphs with edge weights induced by products of independen…

math.CO2019

Extremal Behavior in Exponential Random Graphs

Ryan DeMuse

Yin, Rinaldo, and Fadnavis classified the extremal behavior of the edge-triangle exponential random graph model by first taking the network size to infinity, then the parameters di…

math.PR2017★ 9 cited

Mixing Time of Vertex-Weighted Exponential Random Graphs

Ryan DeMuse, Terry Easlick, Mei Yin

Exponential random graph models have become increasingly important in the study of modern networks ranging from social networks, economic networks, to biological networks. They see…

math.PR2017★ 3 cited

Phase Transitions in Edge-Weighted Exponential Random Graphs: Near-Degeneracy and Universality

Ryan DeMuse, Danielle Larcomb, Mei Yin

Conventionally used exponential random graphs cannot directly model weighted networks as the underlying probability space consists of simple graphs only. Since many substantively i…

math.PR2016★ 3 cited

Phase transitions in edge-weighted exponential random graphs

Mei Yin

The exponential family of random graphs represents an important and challenging class of network models. Despite their flexibility, conventionally used exponential random graphs ha…