Properties and Performance of the ABCDe Random Graph Model with Community Structure

Big Data Research - Tập 30 - Trang 100348 - 2022
Bogumił Kamiński1, Tomasz Olczak1, Bartosz Pankratz1, Paweł Prałat2, François Théberge3
1Decision Analysis and Support Unit, SGH Warsaw School of Economics, Warsaw, Poland
2Department of Mathematics, Toronto Metropolitan University, Toronto, ON, Canada
3Tutte Institute for Mathematics and Computing, Ottawa, ON, Canada

Tài liệu tham khảo

Lancichinetti, 2008, Benchmark graphs for testing community detection algorithms, Phys. Rev. E, 78, 10.1103/PhysRevE.78.046110 Kamiński, 2021, Artificial Benchmark for Community Detection (ABCD)—fast random graph model with community structure, Netw. Sci., 9, 153, 10.1017/nws.2020.45 Kamiński Blondel, 2008, Fast unfolding of communities in large networks, J. Stat. Mech. Theory Exp., 2008, 10.1088/1742-5468/2008/10/P10008 Staudt, 2015 Bollobás, 1980, A probabilistic proof of an asymptotic formula for the number of labelled regular graphs, Eur. J. Comb., 1, 311, 10.1016/S0195-6698(80)80030-8 Chung, 2006 Kolda, 2014, A scalable generative graph model with community structure, SIAM J. Sci. Comput., 36, C424, 10.1137/130914218 Kamiński, 2021 Watts, 1998, Collective dynamics of ‘small-world’ networks, Nature, 393, 440, 10.1038/30918 Freeman, 1977, A set of measures of centrality based on betweenness, Sociometry, 10.2307/3033543 Freeman, 1979, Centrality in social networks: conceptual clarification, Soc. Netw., 1, 215, 10.1016/0378-8733(78)90021-7 Brin, 1998, The anatomy of a large-scale hypertextual web search engine, Comput. Netw. ISDN Syst., 30, 107, 10.1016/S0169-7552(98)00110-X Pastor-Satorras, 2001, Dynamical and correlation properties of the Internet, Phys. Rev. Lett., 87, 10.1103/PhysRevLett.87.258701 Newman, 2002, Assortative mixing in networks, Phys. Rev. Lett., 89, 10.1103/PhysRevLett.89.208701 Newman, 2010 Newman, 2004, Finding and evaluating community structure in networks, Phys. Rev. E., 69, 026 Bezanson, 2017, Julia: a fresh approach to numerical computing, SIAM Rev., 69, 65, 10.1137/141000671 Kamiński, 2019, Clustering via hypergraph modularity, PLoS ONE, 14, 10.1371/journal.pone.0224307 Kumar, 2019, A new measure of modularity in hypergraphs: theoretical insights and implications for effective clustering, vol. 881 Kamiński, 2021, Community detection algorithm using hypergraph modularity, vol. 943, 152 Chiara Angelini, 2015, Spectral detection on sparse hypergraphs, 66 Massri, 2022, RTGEN: a relative temporal graph GENerator Amdahl, 1967, Validity of the single processor approach to achieving large scale computing capabilities, 483 Fisher, 1943