Identifying abnormal nodes in complex networks by using random walk measure.
Lilian BertonJean HuertasBilzã AraújoLiang ZhaoPublished in: IEEE Congress on Evolutionary Computation (2010)
Keyphrases
- random walk
- complex networks
- betweenness centrality
- proximity measures
- link prediction
- centrality measures
- directed graph
- real world networks
- network structure
- scale free networks
- social network analysis
- degree centrality
- small world
- network analysis
- community detection
- average degree
- undirected graph
- markov chain
- social networks
- information theoretic concepts
- nodes of a graph
- transition probabilities
- community structure
- scale free
- biological networks
- network topology
- graph theory
- small world networks
- community discovery
- flow graph
- transition probability matrix
- network motifs
- overlapping communities
- shortest path
- markov random walk
- functional modules
- community detection algorithms
- clustering coefficient
- distance measure
- web graph
- similarity measure