Average Transitive Trustworthy Degrees for Trustworthy Networks

摘要

The goal of this paper is to investigate measurement models of transitive trustworthiness for trustworthy networks. The reals in the interval [0, 1] are used to define trust degrees in such a way that the larger its trust degree and the more it is trustworthy. A basic contribution is to introduce the average algorithm for the measurement of the transitive trustworthiness along a path in a weighted digraph. Due to the NP-hardness of the average algorithm for finding simple paths with the maximal average transitive trust degree, we propose the modified matrix operation to compute maximal average transitive trustworthy degrees of paths. This computation is polynomial, but might produce non-simple paths. A simple simulation is also given.