powered by
Calculate the mean eigenvalue centrality of a graph.
metric.eigen.mean(g)
The input network.
A real constant.
metric.eigen.mean calculates the mean eigenvalue centrality score of graph g.
metric.eigen.mean
Bonacich, Phillip, and Paulette Lloyd. "Eigenvector-like measures of centrality for asymmetric relations." Social networks 23, no. 3 (2001): 191-201.
Borgatti, Stephen P. "Centrality and network flow." Social networks 27, no. 1 (2005): 55-71.
# NOT RUN { x <- net.erdos.renyi.gnp(1000, 0.01) metric.eigen.mean(x) # }
Run the code above in your browser using DataLab