evcent {sna} | R Documentation

## Find Eigenvector Centrality Scores of Network Positions

### Description

`evcent` takes one or more graphs (`dat`) and returns the eigenvector centralities of positions (selected by `nodes`) within the graphs indicated by `g`. This function is compatible with `centralization`, and will return the theoretical maximum absolute deviation (from maximum) conditional on size (which is used by `centralization` to normalize the observed centralization score).

### Usage

    evcent(dat, g=1, nodes=NULL, gmode="digraph", diag=FALSE,
        tmaxdev=FALSE, rescale=FALSE)

### Arguments

`dat` | one or more input graphs.
`g` | integer indicating the index of the graph for which centralities are to be calculated (or a vector thereof). By default, `g`=1.
`nodes` | vector indicating which nodes are to be included in the calculation. By default, all nodes are included.
`gmode` | string indicating the type of graph being evaluated. "digraph" indicates that edges should be interpreted as directed; "graph" indicates that edges are undirected. This is currently ignored.
`diag` | boolean indicating whether or not the diagonal should be treated as valid data. Set this true if and only if the data can contain loops. `diag` is `FALSE` by default.
`tmaxdev` | boolean indicating whether or not the theoretical maximum absolute deviation from the maximum nodal centrality should be returned. By default, `tmaxdev==FALSE`.
`rescale` | if true, centrality scores are rescaled such that they sum to 1.

### Details

Eigenvector centrality scores correspond to the values of the first eigenvector of the graph adjacency matrix; these scores may, in turn, be interpreted as arising from a reciprocal process in which the centrality of each actor is proportional to the sum of the centralities of those actors to whom he or she is connected. In general, vertices with high eigenvector centralities are those which are connected to many other vertices which are, in turn, connected to many others (and so on). (The perceptive may realize that this implies that the largest values will be obtained by individuals in large cliques (or high-density substructures). This is also intelligible from an algebraic point of view, with the first eigenvector being closely related to the best rank-1 approximation of the adjacency matrix (a relationship which is easy to see in the special case of a diagonalizable symmetric real matrix via the SLS^-1 decomposition).)

The simple eigenvector centrality is generalized by the Bonacich power centrality measure; see `bonpow` for more details.

### Value

A vector, matrix, or list containing the centrality scores (depending on the number and size of the input graphs).

### WARNING

`evcent` will not symmetrize your data before extracting eigenvectors; don't send this routine asymmetric matrices unless you really mean to do so.

### Note

The theoretical maximum deviation used here is not obtained with the star network, in general. For symmetric data, the maximum occurs for an empty graph with one complete dyad; the maximum deviation for asymmetric data is generated by the outstar. UCINET V seems not to adjust for this fact, which can cause some oddities in their centralization scores (and results in a discrepancy in centralizations between the two packages).

### Author(s)

Carter T. Butts buttsc@uci.edu

### References

Bonacich, P. (1987). ``Power and Centrality: A Family of Measures.'' American Journal of Sociology, 92, 1170-1182.

Katz, L. (1953). ``A New Status Index Derived from Sociometric Analysis.'' Psychometrika, 18, 39-43.

### See Also

`centralization`, `bonpow`

### Examples

    #Generate some test data
    dat<-rgraph(10,mode="graph")
    #Compute eigenvector centrality scores
    evcent(dat)

[Package sna version 1.1 Index]