Centrality Ranking via Topologically Biased Random Walks in Multiplex Networks.
Cangfeng DingKan LiPublished in: IJCNN (2018)
Keyphrases
- random walk
- markov random walk
- network analysis
- link prediction
- link spam
- average degree
- pagerank algorithm
- social networks
- network structure
- community detection
- link analysis
- social network analysis
- directed graph
- betweenness centrality
- markov chain
- transition probability matrix
- web search
- community structure
- ranking algorithm
- flow graph
- centrality measures
- transition probabilities
- complex networks
- network size
- spectral methods
- stationary distribution
- terrorist networks
- d objects
- web spam
- bipartite graph
- spam detection
- graph mining
- clustering algorithm