Temporal Gravity Model for Important Nodes Identification in Temporal Networks
July 04, 2020 Β· Declared Dead Β· π Chaos, Solitons & Fractals
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Jialin Bi, Ji Jin, Cunquan Qu, Xiuxiu Zhan, Guanghui Wang
arXiv ID
2007.02097
Category
physics.soc-ph
Cross-listed
cs.SI
Citations
22
Venue
Chaos, Solitons & Fractals
Last Checked
3 months ago
Abstract
Identifying important nodes is one of the central tasks in network science, which is crucial for analyzing the structure of a network and understanding the dynamical processes on a network. Most real-world systems are time-varying and can be well represented as temporal networks. Motivated by the classic gravity model in physics, we propose a temporal gravity model to identify influential nodes in temporal networks. Two critical elements in the gravity model are the masses of the objects and the distance between two objects. In the temporal gravity model, we treat nodes as the objects, basic node properties, such as static and temporal properties, as the nodes' masses. We define temporal distances, i.e., fastest arrival distance and temporal shortest distance, as the distance between two nodes in our model. We utilize our model as well as the baseline centrality methods on important nodes identification. Experimental results on ten real-world datasets show that the temporal gravity model outperforms the baseline methods in quantifying node structural influence. Moreover, when we use the temporal shortest distance as the distance between two nodes, our model is robust and performs the best in quantifying node spreading influence compared to the baseline methods.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β physics.soc-ph
π
π
The Cartographer
R.I.P.
π»
Ghosted
Networks beyond pairwise interactions: structure and dynamics
R.I.P.
π»
Ghosted
Statistical physics of human cooperation
R.I.P.
π»
Ghosted
Vital nodes identification in complex networks
R.I.P.
π»
Ghosted
Influence maximization in complex networks through optimal percolation
R.I.P.
π»
Ghosted
Scale-free networks are rare
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted