Trust transitivity in social networks

PLoS ONE

Volumn 6, Issue 4, 2011, Pages

  Richters, Oliver ^a   Peixoto, Tiago P ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; AUTHORITY; COMMUNITY; DECISION MAKING; MATHEMATICAL ANALYSIS; MATHEMATICAL MODEL; PRIVACY; SOCIAL NETWORK; TRUST; INTERNET; SOCIAL SUPPORT; THEORETICAL MODEL; TIME;

INTERNET; MODELS, THEORETICAL; SOCIAL SUPPORT; TIME FACTORS; TRUST;

EID: 79953680487     PISSN: None     EISSN: 19326203     Source Type: Journal    
DOI: 10.1371/journal.pone.0018384     Document Type: Article

References (25)

1. Vriend NJ, (1994) Self-Orgainzed market in a decentralized economy. Santa Fe Institute Working Paper 94-03-013.
2. Anand K, Gai P, Marsili M, (2009) Rollover risk, network structure and systemic financial crises. Social Science Research Network 1507196.
3. Kamvar SD, Schlosser MT, Garcia-Molina H, (2003) The eigentrust algorithm for reputation management in P2P networks. Proceedings of the 12th international conference on World Wide Web Budapest, Hungary ACM pp. 640-651.
4. Guardiola X, Guimera R, Arenas A, Diaz-Guilera A, Streib D, et al. (2002) Macro- and micro-structure of trust networks. arXiv:cond-mat/ 0206240.
5. Boguñá M, Pastor-Satorras R, Díaz-Guilera A, Arenas A, (2004) Models of social networks based on social distance attachment. Physical Review E 70: 056122.
6. Newman M, (2010) Networks: An Introduction. Oxford University Press.
7. Dijkstra EW, (1959) A note on two problems in connexion with graphs. Numerische mathematik 1: 269-271.
8. Brandes U, Erlebach T, (2005) Network Analysis: Methodological Foundations. Springer, 1 edition.
9. Jøsang A, Hayward R, Pope S, (2006) Trust network analysis with subjective logic. Proceedings of the 29th Australasian Computer Science Conference-Volume 48. 94 p.
10. Walter FE, Battiston S, Schweitzer F, (2009) Personalised and dynamic trust in social networks. Proceedings of the third ACM conference on Recommender systems- RecSys '09 New York, New York, USA. 197 p.
11. Page L, Brin S, Motwani R, Winograd T, (1999) The PageRank citation ranking: Bringing order to the web. Stanford Infolab. 17 p.
12. Newman MEJ, Strogatz SH, Watts DJ, (2001) Random graphs with arbitrary degree distributions and their applications. Physical Review E 64: 026118.
13. Thayer R, Donnerhacke L, Shaw D, Finney H, Callas J, (2007) OpenPGP message format. 16 Available: http://tools.ietf.org/html/rfc4880. Accessed 2011 Mar.
14. Menezes A, van Oorschot P, Vanstone S, (1996) Handbook of Applied Cryptography. CRC Press, 1 edition.
15. Brennen VA, (2008) The keysigning party HOWTO.
16. Newman MEJ, (2003) The structure and function of complex networks. SIAM Review 45: 167-256.
17. Zamora-López G, Zlatić V, Zhou C, Štefančić H, Kurths J, (2008) Reciprocity of networks with degree correlations and arbitrary degree sequences. Physical Review E 77: 016106.
18. Newman MEJ, Girvan M, (2004) Finding and evaluating community structure in networks. Physical Review E 69: 026113.
19. Newman MEJ, (2003) Mixing patterns in networks. Phys Rev E 67: 026126.
20. Newman MEJ, Park J, (2003) Why social networks are different from other types of networks. Physical Review E 68: 036122.
21. Reichardt J, Bornholdt S, (2006) Statistical mechanics of community detection. Phys Rev E 74: 016110-14.
22. Freeman LC, (1977) A set of measures of centrality based on betweenness. Sociometry 40: 35-41.
23. Ángeles Serrano M, Boguñá M, (2006) Clustering in complex networks. I. general formalism. Physical Review E 74: 056114.
24. Ángeles Serrano M, Boguñá M, (2006) Clustering in complex networks. II. percolation properties. Physical Review E 74: 056115.
25. Zlatic V, Garlaschelli D, Caldarelli G, (2011) Complex networks with arbitrary edge multiplicities. arXiv pp. 1101.2435.