Ranked Clusterability Model of Dyadic Data in Social Network

The dyads relationship as a substantial portion of triads or larger structure formed a ranked clusterability model in social network. Ranked clusterability model of dyads postulates that the hierarchical clustering process starts from the mutual dyads which occur only within clusters then stop until all of the mutual dyads grouped. The hierarchy process continues to cluster the asymmetric dyads which occur between clusters but at different levels. Then the last process is clustering the null dyads, which is clustered at the end of the hierarchy after all of asymmetric dyads grouped and occur only between clusters at the same level of the hierarchy. This paper explores a ranked clusterability model of dyads from a simple example of social network and represents it to the new sociomatrix that facilitate to view a whole network and presents the result in a dendrogram network data. This model adds a new insight to the development of science in a clustering study of emerging social network.