A hypergraph is a generalization of an ordinary graph, and it naturally represents group interactions as hyperedges (i.e., arbitrary-sized subsets of nodes). Such group interactions are ubiquitous in many domains: the sender and receivers of an email, the co-authors of a publication, and the items co-purchased by a customer, to name a few. A higher-order interaction (HOI) in a hypergraph is defined as the co-appearance of a set of nodes in any hyperedge. Our focus is the persistence of HOIs repeated over time, which is naturally interpreted as the strength of group relationships, aiming at answering three questions: (a) How do HOIs in real-world hypergraphs persist over time? (b) What are the key factors governing the persistence? (c) How accurately can we predict the persistence?
In order to answer the questions above, we investigate the persistence of HOIs in 13 real-world hypergraphs from 6 domains. First, we define how to measure the persistence of HOIs. Then, we examine global patterns and anomalies in the persistence, revealing a power-law relationship. After that, we study the relations between the persistence and 16 structural features of HOIs, some of which are closely related to the persistence. Lastly, based on the 16 structural features, we assess the predictability of the persistence under various settings and find strong predictors of the persistence. Note that predicting the persistence of HOIs has many potential applications, such as recommending items to be purchased together and predicting missing recipients of emails.
MiDaS: Representative Sampling from Real-world Hypergraphs
图被广泛用于表示复杂系统中的成对相互作用。由于这样的真实世界的图是大的,往往不断增长,采样一个小的代表性的子图是必不可少的各种目的:模拟,可视化,流处理,表示学习,爬行,仅举几例。然而,许多复杂系统由群体相互作用组成(例如,研究人员的合作和在线Q&A平台上的讨论),并且因此它们可以由超图更自然和准确地表示(即,集合(sets of sets)比普通的图。受大规模超图流行的启发,我们研究了现实世界超图的代表性抽样问题,旨在回答(Q1)什么是代表性子超图以及(Q2)如何在不进行大量搜索的情况下快速找到代表性子超图.关于Q1,我们建议通过将子超图与整个超图在十个图级、超边级和节点级统计方面进行比较来衡量子超图的优劣。关于Q2,我们首先分析了11个现实世界超图的六种直观方法的特点。然后,基于分析,我们提出了MiDaS,它绘制了偏向于那些具有高度节点的超边。通过大量的实验,我们证明了MiDaS是(a)代表性的:在13种考虑的方法中找到最具代表性的样本,(b)快速:比最强的竞争对手快几个数量级,进行广泛的搜索,(c)自动:快速搜索适当程度的偏差。
Community and hyperedge inference in multiple hypergraphs
Anhui University(安徽大学);Key Laboratory of Intelligent Computing & Signal Processing, Ministry of Education(教育部智能计算与信号处理重点实验室);Harbin Institute of Technology, Shenzhen(哈尔滨工业大学(深圳))
School of Airspace Science and Engineering, Shandong University(航空航天科学与工程学院,山东大学);School of Mathematics and Statistics, Shandong University(数学与统计学院,山东大学)
Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization
School of Computer Science and Technology, Dalian University of Technology(大连理工大学计算机科学与技术学院);Key Laboratory of Social Computing and Cognitive Intelligence (Dalian University of Technology), Ministry of Education(教育部社会计算与认知智能重点实验室(大连理工大学));International School of Information Science & Engineering, Dalian University of Technology(大连理工大学国际信息与软件工程学院);School of Artificial Intelligence, Shanxi University(山西大学人工智能学院);College of Software, Northeastern University(东北大学软件学院)
School of Cyberspace, Hangzhou Dianzi University(杭州电子科技大学信息学院);Data Security Governance Zhejiang Engineering Research Center(浙江数据安全治理工程研究中心);College of Computer Science and Technology, Zhejiang University(浙江大学计算机科学与技术学院);College of Intelligence and Computing, Tianjin University(天津大学智能与计算学院)
A two-steps tensor eigenvector centrality for nodes and hyperedges in hypergraphs
School of Mathematical Sciences, Harbin Engineering University(哈尔滨工程大学数学科学学院);Academy for Advanced Interdisciplinary Studies, Northeast Normal University(东北师范大学前沿交叉科学研究院)