502 citations · 1.3k across the 19 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.ST2011★ 75 cited
On the Question of Effective Sample Size in Network Modeling: An Asymptotic Inquiry
Pavel N. Krivitsky, Eric D. Kolaczyk
The modeling and analysis of networks and network data has seen an explosion of interest in recent years and represents an exciting direction for potential growth in statistics. De…
stat.ME2011★ 305 cited
Exponential-Family Random Graph Models for Valued Networks
Pavel N. Krivitsky
Exponential-family random graph models (ERGMs) provide a principled and flexible way to model and simulate features common in social networks, such as propensities for homophily, m…