Semirings for social networks analysis

In the paper four semirings for solving social networks problems are constructed. The closure of relational matrix over geodetic semirings contains for every pair of vertices u and v the length and the number of u ‐ v geodesics; and for geosetic semiring the length and the set of vertices on u — v geodesics. The algorithms for computing the geodetic and the geosetic closure matrix are also given. The closures of the matrix of a given signed graph over balance and cluster semirings can be used to decide whether the graph is balanced or clusterable.

[1]  J. Riley.  An application of graph theory to social psychology , 1969 .

[2]  F. Harary,et al.  Structural Models in Anthropology , 1986 .

[3]  Rainer E. Burkard,et al.  Algebraic and combinatorial methods in operations research : proceedings of the Workshop on Algebraic Structures in Operations Research , 1984 .

[4]  James A. Davis.  Clustering and Structural Balance in Graphs , 1977 .

[5]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[6]  F. Harary.  On the notion of balance of a signed graph. , 1953 .

[7]  R. Boyle.  Algebraic Systems for Normal and Hierarchical Sociograms , 1969 .

[8]  Roger V. Gould.  Measures of betweenness in non-symmetric networks , 1987 .

[9]  F. Harary,et al.  On the Coloring of Signed Graphs. , 1968 .

[10]  G. Chartrand.  Introductory Graph Theory , 1984 .

[11]  U. Zimmermann.  Linear and combinatorial optimization in ordered algebraic structures , 1981 .

[12]  F. Roberts.  Discrete Mathematical Models with Applications to Social, Biological, and Environmental Problems. , 1976 .

[13]  I. Anderson,et al.  Graphs and Networks , 1981, The Mathematical Gazette.

[14]  Norman,et al.  Structural Models: An Introduction to the Theory of Directed Graphs. , 1966 .

[15]  Patrick Doreian,et al.  Mathematics and the study of social relations , 1970 .

[16]  J. G. Fletcher,et al.  A more general algorithm for computing closed semiring costs between vertices of a directed graph , 1980, CACM.

[17]  Frank Harary,et al.  CHAPTER 3 – BALANCE AND CLUSTERABILITY: AN OVERVIEW , 1979 .

[18]  Samuel Leinhardt,et al.  Perspectives on social network research , 1980 .

[19]  S. F. Kapoor,et al.  The Many Facets of Graph Theory , 1969 .

[20]  Patrick Doreian,et al.  On the connectivity of social networks , 1974 .

[21]  Martin G. Everett,et al.  A graph theoretic blocking procedure for social networks , 1982 .

[22]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .