Social Trusty Algorithm: A New Algorithm for Computing the Trust Score Between All Entities in Social Networks Based on Linear Algebra

The growing importance of social networks has led to increased research into trust estimation and interpretation among network entities. It is important to predict the trust score between users in order to minimize the risks in user interactions. This article enables the identification of the most reliable and least reliable entities in a network by expressing trust scores numerically. In this paper, the social network is modeled as a graph, and trust scores are calculated by taking the powers of the ratio matrix between entities and summing them. Taking the power of the proportion matrix based on the number of entities in the network requires a lot of arithmetic load. After taking the powers of the eigenvalues of the ratio matrix, these are multiplied by the eigenvector matrix to obtain the power of the ratio matrix. In this way, the arithmetic cost required for calculating trust between entities is reduced. This paper calculates the trust score between entities using linear algebra techniques to reduce the arithmetic load. Trust detection algorithms use shortest paths and similar methods to eliminate paths that are deemed unimportant, which makes the result questionable because of the loss of data. The novelty of this method is that it calculates the trust score without the need for explicit path numbering and without any data loss.