get.biClosenessCentralit: Closeness centrality for bipartite graphs.

In abhik1368/netpredictor: Algorithms to search for missing link in a graph.

Description

Measures Closeness centrality of bipartite graphs . The closeness centrality of a vertex is inversely proportional to the total geodesic distance to all other vertices. It also has way to calculate single mode betweeness centrality. Single mode centralization for bipartite graphs measures the extent to which vertices in one vertex subset are central relative only to other vertices in the same subset. This function is the adaption to bipartite graphs as presented in Borgatti and Everett (1997).

Usage

get.biClosenessCentrality(A, SM = TRUE)

Arguments

A	Biparite matrix object
SM	Either TRUE or FALSE . If TRUE returns average centrality for rows and columns. If false returns degree centrality for all the nodes.

Details

Closeness centrality for bipartite graphs

Value

Returns a list scores of closeness centrality of the nodes.By deafult SM=TRUE which return the closeness centrality for two different sets of nodes.

References

• Borgatti, S. P. and Everett, M. G. (1997) Network analysis of 2–mode data. Social Networks 19, 243–269.

abhik1368/netpredictor documentation built on May 10, 2019, 4:09 a.m.