Contents
- Index

**NETWORK >2-MODE NETWORKS >2-MODE CENTRALITY **

**PURPOSE **Calculates the 2-mode versions of degree, closeness, betweenness and eigenvector centrality for a binary two mode network.

**DESCRIPTION **Any two mode network can be represented as a bipartite graph and this can be submitted to the standard single mode centrality routines. In this case the normalization of the scores would not be valid. This routine normalizes the scores against the maximum possible scores in an equivalently sized connected two mode network and hence provides approriately scaled measures.

**Input 2-mode matrix:**

** **Name of file containing network to be analyzed. Data type:Two-mode binary matrix.

**(output) Row centrality measures: **(Default=<inputfilename>-rowcent)

Name of UCINET file contating centrality results for the rows

** (output) Column centrality measures: **(Default=<inputfilename>-colcent)

Name of UCINET file contating centrality results for the columns

** **

**LOG FILE **A table of the normalized row centralities for degree, closeness, betweenness and eigenvector followed by a similar table for the column centrality scores.

**TIMING** O(N^3).

**COMMENTS **The eigenvector centrality of a bipartite representation of a two mode network is the same as the singular vectors associated with the two mode data matrix.

**REFERENCES **Borgatti SP and Everett M G (1997) Network analysis of 2-mode data. Social Networks 19 243-269

** **