Quasi-stationary distributions as centrality measures for the giant strongly connected component of a reducible graph.
Konstantin AvrachenkovVivek S. BorkarDanil NemirovskyPublished in: J. Comput. Appl. Math. (2010)
Keyphrases
- strongly connected
- stationary distribution
- centrality measures
- directed graph
- random walk
- social network analysis
- optimum path forest
- network analysis
- social networks
- markov chain
- undirected graph
- connected components
- structural properties
- queue length
- initial state
- clustering coefficient
- terrorist networks
- queueing networks
- network topology
- directed acyclic graph
- service times
- wireless sensor networks