clusterrank: Find the ClusterRank ranks in a graph
In centiserve: Find Graph Centrality Indices

Description Usage Arguments Details Value Author(s) References Examples

Mathematically, the ClusterRank score s_i of node i is defined as:

s_i = f(c_i) sum(k_out,j+1, j in tau _i)

where the term f(c_i) accounts for the effect of i's local clustering and the term '+1' results from the contribution of j itself.
Here f(c_i) = 10^(-c_i)

1	clusterrank(graph, vids = V(graph), directed = TRUE, loops = TRUE)

`graph`	The input graph as igraph object
`vids`	Vertex sequence, the vertices for which the centrality values are returned. Default is all vertices.
`directed`	Logical scalar, whether to directed graph is analyzed. This argument is ignored for undirected graphs.
`loops`	Logical; whether the loop edges are also counted.

ClusterRank is a local ranking algorithm which takes into account not only the number of neighbors and the neighbors' influences, but also the clustering coefficient.
ClusterRank can also be applied to undirected networks where the superiority of ClusterRank is significant compared with degree centrality and k-core decomposition.
More detail at ClusterRank

A numeric vector contaning the centrality scores for the selected vertices.

Mahdi Jalili m_jalili@farabi.tums.ac.ir

Chen, Duan-Bing, et al. "Identifying influential nodes in large-scale directed networks: the role of clustering." PloS one 8.10 (2013): e77455.

1 2	g <- graph(c(1,2,2,3,3,4,4,2,2,5,5,3,4,1,4,3,1,6,6,3,3,6,2,6,5,6)) clusterrank(g)

Loading required package: igraph

Attaching package: 'igraph'

The following objects are masked from 'package:stats':

    decompose, spectrum

The following object is masked from 'package:base':

    union

Loading required package: Matrix
[1] 3.000000 5.333333 0.000000 3.333333 5.000000      NaN