IDEAS home Printed from https://ideas.repec.org/a/spr/psycho/v85y2020i1d10.1007_s11336-019-09685-2.html
   My bibliography  Save this article

Modeling Heterogeneous Peer Assortment Effects Using Finite Mixture Exponential Random Graph Models

Author

Listed:
  • Teague R. Henry

    (University of North Carolina at Chapel Hill)

  • Kathleen M. Gates

    (University of North Carolina at Chapel Hill)

  • Mitchell J. Prinstein

    (University of North Carolina at Chapel Hill)

  • Douglas Steinley

    (University of Missouri)

Abstract

This article develops a class of models called sender/receiver finite mixture exponential random graph models (SRFM-ERGMs). 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 without a block structure. 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 unobserved heterogeneity in effects of nodal covariates can be a major cause of misfit in network models, and the SRFM-ERGM approach can alleviate this misfit. Implications for the analysis of social networks in psychological science are discussed.

Suggested Citation

  • Teague R. Henry & Kathleen M. Gates & Mitchell J. Prinstein & Douglas Steinley, 2020. "Modeling Heterogeneous Peer Assortment Effects Using Finite Mixture Exponential Random Graph Models," Psychometrika, Springer;The Psychometric Society, vol. 85(1), pages 8-34, March.
    • Handle: RePEc:spr:psycho:v:85:y:2020:i:1:d:10.1007_s11336-019-09685-2
    DOI: 10.1007/s11336-019-09685-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11336-019-09685-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11336-019-09685-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Gilles Celeux & Gilda Soromenho, 1996. "An entropy criterion for assessing the number of clusters in a mixture model," Journal of Classification, Springer;The Classification Society, vol. 13(2), pages 195-212, September.
    2. Hoff P.D. & Raftery A.E. & Handcock M.S., 2002. "Latent Space Approaches to Social Network Analysis," Journal of the American Statistical Association, American Statistical Association, vol. 97, pages 1090-1098, December.
    3. Pavel N. Krivitsky & Mark S. Handcock, 2014. "A separable model for dynamic networks," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 76(1), pages 29-46, January.
    4. Peter Bryant, 1991. "Large-sample results for optimization-based clustering methods," Journal of Classification, Springer;The Classification Society, vol. 8(1), pages 31-44, January.
    5. Hunter, David R. & Goodreau, Steven M. & Handcock, Mark S., 2008. "Goodness of Fit of Social Network Models," Journal of the American Statistical Association, American Statistical Association, vol. 103, pages 248-258, March.
    6. Govaert, G. & Nadif, M., 1996. "Comparison of the mixture and the classification maximum likelihood in cluster analysis with binary data," Computational Statistics & Data Analysis, Elsevier, vol. 23(1), pages 65-81, November.
    7. Mark S. Handcock & Adrian E. Raftery & Jeremy M. Tantrum, 2007. "Model‐based clustering for social networks," Journal of the Royal Statistical Society Series A, Royal Statistical Society, vol. 170(2), pages 301-354, March.
    8. Lawrence Hubert & Phipps Arabie, 1985. "Comparing partitions," Journal of Classification, Springer;The Classification Society, vol. 2(1), pages 193-218, December.
    9. Wayne DeSarbo & William Cron, 1988. "A maximum likelihood methodology for clusterwise linear regression," Journal of Classification, Springer;The Classification Society, vol. 5(2), pages 249-282, September.
    10. Michael Schweinberger & Mark S. Handcock, 2015. "Local dependence in random graph models: characterization, properties and statistical inference," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 77(3), pages 647-676, June.
    11. Michel Wedel & Wayne DeSarbo, 1995. "A mixture likelihood approach for generalized linear models," Journal of Classification, Springer;The Classification Society, vol. 12(1), pages 21-55, March.
    12. Nowicki K. & Snijders T. A. B., 2001. "Estimation and Prediction for Stochastic Blockstructures," Journal of the American Statistical Association, American Statistical Association, vol. 96, pages 1077-1087, September.
    13. Stanley Wasserman & Philippa Pattison, 1996. "Logit models and logistic regressions for social networks: I. An introduction to Markov graphs andp," Psychometrika, Springer;The Psychometric Society, vol. 61(3), pages 401-425, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Teague R. Henry & David Banks & Derek Owens-Oas & Christine Chai, 2019. "Modeling Community Structure and Topics in Dynamic Text Networks," Journal of Classification, Springer;The Classification Society, vol. 36(2), pages 322-349, July.
    2. Federica Bianchi & Francesco Bartolucci & Stefano Peluso & Antonietta Mira, 2020. "Longitudinal networks of dyadic relationships using latent trajectories: evidence from the European interbank market," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 69(4), pages 711-739, August.
    3. Tracy M. Sweet, 2015. "Incorporating Covariates Into Stochastic Blockmodels," Journal of Educational and Behavioral Statistics, , vol. 40(6), pages 635-664, December.
    4. Lee, Jihui & Li, Gen & Wilson, James D., 2020. "Varying-coefficient models for dynamic networks," Computational Statistics & Data Analysis, Elsevier, vol. 152(C).
    5. Babkin, Sergii & Stewart, Jonathan R. & Long, Xiaochen & Schweinberger, Michael, 2020. "Large-scale estimation of random graph models with local dependence," Computational Statistics & Data Analysis, Elsevier, vol. 152(C).
    6. Samrachana Adhikari & Beau Dabbs, 2018. "Social Network Analysis in R: A Software Review," Journal of Educational and Behavioral Statistics, , vol. 43(2), pages 225-253, April.
    7. Cornelius Fritz & Michael Lebacher & Göran Kauermann, 2020. "Tempus volat, hora fugit: A survey of tie‐oriented dynamic network models in discrete and continuous time," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 74(3), pages 275-299, August.
    8. Francesco Dotto & Alessio Farcomeni & Luis Angel García-Escudero & Agustín Mayo-Iscar, 2017. "A fuzzy approach to robust regression clustering," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 11(4), pages 691-710, December.
    9. Irene Crimaldi & Michela Del Vicario & Greg Morrison & Walter Quattrociocchi & Massimo Riccaboni, 2015. "Homophily and Triadic Closure in Evolving Social Networks," Working Papers 3/2015, IMT School for Advanced Studies Lucca, revised May 2015.
    10. Anna Malinovskaya & Philipp Otto, 2021. "Online network monitoring," Statistical Methods & Applications, Springer;Società Italiana di Statistica, vol. 30(5), pages 1337-1364, December.
    11. Ana Oliveira-Brochado & Francisco Vitorino Martins, 2014. "Identifying Small Market Segments with Mixture Regression Models," International Journal of Finance, Insurance and Risk Management, International Journal of Finance, Insurance and Risk Management, vol. 4(4), pages 812-812.
    12. Michael Braun & André Bonfrer, 2011. "Scalable Inference of Customer Similarities from Interactions Data Using Dirichlet Processes," Marketing Science, INFORMS, vol. 30(3), pages 513-531, 05-06.
    13. Per Block & Christoph Stadtfeld & Tom A. B. Snijders, 2019. "Forms of Dependence: Comparing SAOMs and ERGMs From Basic Principles," Sociological Methods & Research, , vol. 48(1), pages 202-239, February.
    14. Michael Schweinberger, 2020. "Statistical inference for continuous‐time Markov processes with block structure based on discrete‐time network data," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 74(3), pages 342-362, August.
    15. Guang Ouyang & Dipak K. Dey & Panpan Zhang, 2020. "Clique-Based Method for Social Network Clustering," Journal of Classification, Springer;The Classification Society, vol. 37(1), pages 254-274, April.
    16. Ana Oliveira-Brochado & Francisco Vitorino Martins, 2008. "Determining the Number of Market Segments Using an Experimental Design," FEP Working Papers 263, Universidade do Porto, Faculdade de Economia do Porto.
    17. Tom Frans Wilderjans & Eva Gaer & Henk A. L. Kiers & Iven Mechelen & Eva Ceulemans, 2017. "Principal Covariates Clusterwise Regression (PCCR): Accounting for Multicollinearity and Population Heterogeneity in Hierarchically Organized Data," Psychometrika, Springer;The Psychometric Society, vol. 82(1), pages 86-111, March.
    18. Yingda Lu & Kinshuk Jerath & Param Vir Singh, 2013. "The Emergence of Opinion Leaders in a Networked Online Community: A Dyadic Model with Time Dynamics and a Heuristic for Fast Estimation," Management Science, INFORMS, vol. 59(8), pages 1783-1799, August.
    19. Kei, Yik Lun & Chen, Yanzhen & Madrid Padilla, Oscar Hernan, 2023. "A partially separable model for dynamic valued networks," Computational Statistics & Data Analysis, Elsevier, vol. 187(C).
    20. Joshua Daniel Loyal & Yuguo Chen, 2020. "Statistical Network Analysis: A Review with Applications to the Coronavirus Disease 2019 Pandemic," International Statistical Review, International Statistical Institute, vol. 88(2), pages 419-440, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:psycho:v:85:y:2020:i:1:d:10.1007_s11336-019-09685-2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.