The analysis of semigroups of multirelational systems

Abstract A finite family of binary relations on a finite set, termed here a relational system, generates a finite semigroup under the operation of relational composition. The relationship between simplifications of the semigroup of a relational system in the form of homomorphic images, and simplifications of the relational system itself is examined. First of all, the list of relational conditions establishing a relationship between a homomorphic image of the semigroup of a relational system and a simplified, or derived, version of that relational system, is reviewed and extended. Then a definition of empirical relationship is introduced (the Correspondence Definition) and it is shown how, in conjunction with a factorization procedure for finite semigroups ( P. E. Pattison & W. K. Bartlett, Journal of Mathematical Psychology , 1982 , in press), it leads to a systematic and efficient analysis for a relational system. Applications of the procedure to an empirical blockmodel and to a class of simple relational systems are presented.

[1]  Phipps Arabie,et al.  Constructing blockmodels: How and why , 1978 .

[2]  John P. Boyd,et al.  The universal semigroup of relations , 1979 .

[3]  P. Pattison,et al.  The Joint Role Structure of Two Communities' Elites , 1978 .

[4]  P. Arabie.  Clustering representations of group overlap , 1977 .

[5]  Štefan Schwarz.  On the semigroup of binary relations on a finite set , 1970 .

[6]  P. Arabie,et al.  Algebraic Approaches to the Comparison of Concrete Social Structures Represented as Networks: Reply to Bonacich , 1980, American Journal of Sociology.

[7]  Philippa Pattison,et al.  A factorization procedure for finite algebras , 1982 .

[8]  R. Burt.  Applied Network Analysis , 1978 .

[9]  S. Boorman,et al.  Social Structure from Multiple Networks. II. Role Structures , 1976, American Journal of Sociology.

[10]  John P. Boyd,et al.  The algebra of group kinship , 1969 .

[11]  R. Brieger.  Career Attributes and Network Structure: A Blockmodel Study of a Biomedical Research Specialty , 1976 .

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

[13]  Roger N. Shepard,et al.  Additive clustering: Representation of similarities as combinations of discrete overlapping properties. , 1979 .

[14]  F. Harary,et al.  STRUCTURAL BALANCE: A GENERALIZATION OF HEIDER'S THEORY1 , 1977 .

[15]  J. F. Meyer.  ALGEBRAIC ISOMORPHISM INVARIANTS FOR GRAPHS OF AUTOMATA , 1972 .

[16]  A. G. Kurosh,et al.  Lectures on general algebra , 1966 .

[17]  Frank Harary,et al.  Graph Theory , 2016 .

[18]  A. Clifford,et al.  The algebraic theory of semigroups , 1964 .

[19]  An algebraic analysis for multiple, social networks , 1980 .

[20]  Phillip Bonacich,et al.  The "Common Structure Semigroup," a Replacement for the Boorman and White "Joint Reduction" , 1980, American Journal of Sociology.

[21]  T. Newcomb.  The acquaintance process , 1961 .

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

[23]  Ronald L. Breiger,et al.  Toward an operational theory of community elite structures , 1979 .

[24]  Frank Harary,et al.  Ambivalence and indifference in generalizations of structural balance , 1970 .

[25]  Stephen B. Seidman,et al.  A graph‐theoretic generalization of the clique concept* , 1978 .

[26]  J. Rhodes,et al.  Algebraic theory of machines. I. Prime decomposition theorem for finite semigroups and machines , 1965 .

[27]  P. Pattison.  A Reply to McConaghy , 1981 .

[28]  S. Boorman,et al.  Social Structure from Multiple Networks. I. Blockmodels of Roles and Positions , 1976, American Journal of Sociology.

[29]  H. White,et al.  Probabilities of homomorphic mappings from multiple graphs , 1977 .

[30]  Maureen J. McConaghy.  The Common Role Structure Improved Blockmodeling Methods Applied to Two Communities' Elites , 1981 .