Class EigenvectorCentrality<V,E>

All Implemented Interfaces:
VertexScorer<V,Double>, IterativeContext

public class EigenvectorCentrality<V,E> extends PageRank<V,E>
Calculates eigenvector centrality for each vertex in the graph. The 'eigenvector centrality' for a vertex is defined as the fraction of time that a random walk(er) will spend at that vertex over an infinite time horizon. Assumes that the graph is strongly connected.
  • Constructor Details

    • EigenvectorCentrality

      public EigenvectorCentrality(Hypergraph<V,E> graph, com.google.common.base.Function<E,? extends Number> edge_weights)
      Creates an instance with the specified graph and edge weights. The outgoing edge weights for each edge must sum to 1. (See UniformDegreeWeight for one way to handle this for undirected graphs.)
      Parameters:
      graph - the graph for which the centrality is to be calculated
      edge_weights - the edge weights
    • EigenvectorCentrality

      public EigenvectorCentrality(Hypergraph<V,E> graph)
      Creates an instance with the specified graph and default edge weights. (Default edge weights: UniformDegreeWeight.)
      Parameters:
      graph - the graph for which the centrality is to be calculated.