Class RandomWalkBetweenness<V,​E>

  • All Implemented Interfaces:
    IterativeContext

    public class RandomWalkBetweenness<V,​E>
    extends RandomWalkSTBetweenness<V,​E>
    Computes betweenness centrality for each vertex in the graph. The betweenness values in this case are based on random walks, measuring the expected number of times a node is traversed by a random walk averaged over all pairs of nodes. The result is that each vertex has a UserData element of type MutableDouble whose key is 'centrality.RandomWalkBetweennessCentrality' A simple example of usage is:
    RandomWalkBetweenness ranker = new RandomWalkBetweenness(someGraph);
    ranker.evaluate();
    ranker.printRankings();

    Running time is: O((m+n)*n^2).

    See Also:
    "Mark Newman: A measure of betweenness centrality based on random walks, 2002."
    • Constructor Detail

      • RandomWalkBetweenness

        public RandomWalkBetweenness​(edu.uci.ics.jung.graph.UndirectedGraph<V,​E> g)
        Constructor which initializes the algorithm
        Parameters:
        g - the graph whose nodes are to be analyzed