Census and Analysis of Higher-Order Interactions in Real-World Hypergraphs

被引:0
作者
Meng, Xihang [1 ]
Zhai, Xuemeng [1 ]
Fei, Gaolei [1 ]
Wen, Sheng [2 ]
Hu, Guangmin [1 ]
机构
[1] Univ Elect Sci & Technol China, Sch Informat & Commun Engn, Chengdu 611731, Peoples R China
[2] Swinburne Univ Technol, Sch Sci Comp & Engn Technol, Melbourne 3122, Australia
基金
中国国家自然科学基金;
关键词
Systematics; Fingerprint recognition; Big Data; Feature extraction; Encoding; Complexity theory; Data mining; Complex systems; complex systems; higher-order interactions; hypergraphs; higher-order motifs; hyperlink prediction; NETWORK MOTIFS; DYNAMICS; TENSOR; LOOP;
D O I
10.26599/BDMA.2024.9020091
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Complex systems can be more accurately described by higher-order interactions among multiple units. Hypergraphs excel at depicting these interactions, surpassing the binary limitations of traditional graphs. However, retrieving valuable information from hypergraphs is often challenging due to their intricate interconnections. To address this issue, we introduce a new category of structural patterns, hypermotifs, which are defined as statistically significant local structures formed by interconnected hyperedges. We propose a systematic framework for hypermotif extraction. This framework features the encoding, census, and evaluation of higher-order patterns, effectively overcoming their inherent complexity and diversity. Our experimental results demonstrate that hypermotifs can serve as higher-order fingerprints of real-world hypergraphs, helping to identify hypergraph classes based on network functions. These motifs potentially represent preferential attachments and key modules in real-world hypergraphs, arising from specific mechanisms or constraints. Our work validates the efficacy of hypermotifs in exploring hypergraphs, offering a powerful tool for revealing the design principles and underlying dynamics of interacting systems.
引用
收藏
页码:383 / 406
页数:24
相关论文
共 87 条
[1]   Hypernetwork science via high-order hypergraph walks [J].
Aksoy, Sinan G. ;
Joslyn, Cliff ;
Marrero, Carlos Ortiz ;
Praggastis, Brenda ;
Purvine, Emilie .
EPJ DATA SCIENCE, 2020, 9 (01)
[2]   Conserved network motifs allow protein-protein interaction prediction [J].
Albert, I ;
Albert, R .
BIOINFORMATICS, 2004, 20 (18) :3346-3352
[3]  
Allan EG, 2009, GLOB TELECOMM CONF, P4266
[4]   Network motifs: theory and experimental approaches [J].
Alon, Uri .
NATURE REVIEWS GENETICS, 2007, 8 (06) :450-461
[5]  
Alpert C. J., 1998, ISPD-98. 1998 International Symposium on Physical Design, P80, DOI 10.1145/274535.274546
[6]   Evolutionary dynamics of higher-order interactions in social networks [J].
Alvarez-Rodriguez, Unai ;
Battiston, Federico ;
de Arruda, Guilherme Ferraz ;
Moreno, Yamir ;
Perc, Matjaz ;
Latora, Vito .
NATURE HUMAN BEHAVIOUR, 2021, 5 (05) :586-595
[7]   Clustering in graphs and hypergraphs with categorical edge labels [J].
Amburg, Ilya ;
Veldt, Nate ;
Benson, Austin .
WEB CONFERENCE 2020: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2020), 2020, :706-717
[8]  
[Anonymous], 2021, Physical Review Journals,
[9]   A Survey on Hypergraph Representation Learning [J].
Antelmi, Alessia ;
Cordasco, Gennaro ;
Polato, Mirko ;
Scarano, Vittorio ;
Spagnuolo, Carmine ;
Yang, Dingqi .
ACM COMPUTING SURVEYS, 2024, 56 (01)
[10]   Hypergraph convolution and hypergraph attention [J].
Bai, Song ;
Zhang, Feihu ;
Torr, Philip H. S. .
PATTERN RECOGNITION, 2021, 110