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

IF 1.8 Q3 MANAGEMENT
M. T. Heaney
{"title":"Tweeting #RamNavami: A Comparison of Approaches to Analyzing Bipartite Networks","authors":"M. T. Heaney","doi":"10.1177/22779752211018010","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":43330,"journal":{"name":"IIM Kozhikode Society & Management Review","volume":"10 1","pages":"127 - 135"},"PeriodicalIF":1.8000,"publicationDate":"2021-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1177/22779752211018010","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IIM Kozhikode Society & Management Review","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1177/22779752211018010","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 0

Abstract

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.
推文#RamNavami:分析双部网络的方法比较
二部分网络,也称为双模网络或隶属网络,是一类参与者或对象被划分为两个集合的网络,交互发生在集合之间,但不发生在集合内。这些网络在社会中无处不在,包括师生互动、联盟结构和国际条约参与等现象。随着数据可用性的增加和统计估计器和软件的激增,学者们越来越多地试图了解在这些网络中建模数据生成过程的可用方法。本文比较了三种方法:(a)Logit(b)二分指数随机图模型(ERGM)和(c)关系事件模型(REM)。这种比较证明了选择在依赖结构、时间性、参数规范和数据结构方面的相关性。以庆祝拉姆勋爵诞辰的印度教节日拉姆·纳瓦米为例,研究了2021年4月21日使用#RamNavami的推特自我网络。分析结果表明,关键的建模选择会对估计的参数和从中得出的结论产生影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
3.90
自引率
31.20%
发文量
25
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信