Skip to main content
SpringerLink
Log in

Network Representations of Complex Data

  • Living reference work entry
  • First Online:
Encyclopedia of Social Network Analysis and Mining

  • 114 Accesses

Synonyms

Graph representation

Glossary

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

Edge:

Representation of a relationship between two entities

Edge weight:

Numerical value associated with an edge

Graph:

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

Node:

Representation of an entity

Roster:

A list of possible interaction partners from which...

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  • Bolland JM (1988) Sorting out centrality: an analysis of the performance of four centrality models in real and simulated networks. Soc Networks 10:233–253

    Article  MathSciNet  Google Scholar 

  • Borgatti SP (2005) Centrality and network flow. Soc Networks 27:55–71

    Article  Google Scholar 

  • Borgatti SP, Everett MG (1992) Notions of position in social network analysis. Sociol Methodol 22:1–35

    Article  Google Scholar 

  • Borgatti SP, Mehra A, Brass DJ, Labianca G (2009) Network analysis in the social sciences. Science 323:892–895

    Article  Google Scholar 

  • Butts CT (2009) Revisiting the foundations of network analysis. Science 325:414–416

    Article  MathSciNet  MATH  Google Scholar 

  • Costenbader E, Valente TW (2003) The stability of centrality measures when networks are sampled. Soc Networks 25:283–307

    Article  Google Scholar 

  • 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–1725

    Article  Google Scholar 

  • Doreian P, Woodard KL (1992) Fixed list versus snowball selection of social networks. Soc Sci Res 21:216–233

    Article  Google Scholar 

  • 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, Istanbul

    Google Scholar 

  • Freeman LC (1979) Centrality in networks: I. Conceptual clarification. Soc Networks 1:215–239

    Article  Google Scholar 

  • Freeman LC (2004) The development of social network analysis – a study in the sociology of science. Empirical Press, Vancouver

    Google Scholar 

  • 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 Diego

    Google Scholar 

  • Grannis R (2010) Six degrees of ‘who cares?’. Am J Sociol 115:991–1017

    Article  Google Scholar 

  • 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–844

    Article  Google Scholar 

  • Hennig M, Brandes U, Pfeffer J, Mergel I (2012) Studying social networks – a guide to empirical research. Campus Verlag, Frankfurt

    Google Scholar 

  • Holme P (2003) Congestion and centrality in traffic flow on complex networks. Adv Complex Syst 6:163

    Article  MATH  Google Scholar 

  • 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–110

    Chapter  Google Scholar 

  • McPherson M, Smith-Lovin L, Cook JM (2001) Birds of a feather: homophily in social networks. Annu Rev Sociol 27:415–444

    Article  Google Scholar 

  • Newman ME (2010) Networks: an introduction. Oxford University Press, New York

    Book  MATH  Google Scholar 

  • 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–7336

    Article  Google Scholar 

  • 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–818

    Article  Google Scholar 

  • Prell C (2011) Social network analysis. Sage, London

    Google Scholar 

  • Stumpf MP, Wiu C (2005) Sampling properties of random graphs: the degree distribution. Phys Rev E 72:036118

    Article  MathSciNet  Google Scholar 

  • 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–4224

    Article  Google Scholar 

  • Wasserman S, Faust K (1994) Social network analysis: methods and applications. Cambridge University Press, Cambridge

    Book  MATH  Google Scholar 

  • Zweig KA (2011) Good versus optimal: why network analytic methods need more systematic evaluation. Cent Eur J Comput Sci 1:137–153

    Google Scholar 

  • Zweig KA, Kaufmann M (2011) A systematic approach to the one-mode projection of bipartite graphs. Soc Netw Anal Min 1:187–218

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Complex Network Analysis and Graph Theory, University of Kaiserslautern, Kaiserslautern, Germany

    Katharina Anna Zweig

Authors
  1. Katharina Anna Zweig
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Katharina Anna Zweig .

Editor information

Editors and Affiliations

  1. Computer Science, University of Calgary, Calgary, Alberta, Canada

    Reda Alhajj

  2. University of Calgary Computer Science, Calgary, Canada

    Jon Rokne

Section Editor information

  1. RWTH Aachen, Aachen, Germany

    Ralf Klamma

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Science+Business Media LLC

About this entry

Cite this entry

Zweig, K.A. (2017). Network Representations of Complex Data. In: Alhajj, R., Rokne, J. (eds) Encyclopedia of Social Network Analysis and Mining. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-7163-9_12-1

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-7163-9_12-1

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-7163-9

  • Online ISBN: 978-1-4614-7163-9

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation