Project supported by the National Natural Science Foundation of China(Grant No.62166010);the Guangxi Natural Science Foundation(Grant No.2023GXNSFAA026087).
Hypergraphs can accurately capture complex higher-order relationships,but it is challenging to identify their important nodes.In this paper,an improved PageRank(ImPageRank)algorithm is designed to identify important n...
Project partially supported by the National Natural Science Foundation of China (Grant Nos. 61672298 and 62373197);the Major Project of Philosophy and Social Science Research in Colleges and Universities in Jiangsu Province,China (Grant No. 2018SJZDI142);the Postgraduate Research & Practice Innovation Program of Jiangsu Province,China (Grant No. KYCX23 1045)。
Identifying key nodes in complex networks is crucial for understanding and controlling their dynamics. Traditional centrality measures often fall short in capturing the multifaceted roles of nodes within these network...
本文针对多重线性PageRank问题,结合松弛技术,提出了一般形式的张量分裂迭代算法,并给出了相应的收敛性分析。进一步,结合Anderson加速技术,提出了新的张量分裂算法。In this paper, combining relaxation techniques, a general form o...
Supported by the Project of Guangdong Science and Technology Department(2020B010166005);the Post-Doctoral Research Project(Z000158);the Ministry of Education Social Science Fund(22YJ630167);the Fund project of Department of Science and Technology of Guangdong Province(GDK TP2021032500);the Guangdong Philosophy and Social Science(GD22YYJ15).
The inter-agency government information sharing(IAGIS)plays an important role in improving service and efficiency of government agencies.Currently,there is still no effective and secure way for data-driven IAGIS to fu...