Skip to main content

Analyzing Trust-Based Mixing Patterns in Signed Networks

  • Conference paper
Digital Libraries: Social Media and Community Networks (ICADL 2013)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8279))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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

  2. Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439) (1999)

    Google Scholar 

  3. Garlaschelli, D., Loffredo, M.I.: Patterns of link reciprocity in directed networks. Physical Review Letters 93(26), 268701 (2004)

    Article  Google Scholar 

  4. Hanneman, R.A., Riddle, M.: Introduction to social network methods (2005)

    Google Scholar 

  5. 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)

    Google Scholar 

  6. Kleinberg, J.: Authoritative sources in a hyperlinked environment. Journal of the ACM (JACM) 46(5), 604–632 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  7. 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)

    Google Scholar 

  8. McPherson, M., Smith-Lovin, L., Cook, J.M.: Birds of a feather: Homophily in social networks. Annual Review of Sociology 27 (2001)

    Google Scholar 

  9. 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)

    Google Scholar 

  10. Newman, M.E.J.: Assortative mixing in networks. Physical Review Letters 89(20) (2002)

    Google Scholar 

  11. Newman, M.E.J.: Mixing patterns in networks. Physical Review E 67(2) (2003)

    Google Scholar 

  12. Newman, M.E.J., Girvan, M.: Mixing patterns and community structure in networks. Statistical Mechanics of Complex Networks (2003)

    Google Scholar 

  13. Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web (1999)

    Google Scholar 

  14. Rogers, E.M.: Diffusion of innovations. Free Press (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics