Abstract
The massive use of web based social networks endorse trustworthiness to establish reliable relationships. Trust is often used to rank entities hence during the attachment process in a trust network, newcomers aim at improving their rank. Moreover, since in real systems each new link implies some cost for the node, we also consider how many links (i.e. how much effort) a node must exert in order to achieve a given rank. In this work, the rank-effort relationship in networks with a high number of nodes and different topologies - random and scale-free - also in presence of communities is considered, in order to examine how the topology affects the attachment process. Results show that the behavior is similar with differences on the effort required to get the same rank in different topologies; in addition, a good rank can be achieved with a considerably less effort than the best rank, thus a satisfactory rank-effort tradeoff can be found for each topology.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Golbeck, J.: The dynamics of web-based social networks: Membership, relationships, and change. First Monday 12(11) (2007)
Artz, D., Gil, Y.: A survey of trust in computer science and the semantic web. Web Semantics: Science, Services and Agents on the World Wide Web 5(2), 58–71 (2007)
Briggs, P.: The evolution of trust. In: Wakeman, I., Gudes, E., Jensen, C.D., Crampton, J. (eds.) Trust Management V. IFIP AICT, vol. 358, pp. 13–16. Springer, Heidelberg (2011)
Nepal, S., Sherchan, W., Paris, C.: Building trust communities using social trust. In: Ardissono, L., Kuflik, T. (eds.) UMAP Workshops 2011. LNCS, vol. 7138, pp. 243–255. Springer, Heidelberg (2012)
Salam, A., Iyer, L., Palvia, P., Singh, R.: Trust in e-commerce. Commun. ACM 48(2), 72–77 (2005)
Carchiolo, V., Longheu, A., Malgeri, M., Mangioni, G.: Users attachment in trust networks: Reputation vs. effort. Int. J. Bio-Inspired Comput. 5(4), 199–209 (2013)
Carchiolo, V., Longheu, A., Malgeri, M., Mangioni, G.: A heuristic to explore trust networks dynamics. In: Zavoral, F., Jung, J.J., Badica, C. (eds.) IDC 2013. SCI, vol. 511, pp. 67–76. Springer, Heidelberg (2013)
Golbeck, J.A.: Computing and applying trust in web-based social networks. PhD thesis, College Park, MD, USA (2005); Chair-Hendler, J.
Walter, F.E., Battiston, S., Schweitzer, F.: A model of a trust-based recommendation system on a social network. JAAMAS 16, 57 (2008)
Sepandar, D., Kamvar, M.T., Schlosser, H.G.M.: The eigentrust algorithm for reputation management in P2P networks. In: proceedings of the Twelfth International World Wide Web Conference 2003 (2003)
Albert, R., Barabasi, A.L.: Statistical mechanics of complex networks. Reviews of Modern Physics 74, 47 (2002)
Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509 (1999)
Lancichinetti, A., Fortunato, S.: Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys. Rev. E 80, 016118 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Carchiolo, V., Longheu, A., Malgeri, M., Mangioni, G. (2015). The Effect of Topology on the Attachment Process in Trust Networks. In: Camacho, D., Braubach, L., Venticinque, S., Badica, C. (eds) Intelligent Distributed Computing VIII. Studies in Computational Intelligence, vol 570. Springer, Cham. https://doi.org/10.1007/978-3-319-10422-5_39
Download citation
DOI: https://doi.org/10.1007/978-3-319-10422-5_39
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-10421-8
Online ISBN: 978-3-319-10422-5
eBook Packages: EngineeringEngineering (R0)