Generalized blockmodeling of two-mode network data

Abstract We extend the direct approach for blockmodeling one-mode data to two-mode data. The key idea in this development is that the rows and columns are partitioned simultaneously but in different ways. Many (but not all) of the generalized block types can be mobilized in blockmodeling two-mode network data. These methods were applied to some ‘voting’ data from the 2000–2001 term of the Supreme Court and to the classic Deep South data on women attending events. The obtained partitions are easy to interpret and compelling. The insight that rows and columns can be partitioned in different ways can be applied also to one-mode data. This is illustrated by a partition of a journal-to-journal citation network where journals are viewed simultaneously as both producers and consumers of scientific knowledge.

[1]  P. Doreian.  Testing structural‐equivalence hypotheses in a network of geographical journals , 1988 .

[2]  P. Arabie,et al.  An algorithm for clustering relational data with applications to social network analysis and comparison with multidimensional scaling , 1975 .

[3]  A. Ferligoj,et al.  Direct and indirect methods for structural equivalence , 1992 .

[4]  Philippa Pattison,et al.  Dynamic Social Network Modelling and Analysis , 2003 .

[5]  L. Freeman.  Finding Social Groups: A Meta-Analysis of the Southern Women Data , 2003 .

[6]  Vladimir Batagelj,et al.  Fitting Pre-specified Blockmodels , 1998 .

[7]  R. Breiger.  The Duality of Persons and Groups , 1974 .

[8]  W. Goodenough,et al.  Human Group , 1951, Encyclopedia of Social Network Analysis and Mining. 2nd Ed..

[9]  V. Batagelj.  Notes on blockmodeling , 1997 .

[10]  K. Reitz,et al.  Graph and Semigroup Homomorphisms on Networks of Relations , 1983 .

[11]  H. White,et al.  An algorithm for finding simultaneous homomorphic correspondences between graphs and their image graphs , 1976 .

[12]  S. Borgatti,et al.  An extension of regular colouring of graphs to digraphs, networks and hypergraphs * , 1993 .

[13]  Patrick Doreian,et al.  Structural equivalence in a psychology journal network , 1985, J. Am. Soc. Inf. Sci..

[14]  Vladimir Batagelj,et al.  Partitioning networks based on generalized concepts of equivalence , 1994 .

[15]  Kathleen M. Carley,et al.  Dynamic Social Network Modeling and Analysis: Workshop Summary and Papers , 2004 .

[16]  A. Ferligoj,et al.  An optimizational approach to regular equivalence , 1992 .

[17]  Ronald S. Burt,et al.  Positions in Networks , 1976 .

[18]  Herschel C. Hudson.  Classifying social data , 1982 .

[19]  H. White,et al.  “Structural Equivalence of Individuals in Social Networks” , 2022, The SAGE Encyclopedia of Research Design.

[20]  Donald R. Baker.  A Structural Analysis of Social Work Journal Network , 1992 .

[21]  Stephen B. Seidman,et al.  Structures induced by collections of subsets: a hypergraph approach , 1981, Math. Soc. Sci..

[22]  Martin G. Everett,et al.  Network analysis of 2-mode data , 1997 .

[23]  Ron Atkin,et al.  Mathematical structure in human affairs , 1976 .

[24]  Martin G. Everett,et al.  Models of core/periphery structures , 2000, Soc. Networks.

[25]  L. Freeman.  Q-analysis and the structure of friendship networks , 1980 .

[26]  Lc Freeman,et al.  USING GALOIS LATTICES TO REPRESENT NETWORK DATA , 1993 .