concorR: The concorR Package
In concorR: CONCOR and Supplemental Functions

Description Author(s) References

concorR implements the CONCOR (CONvergence of iterated CORrelations) algorithm as introduced by Breiger, Boorman, and Arabie (1975) and detailed by Wasserman and Faust (1994). This package includes the concor algorithm itself, and some useful functions for plotting and interpreting the outputs. The plotting methods included are: plotting the overall network with the concor partitions as colors (using the igraph package), plotting a blockmodel using the concor partitions (using the sna package), and plotting reduced network graphs showing the connections between concor partitions (again using igraph).

Tyme Suda suda.4@wright.edu

Adrienne Traxler adrienne.traxler@wright.edu

This work was supported by National Science Foundation awards DUE-1712341 and DUE-1711017.

R. L. Breiger, S. A. Boorman, P. Arabie, An algorithm for clustering relational data with applications to social network analysis and comparison with multidimensional scaling. J. of Mathematical Psychology. 12, 328 (1975). doi: 10.1016/0022-2496(75)90028-0

S. Wasserman and K. Faust, Social Network Analysis: Methods and Applications (Cambridge University Press, 1994).

concorR documentation built on Nov. 26, 2020, 1:08 a.m.