Trust evaluation for indirectly connected nodes using link community information

Inspired by recent empirical research on link communities, we borrow some important ideas and concepts for our own research to provide a more reasonable computation model of transitive trust. The key advantages of using link community methodology is to reflect on the nature of the social network features of Hierarchy and Overlap. Our research mainly resolves the computation of trust transitivity in which two nodes do not have any direct links to any link community. In this research, we discover a new direction analyzing trust transitivity. By using a social network game, we found that the link community methodology is a natural way to analyze trust in social networks. We also discovered, even in a small social network, trust has certain community features.