Characterization of clusterability of signed graph in terms of Newcomb's balance of sentiments

摘要

Clusterability of a signed graph is characterized with a concept of stability of sentiments given by Newcomb in social psychology. Compared to an existing characterization, the characterization given in this paper is more useful to interpret the clustering of a group of persons in the real world as a psychological phenomenon.