Abstract
In some online social media such as Slashdot, actors are allowed to explicitly show their trust or distrust towards each other. Such a network, called a signed network, contains positive and negative edges. Traditional notions of assortativity and disassortativity are not sufficient to study the mixing patterns of connections between actors in a signed network, owing to the presence of negative edges. Towards this end, we propose two additional notions of mixing due to negative edges – anti-assortativity and anti-disassortativity – which pertain to the show of distrust towards “similar” nodes and “dissimilar” nodes respectively. We classify nodes based on a local measure of their trustworthiness, rather than based on in-degrees, in order to study mixing patterns. We also use some simple techniques to quantify a node’s bias towards assortativity, disassortativity, anti-assortativity and anti-disassortativity in a signed network. Our experiments with the Slashdot Zoo network suggest that: (i) “low-trust” nodes show varied forms of mixing – reasonable assortativity, high disassortativity, slight anti-assortativity and slight anti-disassortativity, and (ii) “high-trust” nodes mix highly assortatively while showing very little disassortativity, anti-assortativity or anti-disassortativity.
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
Adamic, L.A.: Zipf, power-laws, and pareto – a ranking tutorial. Xerox Palo Alto Research Center, Palo Alto, http://www.hpl.hp.com/research/idl/papers/ranking/ranking.html
Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439) (1999)
Garlaschelli, D., Loffredo, M.I.: Patterns of link reciprocity in directed networks. Physical Review Letters 93(26), 268701 (2004)
Hanneman, R.A., Riddle, M.: Introduction to social network methods (2005)
Hogg, T., Wilkinson, D., Szabo, G., Brzozowski, M.: Multiple relationship types in online communities and social networks. In: Proc. of the AAAI Symposium on Social Information Processing (2008)
Kleinberg, J.: Authoritative sources in a hyperlinked environment. Journal of the ACM (JACM) 46(5), 604–632 (1999)
Leskovec, J., Huttenlocher, D., Kleinberg, J.: Signed networks in social media. In: Proceedings of the 28th International Conference on Human Factors in Computing Systems. ACM (2010)
McPherson, M., Smith-Lovin, L., Cook, J.M.: Birds of a feather: Homophily in social networks. Annual Review of Sociology 27 (2001)
Mishra, A., Bhattacharya, A.: Finding the bias and prestige of nodes in networks based on trust scores. In: Proceedings of the 20th International Conference on World Wide Web. ACM (2011)
Newman, M.E.J.: Assortative mixing in networks. Physical Review Letters 89(20) (2002)
Newman, M.E.J.: Mixing patterns in networks. Physical Review E 67(2) (2003)
Newman, M.E.J., Girvan, M.: Mixing patterns and community structure in networks. Statistical Mechanics of Complex Networks (2003)
Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web (1999)
Rogers, E.M.: Diffusion of innovations. Free Press (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Rathore, A.S., Mutalikdesai, M.R., Patil, S. (2013). Analyzing Trust-Based Mixing Patterns in Signed Networks. In: Urs, S.R., Na, JC., Buchanan, G. (eds) Digital Libraries: Social Media and Community Networks. ICADL 2013. Lecture Notes in Computer Science, vol 8279. Springer, Cham. https://doi.org/10.1007/978-3-319-03599-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-03599-4_8
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03598-7
Online ISBN: 978-3-319-03599-4
eBook Packages: Computer ScienceComputer Science (R0)