get.biDegreeCentrality: Degree centrality for Bipartite Graphs.

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

Description

Measures graph degree centrality for bipartite graphs as well as Unipartite Graphs.The degree centrality of a vertex can be defined as fraction of incident edges over the number of all possible edges. This function is the adaption to bipartite graphs as presented in Borgatti and Everett (1997).

Usage

get.biDegreeCentrality(A,loops=FALSE,SM=TRUE)

Arguments

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

Details

Compute Degree Centrality of the Bipartite Graph

Value

It returns a list of score of degree centrality of nodes at rows and nodes at columns.

Returns a list scores of the degree centrality the nodes in the rows are scored first followed by column vertices. By deafult SM=TRUE which return the betweeness 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.