Identifying Top-K Important Nodes Based on Probabilistic-Jumping Random Walk in Complex Networks.
Hui YuLuyuan ChenXi CaoZun LiuYongjun LiPublished in: COMPLEX NETWORKS (2017)
Keyphrases
- random walk
- complex networks
- directed graph
- scale free networks
- real world networks
- network structure
- link prediction
- betweenness centrality
- small world
- nodes of a graph
- undirected graph
- scale free
- proximity measures
- markov random walk
- community detection
- average degree
- network analysis
- social networks
- centrality measures
- social network analysis
- graph theory
- community structure
- markov chain
- flow graph
- functional modules
- biological networks
- probabilistic model
- small world networks
- transition probabilities
- transition probability matrix
- shortest path
- query processing
- terrorist networks
- bayesian networks
- network evolution
- overlapping communities
- graph structure
- network motifs
- community detection algorithms
- clustering coefficient
- community discovery
- online social networks
- machine learning