hubness calculates the "hubness" (see reference) of the vertices in a
graph. These are vertices which meet at least two of the following four
criteria:
Have high degree/strength
Have high betweenness centrality
Have low clustering coefficient
Have low average path length
For each criterion, "high" or "low" means "in the top 20%" across all vertices. Vertices meeting any of the criteria get a value of 1 for that metric; these are summed to yield the hubness score which ranges from 0-4. As in the reference article, vertices with a score of 2 or higher are to be considered hubs, although that determination isn't made in this function.
hubness(g, xfm.type = g$xfm.type, weights = NULL)An igraph graph object
Character string specifying how to transform the weights
(default: 1/w)
Numeric vector of edge weights; if NULL (the default),
and if the graph has edge attribute weight, then that will be used.
To avoid using weights, this should be NA.
A numeric vector with the vertices' hubness score
van den Heuvel M.P., Mandl R.C.W., Stam C.J., Kahn R.S., Pol H.E.H. (2010) Aberrant frontal and temporal complex network structure in schizophrenia: a graph theoretical analysis. The Journal of Neuroscience, 30(47):15915-15926.