2012
DOI: 10.1080/10618600.2012.732921
|View full text |Cite
|
Sign up to set email alerts
|

Computational Statistical Methods for Social Network Models

Abstract: We review the broad range of recent statistical work in social network models, with emphasis on computational aspects of these methods. Particular focus is applied to exponential-family random graph models (ERGM) and latent variable models for data on complete networks observed at a single time point, though we also briefly review many methods for incompletely observed networks and networks observed at multiple time points. Although we mention far more modeling techniques than we can possibly cover in depth, w… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
79
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 85 publications
(79 citation statements)
references
References 92 publications
(133 reference statements)
0
79
0
Order By: Relevance
“…, we provide a data‐ and question‐driven approach to selecting the most suitable statistical tool. For further comparisons between statistical models of networks, and guidance to their usage, we refer readers to recent reviews in other subject areas (Hunter, Krivitsky & Schweinberger ; Leifeld & Cranmer ; Cranmer et al . ).…”
Section: Choosing a Modelmentioning
confidence: 99%
“…, we provide a data‐ and question‐driven approach to selecting the most suitable statistical tool. For further comparisons between statistical models of networks, and guidance to their usage, we refer readers to recent reviews in other subject areas (Hunter, Krivitsky & Schweinberger ; Leifeld & Cranmer ; Cranmer et al . ).…”
Section: Choosing a Modelmentioning
confidence: 99%
“…Morris et al (2008) simply state that “the larger question of how to go about choosing terms wisely is beyond its scope.” Hunter et al (2012) provide a recent review of the ERGM literature (along with several other network models) and discuss model degeneracy, but do not touch on selection of ERGM terms. Model degeneracy refers to the situation in which only a few networks (often the full or empty networks) have appreciable probability given the model and is a challenge in fitting ERGM models.…”
Section: Finite Mixtures Of Ergmsmentioning
confidence: 99%
“…For the literature addressing the problem of selecting K, besides the block-wise edge splitting method of Chen and Lei (2014), a common practice is to use BIC-type criteria (Airoldi et al, 2008;Daudin et al, 2008) or a variational Bayes approach (Latouche et al, 2012;Hunter et al, 2012). An inherently related problem is that of selecting the number of components in mixture models, where the birth-and-death point process of Stephens (2000) and the allocation sampler of Nobile and Fearnside (2007) provide two fully Bayesian approaches in the case where K is finite but unknown.…”
Section: Introductionmentioning
confidence: 99%