Snowball sampling for estimating exponential random graph models for large networks

被引:35
|
作者
Stivala, Alex D. [1 ]
Koskinen, Johan H. [2 ,3 ]
Rolls, David A. [1 ]
Wang, Peng [1 ]
Robins, Garry L. [1 ]
机构
[1] Univ Melbourne, Melbourne Sch Psychol Sci, Melbourne, Vic 3010, Australia
[2] Univ Manchester, Mitchell Ctr SNA, Manchester M13 9PL, Lancs, England
[3] Univ Manchester, Social Stat Discipline Area, Manchester M13 9PL, Lancs, England
基金
美国国家科学基金会;
关键词
Exponential random graph model (ERGM); Snowball sampling; Parallel computing; P-ASTERISK MODELS; FAMILY MODELS; INFERENCE;
D O I
10.1016/j.socnet.2015.11.003
中图分类号
Q98 [人类学];
学科分类号
030303 ;
摘要
The exponential random graph model (ERGM) is a well-established statistical approach to modelling social network data. However, Monte Carlo estimation of ERGM parameters is a computationally intensive procedure that imposes severe limits on the size of full networks that can be fitted. We demonstrate the use of snowball sampling and conditional estimation to estimate ERGM parameters for large networks, with the specific goal of studying the validity of inference about the presence of such effects as network closure and attribute homophily. We estimate parameters for snowball samples from the network in parallel, and combine the estimates with a meta-analysis procedure. We assess the accuracy of this method by applying it to simulated networks with known parameters, and also demonstrate its application to networks that are too large (over 40000 nodes) to estimate social circuit and other more advanced ERGM specifications directly. We conclude that this approach offers reliable inference for closure and homophily. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:167 / 188
页数:22
相关论文
共 50 条
  • [1] Conditional estimation of exponential random graph models from snowball sampling designs
    Pattison, Philippa E.
    Robins, Garry L.
    Snijders, Tom A. B.
    Wang, Peng
    [J]. JOURNAL OF MATHEMATICAL PSYCHOLOGY, 2013, 57 (06) : 284 - 296
  • [2] ESTIMATING AND UNDERSTANDING EXPONENTIAL RANDOM GRAPH MODELS
    Chatterjee, Sourav
    Diaconis, Persi
    [J]. ANNALS OF STATISTICS, 2013, 41 (05): : 2428 - 2461
  • [3] Estimation of Exponential Random Graph Models for Large Social Networks via Graph Limits
    He, Ran
    Zheng, Tian
    [J]. 2013 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM), 2013, : 254 - 261
  • [4] CONSISTENCY UNDER SAMPLING OF EXPONENTIAL RANDOM GRAPH MODELS
    Shalizi, Cosma Rohilla
    Rinaldo, Alessandro
    [J]. ANNALS OF STATISTICS, 2013, 41 (02): : 508 - 535
  • [5] Exponential random graph models for multilevel networks
    Wang, Peng
    Robins, Garry
    Pattison, Philippa
    Lazega, Emmanuel
    [J]. SOCIAL NETWORKS, 2013, 35 (01) : 96 - 115
  • [6] Exponential random graph models for little networks
    Yon, George G. Vega
    Slaughter, Andrew
    de la Haye, Kayla
    [J]. SOCIAL NETWORKS, 2021, 64 : 225 - 238
  • [7] Approximate Bayesian Computation for Exponential Random Graph Models for Large Social Networks
    Wang, Jing
    Atchade, Yves F.
    [J]. COMMUNICATIONS IN STATISTICS-SIMULATION AND COMPUTATION, 2014, 43 (02) : 359 - 377
  • [8] A perfect sampling method for exponential family random graph models
    Butts, Carter T.
    [J]. JOURNAL OF MATHEMATICAL SOCIOLOGY, 2018, 42 (01): : 17 - 36
  • [9] Introducing exponential random graph models for visibility networks
    Brughmans, Tom
    Keay, Simon
    Earl, Graeme
    [J]. JOURNAL OF ARCHAEOLOGICAL SCIENCE, 2014, 49 : 442 - 454
  • [10] Exponential random graph (p*) models for affiliation networks
    Wang, Peng
    Sharpe, Ken
    Robins, Garry L.
    Pattison, Philippa E.
    [J]. SOCIAL NETWORKS, 2009, 31 (01) : 12 - 25