Modeling heterogeneous peer assortment effects using finite mixture exponential random graph models
From MaRDI portal
Publication:2195804
Abstract: This article develops a class of models called Sender/Receiver Finite Mixture Exponential Random Graph Models (SRFM-ERGMs) that enables inference on networks. This class of models extends the existing Exponential Random Graph Modeling framework to allow analysts to model unobserved heterogeneity in the effects of nodal covariates and network features. An empirical example regarding substance use among adolescents is presented. Simulations across a variety of conditions are used to evaluate the performance of this technique. We conclude that that unobserved heterogeneity in effects of nodal covariates can be a major cause of mis-fit in network models, and the SRFM-ERGM approach can alleviate this misfit. Implications for the analysis of social networks in psychological science are discussed.
Recommendations
- Adjusting for network size and composition effects in exponential-family random graph models
- Exponential-family random graph models for valued networks
- Random graph models: an overview of modeling approaches
- scientific article; zbMATH DE number 1975289
- A network social interaction model with heterogeneous links
Cites work
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 1222296 (Why is no real title available?)
- scientific article; zbMATH DE number 2140075 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- p2: a random effects model with covariates for directed graphs
- A BAYESIAN APPROACH TO MODELING STOCHASTIC BLOCKSTRUCTURES WITH COVARIATES
- A central limit theorem for conditionally centred random fields with an application to Markov fields
- A maximum likelihood methodology for clusterwise linear regression
- A mixture likelihood approach for generalized linear models
- A separable model for dynamic networks
- An Exponential Family of Probability Distributions for Directed Graphs
- An entropy criterion for assessing the number of clusters in a mixture model
- An improvement of the NEC criterion for assessing the number of clusters in a mixture model
- Clustering Criteria and Multivariate Normal Mixtures
- Clusterwise p* models for social network analysis
- Comparison of the mixture and the classification maximum likelihood in cluster analysis with binary data
- Discrete temporal models of social networks
- Estimating and understanding exponential random graph models
- Estimation and Prediction for Stochastic Blockstructures
- Estimation and model selection for model-based clustering with the conditional classification likelihood
- Goodness of Fit of Social Network Models
- Large-sample results for optimization-based clustering methods
- Latent Space Approaches to Social Network Analysis
- Local dependence in random graph models: characterization, properties and statistical inference
- Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\)
- Markov Graphs
- On Information and Sufficiency
- The geometry of exponential families
Cited in
(2)
This page was built for publication: Modeling heterogeneous peer assortment effects using finite mixture exponential random graph models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2195804)