Tweeting #RamNavami: A Comparison of Approaches to Analyzing Bipartite Networks

被引:0
|
作者
Heaney, Michael T. [1 ]
机构
[1] Univ Glasgow, Sch Social & Polit Sci, Adam Smith Bldg, Glasgow G12 8RT, Lanark, Scotland
关键词
Bipartite network; two-mode network; ERGM; REM; Twitter; Ram Navami;
D O I
10.1177/22779752211018010
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Bipartite networks, also known as two-mode networks or affiliation networks, are a class of networks in which actors or objects are partitioned into two sets, with interactions taking place across but not within sets. These networks are omnipresent in society, encompassing phenomena such as student-teacher interactions, coalition structures and international treaty participation. With growing data availability and proliferation in statistical estimators and software, scholars have increasingly sought to understand the methods available to model the data-generating processes in these networks. This article compares three methods for doing so: (a) Logit (b) the bipartite Exponential Random Graph Model (ERGM) and (c) the Relational Event Model (REM). This comparison demonstrates the relevance of choices with respect to dependence structures, temporality, parameter specification and data structure. Considering the example of Ram Navami, a Hindu festival celebrating the birth of Lord Ram, the ego network of tweets using #RamNavami on 21April 2021 is examined. The results of the analysis illustrate that critical modelling choices make a difference in the estimated parameters and the conclusions to be drawn from them.
引用
收藏
页码:127 / 135
页数:9
相关论文
共 50 条
  • [41] Explosive synchronization in bipartite networks
    Thounaojam, Umeshkanta Singh
    CHAOS SOLITONS & FRACTALS, 2021, 152
  • [42] Modularity and projection of bipartite networks
    Arthur, Rudy
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2020, 549
  • [43] Optimal compression for bipartite networks
    Huang, Shuhong
    Wang, Xiangrong
    Peng, Liyang
    Xie, Jiarong
    Sun, Jiachen
    Hu, Yanqing
    CHAOS SOLITONS & FRACTALS, 2021, 151
  • [44] Searching for communities in bipartite networks
    Barber, Michael J.
    Faria, Margarida
    Streit, Ludwig
    Strogan, Oleg
    STOCHASTIC AND QUANTUM DYNAMICS OF BIOMOLECULAR SYSTEMS, 2008, 1021 : 171 - +
  • [45] Butterfly Counting in Bipartite Networks
    Sanei-Mehri, Seyed-Vahid
    Sariyuce, Ahmet Erdem
    Tirthapura, Srikanta
    KDD'18: PROCEEDINGS OF THE 24TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2018, : 2150 - 2159
  • [46] Matchings in colored bipartite networks
    Yi, T
    Murty, KG
    Spera, C
    DISCRETE APPLIED MATHEMATICS, 2002, 121 (1-3) : 261 - 277
  • [47] Mapping flows on bipartite networks
    Blocker, Christopher
    Rosvall, Martin
    PHYSICAL REVIEW E, 2020, 102 (05)
  • [48] Epidemic thresholds for bipartite networks
    Hernandez, D. G.
    Risau-Gusman, S.
    PHYSICAL REVIEW E, 2013, 88 (05)
  • [49] Rationing Problems in Bipartite Networks
    Moulin, Herve J.
    Sethuraman, Jay
    ACM SIGECOM EXCHANGES, 2012, 11 (01) : 9 - 17
  • [50] Minimum flows in bipartite networks
    Ciurea, Eleonor
    Georgescu, Oana
    Marinescu, Daniela
    MACMESE 2008: PROCEEDINGS OF THE 10TH WSEAS INTERNATIONAL CONFERENCE ON MATHEMATICAL AND COMPUTATIONAL METHODS IN SCIENCE AND ENGINEERING, PTS I AND II, 2008, : 491 - +