Trust transitivity in social networks

Abstract

Non-centralized recommendation-based decision making is a central feature of several social and technological processes, such as market dynamics, peer-to-peer file-sharing and the web of trust of digital certification. We investigate the properties of trust propagation on networks, based on a simple metric of trust transitivity. We investigate analytically the percolation properties of trust transitivity in random networks with arbitrary degree distribution, and compare with numerical realizations. We find that the existence of a non-zero fraction of absolute trust (i.e. entirely confident trust) is a requirement for the viability of global trust propagation in large systems: The average pair-wise trust is marked by a discontinuous transition at a specific fraction of absolute trust, below which it vanishes. Furthermore, we perform an extensive analysis of the Pretty Good Privacy (PGP) web of trust, in view of the concepts introduced. We compare different scenarios of trust distribution: community- and authority-centered. We find that these scenarios lead to sharply different patterns of trust propagation, due to the segregation of authority hubs and densely-connected communities. While the authority-centered scenario is more efficient, and leads to higher average trust values, it favours weakly-connected "fringe" nodes, which are directly trusted by authorities. The community-centered scheme, on the other hand, favours nodes with intermediate degrees, in detriment of the authorities and its "fringe" peers.

11 pages, 9 figures (with minor corrections)

References in corpus (5)

• Statistical Mechanics of Community Detection
• Clustering in complex networks. I. General formalism
• Clustering in complex networks. II. Percolation properties
• Reciprocity of Networks with Degree Correlations and Arbitrary Degree Sequences
• Macro- and micro-structure of trust networks

Cited by in corpus (16)

• Hierarchical Block Structures and High-resolution Model Selection in Large Networks
• Efficient Monte Carlo and greedy heuristic for the inference of stochastic block models
• Nonparametric Bayesian inference of the microcanonical stochastic block model
• Statistical Inference for Valued-Edge Networks: Generalized Exponential Random Graph Models
• Model selection and hypothesis testing for large-scale network models with overlapping groups
• Hypergraph reconstruction from network data
• Reconstructing networks with unknown and heterogeneous errors
• Consistencies and inconsistencies between model selection and link prediction in networks
• Discrete Opinion Dynamics with M choices
• Network structure, metadata and the prediction of missing nodes and annotations
• Trust in the CODA model: Opinion Dynamics and the reliability of other agents
• Map Equation Centrality: Community-aware Centrality based on the Map Equation
• Percolation and the effective structure of complex networks
• Structural measures of similarity and complementarity in complex networks
• Ordered community detection in directed networks
• A Framework of Algorithms: Computing the Bias and Prestige of Nodes in Trust Networks