97 citations · 472 across the 27 of their papers we have counts for
27 papers
A universal meta-heuristic framework for influence maximization in hypergraphs
Ming Xie, Xiu-Xiu Zhan, Chuang Liu +1
Influence maximization (IM) aims to select a small number of nodes that are able to maximize their influence in a network and covers a wide range of applications. Despite numerous…
A hyper-distance-based method for hypernetwork comparison
Tao Xu, Xiaowen Xie, Zi-Ke Zhang +2
Hypernetwork is a useful way to depict multiple connections between nodes, making it an ideal tool for representing complex relationships in network science. In recent years, there…
Vital node identification in hypergraphs via gravity model
Xiao-Wen Xie, Xiu-Xiu Zhan, Zi-Ke Zhang +1
Hypergraphs that can depict interactions beyond pairwise edges have emerged as an appropriate representation for modeling polyadic relations in complex systems. With the recent sur…
Influence Maximization in Hypergraphs
Ming Xie, Xiu-Xiu Zhan, Chuang Liu +1
Influence maximization in complex networks, i.e., maximizing the size of influenced nodes via selecting K seed nodes for a given spreading process, has attracted great attention in…
Quantification of network structural dissimilarities based on graph embedding
Zhipeng Wang, Xiu-Xiu Zhan, Chuang Liu +1
Identifying and quantifying structural dissimilarities between complex networks is a fundamental and challenging problem in network science. Previous network comparison methods are…
Measuring and utilizing temporal network dissimilarity
Xiu-Xiu Zhan, Chuang Liu, Zhipeng Wang +3
Quantifying the structural and functional differences of temporal networks is a fundamental and challenging problem in the era of big data. This work proposes a temporal dissimilar…