Quasi-stationary distributions as centrality measures of reducible graphs

Details Quasi-stationary distributions as centrality measures of reducible graphs Quasi-stationary distributions as centrality measures of reducible graphs

2007-08-03

arxiv.org/abs/0708.0522v2

Computer Science

Networking and Internet Architecture

Scientific paper

Random walk can be used as a centrality measure of a directed graph. However, if the graph is reducible the random walk will be absorbed in some subset of nodes and will never visit the rest of the graph. In Google PageRank the problem was solved by introduction of uniform random jumps with some probability. Up to the present, there is no clear criterion for the choice this parameter. We propose to use parameter-free centrality measure which is based on the notion of quasi-stationary distribution. Specifically we suggest four quasi-stationary based centrality measures, analyze them and conclude that they produce approximately the same ranking. The new centrality measures can be applied in spam detection to detect ``link farms'' and in image search to find photo albums.

Affiliated with

Also associated with

No associations

Rating

Quasi-stationary distributions as centrality measures of reducible graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quasi-stationary distributions as centrality measures of reducible graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quasi-stationary distributions as centrality measures of reducible graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-602148