EigenvectorCentrality

java.lang.Object
- edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer<V,E,S>
- - edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorerWithPriors<V,E,java.lang.Double>
  - - edu.uci.ics.jung.algorithms.scoring.PageRankWithPriors<V,E>
    - - edu.uci.ics.jung.algorithms.scoring.PageRank<V,E>
      - edu.uci.ics.jung.algorithms.scoring.EigenvectorCentrality<V,E>

All Implemented Interfaces:

VertexScorer<V,java.lang.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.

Field Summary
- Fields inherited from class edu.uci.ics.jung.algorithms.scoring.PageRankWithPriors
  disappearing_potential
- Fields inherited from class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorerWithPriors
  alpha, vertex_priors
- Fields inherited from class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer
  edge_weights, graph, hyperedges_are_self_loops, max_delta, max_iterations, output_reversed, tolerance, total_iterations

Constructor Summary

Constructors
Constructor	Description
`EigenvectorCentrality(edu.uci.ics.jung.graph.Hypergraph<V,E> graph)`	Creates an instance with the specified graph and default edge weights.
`EigenvectorCentrality(edu.uci.ics.jung.graph.Hypergraph<V,E> graph, org.apache.commons.collections4.Transformer<E,? extends java.lang.Number> edge_weights)`	Creates an instance with the specified graph and edge weights.

Method Summary
- Methods inherited from class edu.uci.ics.jung.algorithms.scoring.PageRankWithPriors
  afterStep, collectDisappearingPotential, update
- Methods inherited from class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorerWithPriors
  getAlpha, getVertexPrior, getVertexPriors, initialize
- Methods inherited from class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer
  acceptDisconnectedGraph, done, evaluate, getAdjustedIncidentCount, getCurrentValue, getEdgeWeight, getEdgeWeights, getIterations, getMaxIterations, getOutputValue, getTolerance, getVertexScore, isDisconnectedGraphOK, setCurrentValue, setEdgeWeights, setHyperedgesAreSelfLoops, setMaxIterations, setOutputValue, setTolerance, step, swapOutputForCurrent, updateMaxDelta
- Methods inherited from class java.lang.Object
  clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
- Methods inherited from interface edu.uci.ics.jung.algorithms.scoring.VertexScorer
  getVertexScore

- Constructor Detail
  - EigenvectorCentrality
```
public EigenvectorCentrality(edu.uci.ics.jung.graph.Hypergraph<V,E> graph,
                             org.apache.commons.collections4.Transformer<E,? extends java.lang.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(edu.uci.ics.jung.graph.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.