The ability for a user to accurately estimate the amount of trust to be placed in a peer user is gaining more and more attention in social network applications. Trust aggregation provides this ability by identifying paths that connect users in the network, and by merging trust opinions expressed by users along these paths. However, as individual trust opinions are not always based on perfect knowledge, and since the quality of a trust estimation propagated along a given path may diminish as its length increases, mechanisms are needed to handle these imperfections. In this paper, we propose a set of trust aggregation operators that take into account knowledge defects and path length. We investigate their properties, and discuss how they may be implemented in practice, taking into account characteristics of the network such as the availability of a central authority, or the need to preserve users' privacy by not publically disclosing their trust information.