Encyclopedia of Social Network Analysis and Mining

Living Edition
| Editors: Reda Alhajj, Jon Rokne

Network Representations of Complex Data

  • Katharina Anna Zweig
Living reference work entry
DOI: https://doi.org/10.1007/978-1-4614-7163-9_12-1



Betweenness centrality

A centrality measure for nodes which sums up the fractions of shortest paths between all pairs of nodes which contain a given node

Centrality measure

A function which maps from the set of nodes to the set of real numbers; used to identify central nodes in a graph

Directed graph

Represents a directed relationship between entities

Dynamic graph

Graph with time stamps on nodes and/or edges


Representation of a relationship between two entities

Edge weight

Numerical value associated with an edge


Combination of a set of nodes and a set of edges

Multipartite graphs

If the set of entities can be partitioned into at least two subsets such that there is no relationship between entities in the same subset, the graph is said to be multipartite

Network generator

Question whose answer elucidates relationships of the interviewee


Representation of an entity


A list of possible interaction partners from which an...

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


  1. Bolland JM (1988) Sorting out centrality: an analysis of the performance of four centrality models in real and simulated networks. Soc Networks 10:233–253MathSciNetCrossRefGoogle Scholar
  2. Borgatti SP (2005) Centrality and network flow. Soc Networks 27:55–71CrossRefGoogle Scholar
  3. Borgatti SP, Everett MG (1992) Notions of position in social network analysis. Sociol Methodol 22:1–35CrossRefGoogle Scholar
  4. Borgatti SP, Mehra A, Brass DJ, Labianca G (2009) Network analysis in the social sciences. Science 323:892–895CrossRefGoogle Scholar
  5. Butts CT (2009) Revisiting the foundations of network analysis. Science 325:414–416MathSciNetCrossRefMATHGoogle Scholar
  6. Costenbader E, Valente TW (2003) The stability of centrality measures when networks are sampled. Soc Networks 25:283–307CrossRefGoogle Scholar
  7. Coulomb S, Bauer M, Bernard D, Marsolier-Kergoat MC (2005) Gene essentiality and the topology of protein interaction networks. Proc R Soc Lond B 272:1721–1725CrossRefGoogle Scholar
  8. Doreian P, Woodard KL (1992) Fixed list versus snowball selection of social networks. Soc Sci Res 21:216–233CrossRefGoogle Scholar
  9. Dorn I, Lindenblatt A, Zweig KA (2012) The trilemma of social network analysis. In: Proceedings of the 2012 IEEE/ACM international conference on advances in social network analysis and mining, IstanbulGoogle Scholar
  10. Freeman LC (1979) Centrality in networks: I. Conceptual clarification. Soc Networks 1:215–239CrossRefGoogle Scholar
  11. Freeman LC (2004) The development of social network analysis – a study in the sociology of science. Empirical Press, VancouverGoogle Scholar
  12. Gjoka M, Kurant M, Butts CT, Markopoulou A (2010) Walking in Facebook: a case study of unbiased sampling of OSNs. In: Proceedings of the 29th IEEE international conference on computer communications, San DiegoGoogle Scholar
  13. Grannis R (2010) Six degrees of ‘who cares?’. Am J Sociol 115:991–1017CrossRefGoogle Scholar
  14. Han J-DJ, Dupuy D, Bertin N, Cusick ME, Vidal M (2005) Effect of sampling on topology predictions of proteinprotein interaction networks. Nat Biotechnol 23:839–844CrossRefGoogle Scholar
  15. Hennig M, Brandes U, Pfeffer J, Mergel I (2012) Studying social networks – a guide to empirical research. Campus Verlag, FrankfurtGoogle Scholar
  16. Holme P (2003) Congestion and centrality in traffic flow on complex networks. Adv Complex Syst 6:163CrossRefMATHGoogle Scholar
  17. Koschützki D, Lehmann KA, Tenfelde-Podehl D, Zlotowski O (2005) Advanced centrality concepts. In: Brandes U, Erlebach T (eds) Network analysis – methodological foundations, LNCS, vol 3418. Springer, Berlin/Heidelberg, pp 83–110CrossRefGoogle Scholar
  18. McPherson M, Smith-Lovin L, Cook JM (2001) Birds of a feather: homophily in social networks. Annu Rev Sociol 27:415–444CrossRefGoogle Scholar
  19. Newman ME (2010) Networks: an introduction. Oxford University Press, New YorkCrossRefMATHGoogle Scholar
  20. Onnela J-P, Saramäki J, Hvönen J, Szabó G, Lazer D, Kaski K, Kertész J, Barabási A-L (2007) Structure and tie strengths in mobile communication networks. Proc Natl Acad Sci 104(18):7332–7336CrossRefGoogle Scholar
  21. Palla G, Derényi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435:814–818CrossRefGoogle Scholar
  22. Prell C (2011) Social network analysis. Sage, LondonGoogle Scholar
  23. Stumpf MP, Wiu C (2005) Sampling properties of random graphs: the degree distribution. Phys Rev E 72:036118MathSciNetCrossRefGoogle Scholar
  24. Stumpf MHP, Wiuf C, May RM (2005) Subnets of scalefree networks are not scale-free: sampling properties of networks. Proc Natl Acad Sci 102:4221–4224CrossRefGoogle Scholar
  25. Wasserman S, Faust K (1994) Social network analysis: methods and applications. Cambridge University Press, CambridgeCrossRefMATHGoogle Scholar
  26. Zweig KA (2011) Good versus optimal: why network analytic methods need more systematic evaluation. Cent Eur J Comput Sci 1:137–153Google Scholar
  27. Zweig KA, Kaufmann M (2011) A systematic approach to the one-mode projection of bipartite graphs. Soc Netw Anal Min 1:187–218CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media LLC 2017

Authors and Affiliations

  1. 1.Department of Computer Science, Complex Network Analysis and Graph TheoryUniversity of KaiserslauternKaiserslauternGermany