Important nodes mining based on a novel personalized temporal motif pagerank algorithm in temporal networks

Xiuming Zhao (), Hongtao Yu, Jianpeng Zhang, Zheng Wu and Yiteng Wu
Additional contact information
Xiuming Zhao: PLA Strategic Support Force Information Engineering University, Zhengzhou, P. R. China
Hongtao Yu: National Digital Switching System Engineering & Technological R&D Center (NDSC), Zhengzhou, P. R. China
Jianpeng Zhang: National Digital Switching System Engineering & Technological R&D Center (NDSC), Zhengzhou, P. R. China
Zheng Wu: National Digital Switching System Engineering & Technological R&D Center (NDSC), Zhengzhou, P. R. China
Yiteng Wu: National Digital Switching System Engineering & Technological R&D Center (NDSC), Zhengzhou, P. R. China

International Journal of Modern Physics C (IJMPC), 2022, vol. 33, issue 12, 1-30

Abstract: In temporal networks, PageRank-based methods are usually used to calculate the importance of nodes. However, almost all the methods focus on the first-order relationships between nodes while ignore higher-order interactions between nodes in the graph. Considering that temporal motifs are recurring, higher-order and significant network connectivity patterns, which can capture both temporal and higher-order structural features in dynamic networks, this paper proposes a novel Personalized Temporal Motif PageRank (PTMP) algorithm to measure the importance of nodes in temporal networks. Specifically, to capture temporal information and higher-order features, we develop a method extracting temporal motif instances from temporal networks, and design an algorithm to compute the weighted motif adjacency matrix and the diagonal motif out-degree matrix, then define a motif transition matrix, which contains the personalized feature and can be used to compute the importance score of nodes. Finally, we make the steady-state analysis for the PTMP algorithm and compare it with other state-of-the-art baselines on multiple real-world datasets. The experimental results demonstrate that the PTMP algorithm is capable of mining much richer important nodes information accurately and effectively.

Keywords: Important nodes mining; temporal networks; Personalized Temporal Motif PageRank algorithm (search for similar items in EconPapers)
Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183122501613
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:33:y:2022:i:12:n:s0129183122501613

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183122501613

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().