Trust Transitivity in Social Networks

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 in/out-degree distributions, 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 in/out-degrees, in detriment of the authorities and its “fringe” peers.

[1]  Gillian Dobbie,et al.  Proceedings of the 29th Australasian Computer Science Conference - Volume 48 , 2006 .

[2]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[3]  Marián Boguñá,et al.  Clustering in complex networks. II. Percolation properties. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Marián Boguñá,et al.  Clustering in complex networks. I. General formalism. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Guido Caldarelli,et al.  Networks with arbitrary edge multiplicities , 2011, ArXiv.

[6]  S. Bornholdt,et al.  Handbook of Graphs and Networks , 2012 .

[7]  M. Newman,et al.  Mixing patterns in networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[9]  Matteo Marsili,et al.  Rollover Risk, Network Structure and Systemic Financial Crises , 2009 .

[10]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[11]  Jon Callas,et al.  OpenPGP Message Format , 1998, RFC.

[12]  Audun Jøsang,et al.  Trust network analysis with subjective logic , 2006, ACSC.

[13]  Stefano Battiston,et al.  Personalised and dynamic trust in social networks , 2009, RecSys '09.

[14]  Chris Arney.  Network Analysis: Methodological Foundations , 2012 .

[15]  Nicholaas J. Vriend.  Self-Orgainzed Market in a Decentralized Economy , 1994 .

[16]  Lars Schmidt-Thieme,et al.  Proceedings of the third ACM conference on Recommender systems , 2008, RecSys 2008.

[17]  A. Arenas,et al.  Models of social networks based on social distance attachment. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  J. Kurths,et al.  Reciprocity of networks with degree correlations and arbitrary degree sequences. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Josef Stoer,et al.  Numerische Mathematik 1 , 1989 .

[20]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[21]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[22]  J. Reichardt,et al.  Statistical mechanics of community detection. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  János Kertész,et al.  Clustering in complex networks , 2004 .

[24]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[25]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[26]  M. Newman,et al.  Why social networks are different from other types of networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  A. Arenas,et al.  Macro- and micro-structure of trust networks , 2002, cond-mat/0206240.

[28]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[29]  Hector Garcia-Molina,et al.  The Eigentrust algorithm for reputation management in P2P networks , 2003, WWW '03.

[30]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[31]  Steve Lawrence,et al.  Proceedings of the 12th international conference on World Wide Web , 2003 .