Abstract: Current trust aggregation methods have the problems of information loss or repetitive calculation that limit analysis and disposal of the dependent relationships in transitivity trust networks, which leads to the deviation between the computation trust value and the direct recommendation increasing. This article introduced a definition of trust subgraph, combined with its left neighboring nodes and right neighboring nodes, proved the existence of a relationship between the dependent relationships and the in-degree and out degree of nodes in trust graph, we proposed an algorithm to eliminate the dependency existed in trust graph. We also provided a numerical example to illustrate the validity and feasibility of our method.

Key words: Trust networks, Trust aggregation, Trust sulrgraph, Dependent relationships