Volume 118, Number 3, May 2017
|Number of page(s)||7|
|Section||Condensed Matter: Structural, Mechanical and Thermal Properties|
|Published online||13 July 2017|
Centrality measures in temporal networks with time series analysis
1 School of Science, National University of Defense Technology - Changsha, Hunan, China
2 State Key Laboratory of High Performance Computing, National University of Defense Technology Changsha, Hunan, China
Received: 7 March 2017
Accepted: 16 June 2017
The study of identifying important nodes in networks has a wide application in different fields. However, the current researches are mostly based on static or aggregated networks. Recently, the increasing attention to networks with time-varying structure promotes the study of node centrality in temporal networks. In this paper, we define a supra-evolution matrix to depict the temporal network structure. With using of the time series analysis, the relationships between different time layers can be learned automatically. Based on the special form of the supra-evolution matrix, the eigenvector centrality calculating problem is turned into the calculation of eigenvectors of several low-dimensional matrices through iteration, which effectively reduces the computational complexity. Experiments are carried out on two real-world temporal networks, Enron email communication network and DBLP co-authorship network, the results of which show that our method is more efficient at discovering the important nodes than the common aggregating method.
PACS: 64.60.aq – Networks / 05.45.Tp – Time series analysis / 89.75.-k – Complex systems
© EPLA, 2017
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.