A Tale of Two Communities: Assessing Homophily in Node-Link Diagrams

  • Wouter MeulemansEmail author
  • André SchulzEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9411)


Homophily is a concept in social network analysis that states that in a network a link is more probable, if the two individuals have a common characteristic. We study the question if an observer can assess homophily by looking at the node-link diagram of the network. We design an experiment that investigates three different layout algorithms and asks the users to estimate the degree of homophily in the displayed network. One of the layout algorithms is a classical force-directed method, the other two are designed to improve node distinction based on the common characteristic. We study how each of the three layout algorithms helps to get a fair estimate, and whether there is a tendency to over or underestimate the degree of homophily. The stimuli in our experiments use different network sizes and different proportions of the cluster sizes.


User Study Bias Assessment Network Visualization Layout Algorithm Cluster Separation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.



The authors would like to thank all anonymous volunteers who participated in the presented user study.


  1. 1.
    Baur, M., Brandes, U.: Crossing reduction in circular layouts. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 332–343. Springer, Heidelberg (2004) CrossRefGoogle Scholar
  2. 2.
    Eades, P., Feng, Q., Lin, X., Nagamochi, H.: Straight-line drawing algorithms for hierarchical graphs and clustered graphs. Algorithmica 44, 1–32 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Easley, D., Kleinberg, J.: Networks, Crowds and Markets: Reasoning About a Highly Connected World. Cambridge University Press, New York (2010)CrossRefGoogle Scholar
  4. 4.
    Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pract. Exp. 21(11), 1129–1164 (1991)CrossRefGoogle Scholar
  5. 5.
    Ghani, S., Kwon, B.C., Lee, S., Yi, J.S., Elmqvist, N.: Visual analytics for multimodal social network analysis: a design study with social scientists. IEEE TVCG 19(12), 2032–2041 (2013)Google Scholar
  6. 6.
    Henry, N., Fekete, J.-D., McGuffin, M.J.: Node trix: a hybrid visualization of social networks. IEEE TVCG 13(6), 1302–1309 (2007)Google Scholar
  7. 7.
    Holten, D.: Hierarchical edge bundles: visualization of adjacency relations in hierarchical data. IEEE TVCG 12(5), 741–748 (2006)Google Scholar
  8. 8.
    Jusufi, I., Kerren, A., Liu, J., Zimmer, B.: Visual exploration of relationships between document clusters. In: Proceedings of International Conference on Information Visualization Theory and Applications, pp. 195–203 (2014)Google Scholar
  9. 9.
    Krzywinski, M., Birol, I., Jones, S.J.M., Marra, M.A.: Hive plots–rational approach to visualizing networks. Briefings Bioinf. 13, 627–644 (2011)CrossRefGoogle Scholar
  10. 10.
    McPherson, M., Smith-Lovin, L., Cook, J.M.: Birds of feather: homophily in social networks. Ann. Rev. Sociol. 27, 415–444 (2001)CrossRefGoogle Scholar
  11. 11.
    Purchase, H.C.: Experimental Human-Computer Interaction: A Practical Guide with Visual Examples. Cambridge University Press, New York (2012)CrossRefGoogle Scholar
  12. 12.
    van den Elzen, S., van Wijk, J.J.: Multivariate network exploration and presentation: from detail to overview via selections and aggregations. IEEE TVCG 20(12), 2310–2319 (2014)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.giCentreCity University LondonLondonUK
  2. 2.LG Theoretische InformatikFernUniversität in HagenHagenGermany

Personalised recommendations