114
Views
4
CrossRef citations to date
0
Altmetric
Articles

TriBeC: identifying influential users on social networks with upstream and downstream network centrality

ORCID Icon & ORCID Icon
Pages 275-296 | Received 30 Nov 2021, Accepted 06 Mar 2023, Published online: 04 Apr 2023

References

  • Anon. 2017. “Facebook (NIPS) Network Dataset – {KONECT}.”
  • Bader, David A., Shiva Kintali, Kamesh Madduri, and Milena Mihail. 2007. “Approximating Betweenness Centrality.” In Algorithms and Models for the Web-Graph, edited by A. Bonato, and F. R. K. Chung, 124–137. Berlin, Heidelberg: Springer Berlin Heidelberg.
  • Barabási, Albert László, and Réka Albert. 1999. “Emergence of Scaling in Random Networks.” Science 286 (5439): 509–512. doi:10.1126/science.286.5439.509.
  • Bavelas, Alex. 1948. “A Mathematical Model for Group Structures.” Human Organization 7 (3): 16–30. doi:10.17730/humo.7.3.f4033344851gl053.
  • Bavelas, Alex. 1950. “Communication Patterns in Task-Oriented Groups.” The Journal of the Acoustical Society of America 22 (6): 725–730. doi:10.1121/1.1906679.
  • Bonacich, Phillip. 1972. “Factoring and Weighting Approaches to Status Scores and Clique Identification.” The Journal of Mathematical Sociology 2 (1): 113–120. doi:10.1080/0022250X.1972.9989806.
  • Bonacich, Phillip. 1987. “Power and Centrality: A Family of Measures.” American Journal of Sociology 92 (5): 1170–1182. doi:10.1086/228631.
  • Bonacich, Phillip. 2007. “Some Unique Properties of Eigenvector Centrality.” Social Networks 29 (4): 555–564. doi:10.1016/j.socnet.2007.04.002.
  • Borassi, Michele, and Emanuele Natale. 2019. “Kadabra Is an Adaptive Algorithm for Betweenness via Random Approximation.” ACM Journal of Experimental Algorithmics 24 (1), doi:10.1145/3284359.
  • Brandes, Ulrik. 2001. “A Faster Algorithm for Betweenness Centrality*.” The Journal of Mathematical Sociology 25 (2): 163–177. doi:10.1080/0022250X.2001.9990249.
  • Brandes, Ulrik. 2008. “On Variants of Shortest-Path Betweenness Centrality and Their Generic Computation.” Social Networks 30 (2): 136–145. doi:10.1016/j.socnet.2007.11.001.
  • Brandes, Ulrik, and Christian Pich. 2007. “Centrality Estimation in Large Networks.” International Journal of Bifurcation and Chaos 17 (7): 2303–2018. doi:10.1142/S0218127407018403.
  • Brin, S., and L. Page. 1998. “The Anatomy of a Large-Scale Hypertextual Web Search Engine.” Computer Networks and ISDN Systems 30 (1–7): 107–117. doi:10.1016/S0169-7552(98)00110-X.
  • Chen, Bingsheng, Zhengyu Lin, and Tim S. Evans. 2019. “Analysis of the Wikipedia Network of Mathematicians.” CoRR abs/1902.07622.
  • Coquidé, Célestin, and Wlodzimierz Lewoniewski. 2020. “Novel Version of PageRank, CheiRank and 2DRank for Wikipedia in Multilingual Network Using Social Impact.” In BIS: International Conference on Business Information Systems, 23rd International Conference, BIS 2020, Colorado Springs, CO, USA, June 8–10, 2020, Proceedings, edited by G. K. Witold Abramowicz. Colorado Springs: Springer.
  • Daniel, Cecile, Angelo Furno, Lorenzo Goglia, and Eugenio Zimeo. 2021. “Fast Cluster-Based Computation of Exact Betweenness Centrality in Large Graphs.” Journal of Big Data, Springer 8 (1): 1–39. doi:10.1186/s40537-021-00483-1.
  • Ercsey-Ravasz, Mária, Ryan N. Lichtenwalter, Nitesh V. Chawla, and Zoltán Toroczkai. 2012. “Range-Limited Centrality Measures in Complex Networks.” Physical Review E 85 (6). doi:10.1103/PhysRevE.85.066103.
  • Erdös, Paul, and Alfréd Rėnyi. 1959. “On Random Graphs.” Publicationes Mathematicae 6: 290–297. snap.stanford.edu/class/cs224w-readings/erdos59random.pdf.
  • Estrada, Ernesto, Desmond J. Higham, and Naomichi Hatano. 2009. “Communicability Betweenness in Complex Networks.” Physica A: Statistical Mechanics and Its Applications 388 (5): 764–774. doi:10.1016/j.physa.2008.11.011.
  • Faghani, Mohammad, and Uyen Nguyen. 2013. “A Study of XSS Worm Propagation and Detection Mechanisms in Online Social Networks.” IEEE Transactions on Information Forensics and Security 8: 1815–1826. doi:10.1109/TIFS.2013.2280884.
  • Fan, Changjun, Li Zeng, Yuhui Ding, Muhao Chen, Yizhou Sun, and Zhong Liu. 2019. “Learning to Identify High Betweenness Centrality Nodes from Scratch.” International Conference on Information and Knowledge Management, Proceedings, 559–568. doi:10.1145/3357384.3357979.
  • Freeman, Linton C. 1978. “Centrality in Social Networks Conceptual Clarification.” Social Networks 1 (3): 215–239. doi:10.1016/0378-8733(78)90021-7.
  • Freeman, Linton C., Stephen P. Borgatti, and Douglas R. White. 1991. “Centrality in Valued Graphs: A Measure of Betweenness Based on Network Flow.” Social Networks 13 (2): 141–154. doi:10.1016/0378-8733(91)90017-N.
  • Guilbeault, Douglas, and Damon Centola. 2021. “Topological Measures for Identifying and Predicting the Spread of Complex Contagions.” Nature Communications 12 (1): 4430. doi:10.1038/s41467-021-24704-6.
  • Hage, Per, and Frank Harary. 1995. “Eccentricity and Centrality in Networks.” Social Networks 17 (1): 57–63. doi:10.1016/0378-8733(94)00248-9.
  • Harrigan, Paul, Timothy M. Daly, Kristof Coussement, Julie A. Lee, Geoffrey N. Soutar, and Uwana Evers. 2021. “Identifying Influencers on Social Media.” International Journal of Information Management 56: 102246. doi:10.1016/j.ijinfomgt.2020.102246.
  • Herrera-Almarza, G. C., A. J. Alvarez-Socorro, and L. A. González-Díaz. 2017. “Properties of Essential Genes in the Protein-Protein Interaction Network of Escherichia Coli from the Perspective of Network Theory.” Journal of Computational Methods in Sciences and Engineering 17: 209–216. doi:10.3233/JCM-160674.
  • Jacob, Riko, Dirk Koschützki, Katharina Anna Lehmann, Leon Peeters, and Dagmar Tenfelde-Podehl. 2005. “Algorithms for Centrality Indices.” In Network Analysis: Methodological Foundations, edited by U. Brandes, and T. Erlebach, 62–82. Berlin, Heidelberg: Springer Berlin Heidelberg.
  • Jain, Somya, and Adwitiya Sinha. 2019. “Social Network Sustainability for Transport Planning with Complex Interconnections.” Sustainable Computing: Informatics and Systems 24: 100351. doi:10.1016/j.suscom.2019.100351.
  • Jain, Somya, and Adwitiya Sinha. 2020. “Identification of Influential Users on Twitter: A Novel Weighted Correlated Influence Measure for Covid-19.” Chaos, Solitons & Fractals 139: 110037. doi:10.1016/j.chaos.2020.110037.
  • Jiang, K., D. Ediger, and D. A. Bader. 2009. “Generalizing K-Betweenness Centrality Using Short Paths and a Parallel Multithreaded Implementation,” 542–549.
  • Kas, Miray, Kathleen M. Carley, and L. Richard Carley. 2014. “An Incremental Algorithm for Updating Betweenness Centrality and K-Betweenness Centrality and Its Performance on Realistic Dynamic Social Network Data.” Social Network Analysis and Mining 4 (1): 235. doi:10.1007/s13278-014-0235-z.
  • Katz, Leo. 1953. “A New Status Index Derived from Sociometric Analysis.” Psychometrika 18 (1): 39–43. doi:10.1007/BF02289026.
  • Kempe, David, Jon Kleinberg, and Éva Tardos. 2015. “Maximizing the Spread of Influence Through a Social Network.” Theory of Computing 11: 105–147. doi:10.4086/toc.2015.v011a004.
  • Kim, Jooho, Juhee Bae, and Makarand Hastak. 2018. “Emergency Information Diffusion on Online Social Media During Storm Cindy in U.S.” International Journal of Information Management 40: 153–165. doi:10.1016/j.ijinfomgt.2018.02.003.
  • Kourtellis, Nicolas, Tharaka Alahakoon, Ramanuja Simha, Adriana Iamnitchi, and Rahul Tripathi. 2013. “Identifying High Betweenness Centrality Nodes in Large Social Networks.” Social Network Analysis and Mining 3 (4): 899–914. doi:10.1007/s13278-012-0076-6.
  • Lee, Jieun, and Ilyoo B. Hong. 2016. “Predicting Positive User Responses to Social Media Advertising: The Roles of Emotional Appeal, Informativeness, and Creativity.” International Journal of Information Management 36 (3): 360–373. doi:10.1016/j.ijinfomgt.2016.01.001.
  • Lee, Finnbar, Kevin S. Simon, and George L. W. Perry. 2022. “River Networks: An Analysis of Simulating Algorithms and Graph Metrics Used to Quantify Topology.” Methods in Ecology and Evolution 13 (7): 1374–1387. doi:10.1111/2041-210x.13854.
  • Leskovec, Jure, and Julian J. Mcauley. 2012. “Learning to Discover Social Circles in Ego Networks.” In Advances in Neural Information Processing Systems 25, edited by F. Pereira, C. J. C. Burges, L. Bottou, and K. Q. Weinberger, 539–547. New York: Curran Associates, Inc.
  • Leydesdorff, Loet, Caroline S. Wagner, and Lutz Bornmann. 2018. “Betweenness and Diversity in Journal Citation Networks as Measures of Interdisciplinarity – A Tribute to Eugene Garfield.” Scientometrics 114 (2): 567–592. doi:10.1007/s11192-017-2528-2.
  • Mahmoody, Ahmad, Charalampos E. Tsourakakis, and Eli Upfal. 2016. “Scalable Betweenness Centrality Maximization via Sampling.” Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 13–17-Augu:1765–73. doi:10.1145/2939672.2939869.
  • Marchiori, Massimo, and Vito Latora. 2000. “Harmony in the Small-World.” Physica A: Statistical Mechanics and Its Applications 285 (3): 539–546. doi:10.1016/S0378-4371(00)00311-3.
  • Maurya, Sunil Kumar, Xin Liu, and Tsuyoshi Murata. 2021. “Graph Neural Networks for Fast Node Ranking Approximation.” ACM Transactions on Knowledge Discovery from Data 15 (5). doi:10.1145/3446217.
  • Mirakyan, Martin. 2021. “ABCDE: Approximating Betweenness-Centrality Ranking with Progressive-DropEdge.” PeerJ Computer Science 7: e699. doi:10.7717/peerj-cs.699.
  • Mistry, Divya, Roger P. Wise, and Julie A. Dickerson. 2017. “DiffSLC: A Graph Centrality Method to Detect Essential Proteins of a Protein-Protein Interaction Network.” PloS One 12 (11): e0187091. doi:10.1371/journal.pone.0187091.
  • Newman, M. E. J. 2005. “A Measure of Betweenness Centrality Based on Random Walks.” Social Networks 27 (1): 39–54. doi:10.1016/j.socnet.2004.11.009.
  • Piraveenan, Mahendra, Mikhail Prokopenko, and Liaquat Hossain. 2013. “Percolation Centrality: Quantifying Graph-Theoretic Impact of Nodes During Percolation in Networks.” PLOS ONE 8 (1): e53095–e53014. doi:10.1371/journal.pone.0053095.
  • Puzis, R., P. Zilberman, Y. Elovici, S. Dolev, and U. Brandes. 2012. “Heuristics for Speeding Up Betweenness Centrality Computation.2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Conference on Social Computing.Amsterdam, Netherlands 3-5 Sept. 2012.
  • Riondato, Matteo, and Evgenios M. Kornaropoulos. 2016. “Fast Approximation of Betweenness Centrality Through Sampling.” Data Mining and Knowledge Discovery 30 (2): 438–475. doi:10.1007/s10618-015-0423-0.
  • Riondato, Matteo, and Eli Upfal. 2018. “ABRA.” ACM Transactions on Knowledge Discovery from Data 12 (5): 1–38. doi:10.1145/3208351.
  • Son, Jaebong, Jintae Lee, Onook Oh, Hyung Koo Lee, and Jiyoung Woo. 2020. “Using a Heuristic-Systematic Model to Assess the Twitter User Profile’s Impact on Disaster Tweet Credibility.” International Journal of Information Management 54: 102176. doi:10.1016/j.ijinfomgt.2020.102176.
  • Tang, Lei, and Huan Liu. 2009. “Relational Learning via Latent Social Dimensions.15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ‘09.New York, USA.28 June - 1 July, 2009.
  • Tran, Trang, Thi Ngoc, Müslüm Atas, Alexander Felfernig, and Martin Stettinger. 2018. “An Overview of Recommender Systems in the Healthy Food Domain.” Journal of Intelligent Information Systems 50 (3): 501–526. doi:10.1007/s10844-017-0469-0.
  • Weisberg, H., and P. H. F. Weisberg. 1992. Central Tendency and Variability. Columbus, Ohio: Sage.
  • Yuan, Jia, Qian Ming Zhang, Jian Gao, Linyan Zhang, Xue Song Wan, Xiao Jun Yu, and Tao Zhou. 2016. “Promotion and Resignation in Employee Networks.” Physica A: Statistical Mechanics and Its Applications 444: 442–447. doi:10.1016/j.physa.2015.10.039.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.