Article number 10
Published in RGT on November 27, 2020

Comprehensive method for discovering and assessing the rich-club organization in multihypergraphs

Keywords:
rich-club organization, rich-club coefficient, multihypergraph, simple hypergraph, multigraph, co-authorship hypernetwork

Abstract:

The topological structure of the graph-based models constructed for a wide range of the real-world complex systems is characterized by the clear presence of the rich-club organization. Conceptually, such organization implies the tendency of the most important (in accordance to the prescribed metric) vertices to be tightly interconnected with each other and form the cohesive communities referred to as the rich-clubs. Recently, the rich-club ordering has attracted a considerable attention of investigators due to its impact on the robustness and performance of the modeled system as well as the regime of its functioning. At the same time, the prior studies in this direction are entirely limited to the case of simple graphs. This, in turn, points to the existence of the fundamental research gap associated with the need to develop the method for detecting the rich-club organization in multihypergraphs (i.e. hypergraphs allowing the presence of the parallel hyperedges). With a view to bridging the identified gap, this work introduces the family of the original metrics providing the formal way for determining whether the submultihypergraph induced by the most important nodes of multihypergraph could be properly regarded as its rich-club. The proposed metrics are designed to exhaustively capture the complex nature of relationships established in the considered submultihypergraph and, accordingly, take into account not only the number of its hyperedges but also their cardinality and role in ensuring the connectivity of vertices. Furthermore, the paper elaborates the scheme of normalizing the introduced metrics with respect to the reference ensemble of random multihypergraphs possessing the same sequences of vertex degrees and hyperedge cardinalities as the multihypergraph under investigation. Such normalization allows discovering the intentionally emerged rich-club ordering in multihypergraphs that does not follow merely from the structural restrictions imposed by the local properties of vertices and hyperedges. Finally, the paper illustrates the descriptive potential of the developed method by constructing the multihypergraph-based representation of the scientific co-authorship hypernetwork extracted from the IEEE Xplore database and performing the rigorous experimental analysis of its rich-club organization.

References:

Johnson JH. Embracing n-ary relations in network science. In: Wierzbicki A, Brandes U, Schweitzer F, Pedreschi D, editors. Advances in Network Science. NetSci-X 2016. Lecture Notes in Computer Science 9564. Cham: Springer; 2016. p. 147–60. doi: 10.1007/978-3-319-28361-6_12

View in Google Scholar

Estrada E, Rodriguez-Velazquez JA. Subgraph centrality and clustering in complex hypernetworks. Physica A: Statistical Mechanics and its Applications. 2006 May 15; 364:581–94. doi: 10.1016/j.physa.2005.12.002

View in Google Scholar

Potebnia A. Formation of the multifractal hypergraph structure reflecting the self-similarity properties of the computational complexity classes. In: 2017 IEEE First Ukraine Conference on Electrical and Computer Engineering (UKRCON). Piscataway: IEEE; 2017. p. 953–8. doi: 10.1109/ukrcon.2017.8100392

View in Google Scholar

Potebnia A. Representation of the greedy algorithms applicability for solving the combinatorial optimization problems based on the hypergraph mathematical structure. In: 2017 14th International Conference The Experience of Designing and Application of CAD Systems in Microelectronics (CADSM). Piscataway: IEEE; 2017. p. 328–32. doi: 10.1109/CADSM.2017.7916145

View in Google Scholar

Dewar M, Healy J, Perez-Gimenez X, Prałat P, Proos J, Reiniger B, et al. Subgraphs in nonuniform random hypergraphs. In: Bonato A, Graham F, Pralat P, editors. Algorithms and Models for the Web Graph. WAW 2016. Lecture Notes in Computer Science 10088. Cham: Springer; 2016. p. 140–51. doi: 10.1007/978-3-319-49787-7_12

View in Google Scholar

Han Y, Zhou B, Pei J, Jia Y. Understanding importance of collaborations in co-authorship networks: A supportiveness analysis approach. In: Proceedings of the 2009 SIAM International Conference on Data Mining. Philadelphia: SIAM; 2009. p. 1112–23. doi: 10.1137/1.9781611972795.95

View in Google Scholar

Potebnia A. Innovative concept of the strict line hypergraph as the basis for specifying the duality relation between the vertex separators and cuts. In: Shakhovska N, Stepashko V, editors. Advances in Intelligent Systems and Computing II. CSIT 2017. Advances in Intelligent Systems and Computing 689. Cham: Springer; 2018. p. 386–403. doi: 10.1007/978-3-319-70581-1_28

View in Google Scholar

Klamt S, Haus U-U, Theis F. Hypergraphs and cellular networks. PLoS Computational Biology. 2009 May 29; 5(5):e1000385. doi: 10.1371/journal.pcbi.1000385

View in Google Scholar

Cinelli M, Ferraro G, Iovanella A. Resilience of core-periphery networks in the case of rich-club. Complexity. 2017 Dec 28. doi: 10.1155/2017/6548362

View in Google Scholar

Csigi M, Korosi A, Biro J, Heszberger Z, Malkov Y, Gulyas A. Geometric explanation of the rich-club phenomenon in complex networks. Scientific Reports. 2017 May 11; 7:1730. doi: 10.1038/s41598-017-01824-y

View in Google Scholar

Colizza V, Flammini A, Serrano MA, Vespignani A. Detecting rich-club ordering in complex networks. Nature Physics. 2006 Jan 15; 2(2):110–5. doi: 10.1038/nphys209

View in Google Scholar

van den Heuvel MP, Sporns O. Rich-club organization of the human connectome. Journal of Neuroscience. 2011 Nov 2; 31(44):15775–86. doi: 10.1523/jneurosci.3539-11.2011

View in Google Scholar

Boccaletti S, Latora V, Moreno Y, Chavez M, Hwang D. Complex networks: Structure and dynamics. Physics Reports. 2006 Jan 10; 424(4–5):175–308. doi: 10.1016/j.physrep.2005.10.009

View in Google Scholar

Bhuiyan H, Khan M, Marathe M. A parallel algorithm for generating a random graph with a prescribed degree sequence. In: IEEE International Conference on Big Data (Big Data). Piscataway: IEEE; 2017. p. 3312–21. doi: 10.1109/bigdata.2017.8258316

View in Google Scholar

Isenberg P, Heimerl F, Koch S, Isenberg T, Xu P, Stolper C, et al. Visualization Publication Dataset [Internet]. 2015 Jun [cited 2018 Apr 21]; Available from: http://www.vispubdata.org/. Archived copy of the dataset on which the experiment was performed is available from: https://goo.gl/CD6u5D

View in Google Scholar

Full Text:

2020

Abstract viewed:
15

PDF downloaded:
3
How to Cite:
Section:
Original Scientific Articles in Graph Theory
Universal Resource Name:
Reading Tools:
Share this Article in Social Media: