Abstract
Network analysis starts with the available data on relationships between entities of the complex system to observe. In this chapter, the main modeling decisions to turn a raw data set into a complex network are discussed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Of course, Plato would not have referred to the “real” complex system but to the ideal complex network, where the word ideal refers to the pure concept of the thing of interest.
- 2.
Another very important aspect of this is that it is in general difficult to give information about entities without disclosing their identity. This has hindered many publications of interesting data sets.
- 3.
Whatever your favorite definition of “social network” is at the moment.
- 4.
An API is an Application Programming Interface, a set of functions which allows programmers to get access to information.
- 5.
There is hope, however. Kergl et al. made a clever analysis of the timestamps of Twitter messages from the sample and they convincingly show that it is very likely the case that Twitter sends out a uniform 10 \(\%\) sample [17].
- 6.
The statistical significance of co-occurrence is discussed in more detail in Sect. 13.5.
- 7.
A partition divides a set S into subsets such that each element of S is in exactly one of the subsets, s. Sect. 3.3.2.
- 8.
In general, the Jaccard-coefficient of two sets S and T is defined as the number of common elements divided by the number of elements that occur in at least one of the two sets. This is written as: \(Jacc(S,T)=\frac{|S\cap T|}{|S\cup T}\).
- 9.
The projection onto the right-hand side nodes is analogous, based on a similarity function \(\sigma : R\times R \rightarrow \mathbb R\).
- 10.
Kahnemann and Vernon L. Smith were awarded the Noble prize in 2002 for their work with Tversky, who was already deceased at that time point. Noble prizes are not awarded post-mortem.
- 11.
The notation \(\left( {\begin{array}{c}k\\ 2\end{array}}\right) \) denotes the number of different subsets of size 2 out of k different objects.
- 12.
There are way more of these than a non-biologists might think! It is a classic instance of an “entity resolution” problem.
References
Abe F et al (1995) Observation of top quark production in \(\overline{p}p\) collisions with the collider detector at fermilab. Phys Rev Lett 74(14):2626–2631
Ahn YY, Ahnert SE, Bagrow JP, Barabási A-L (2011) Flavor network and the principles of food pairing. Sci Rep 1:196
Alhajj R, Rokne J (eds) (2014) Encyclopedia of social network analysis and mining. Springer, Heidelberg
Arita M (2004) The metabolic world of escherichia coli is not small. Proc the Natl Acad Sci 101(6):1543–1547
Barabási A-L, Jeong H, Ravasz E, Schubert A, Vicsek T (2002) Evolution of the social network of scientific collaborations. Phys A 311:590–614
Bonnefoy PA, John Hansman R (2007) Scalability and efficiency dynamics of air transportation networks in the United States. Technical report, Massachusetts Institute of Technology, Cambridge, MA, USA
Borgatti SP, Halgin D (2011) The SAGE handbook of social network analysis. Analyzing affiliation networks. Sage Publications, London, pp 417–433
Borgatti SP, Mehra A, Brass DJ, Labianca G (2009) Network analysis in the social sciences. Science 323:892–895
Brewer DD, Webster CM (1999) Forgetting of friends and its effects on measuring friendship networks. Soc Netw 21:361–373
Butts CT (2009) Revisiting the foundations of network analysis. Science 325(5939):414–416
Butts CT (2010) A note on generalized edges. http://www.imbs.uci.edu/files/docs/technical/2010/mbs_10-03.pdf
Dorn I, Lindenblatt A, Zweig KA (2012) The trilemma of network analysis. In: Proceedings of the 2012 IEEE/ACM international conference on advances in social network analysis and mining, Istanbul
Easley D, Kleinberg J (2010) Networks, crowds, and markets: reasoning about a highly connected world. Cambridge University Press
Geng L, Hamilton HJ (2006) Interestingness measures for data mining: a survey. ACM Comput Surv 38(3):9
Horvát E-Á, Zhang JD, Uhlmann S, Sahin Ö, Zweig KA (2013) A network-based method to assess the statistical significance of mild co-regulation effects. PLOS ONE 8(9):e73413
Jeong H, Tombor B, Albert R, Oltvai ZN, Barabãsi A-L (2000) The large-scale organization of metabolic networks. Nature 400:107
Kergl D, Roedler R, Seeber S, Dreo Rodosek G (2014) On the endogenesis of twitter’s spritzer and gardenhose sample streams. In: Proceedings of the 2014 IEEE/ACM international conference on advances in social network analysis and mining (ASONAM’14), pp 357–364
Latapy M, Magnien C, Del Vecchio N (2008) Basic notions for the analysis of large two-mode networks. Soc Netw 30(1):31–48
Laumann EO, Marsden PV, Prensky D (1992) Research methods in social network analysis. The boundary specification problem in network analysis. Transaction Publishers, New Brunswick, New Jersey, pp 61–88 (reprint)
Lazer D, Pentland A, Adamic L, Aral S, Barabási A-L, Brewer D, Christakis NA, Contractor N, Fowler J, Gutmann M, Jebara T, King G, Macy M, Roy D, Van Alstyne M (2009) Computational social science. Science 323:721–723
Leskovec J. http://snap.stanford.edu/data/
Leskovec J, Huttenlocher D, Kleinberg J (2010) Predicting positive and negative links in online social networks. In: Proceedings of the 19th international conference on world wide web (WWW’10)
Li M, Fan Y, Chen J, Gao L, Di Z, Jinshan W (2005) Weighted networks of scientific communication: the measurement and topological role of weight. Phys A 350:643–656
Newman MEJ (2001) Scientific collaboration networks. i. network construction and fundamental results. Phys Rev E 64:016131
Newman MEJ (2001) Scientific collaboration networks. ii. shortest paths, weighted networks, and centrality. Phys Rev E 64:016132
Newman MEJ (2004) Analysis of weighted networks. Phys Rev E 70(5):056131
Prell C (2011) Social network analysis. SAGE Publications Ltd., London
www.harzing.com/pop.htm. “Publish or Perish” by Anne-Wil Harzing
Ravasz E, Somera AL, Mongru DA, Oltvai ZN, Barabási A-L (2002) Hierarchical organization of modularity in metabolic networks. Science 297:1551–1553
Teng C-Y, Lin Y-R, Adamic LA (2012) Recipe recommendation using ingredient networks. In Proceedings of the 3rd annual ACM web science conference (WebSci’12). ACM, New York, pp 298–307
Wasserman S, Faust K (1999) Social network analysis–methods and applications, revised, reprinted edn. Cambridge University Press, Cambridge
Watts DJ, Strogatz SH (1998) Collective dynamics of ‘small-world’ networks. Nature 393:440–442
Zweig KA (2014) Encyclopedia of social network analysis and mining. Network representations of complex data, Springer, Heidelberg
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer-Verlag GmbH Austria
About this chapter
Cite this chapter
Zweig, K.A. (2016). Network Representations of Complex Systems. In: Network Analysis Literacy. Lecture Notes in Social Networks. Springer, Vienna. https://doi.org/10.1007/978-3-7091-0741-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-7091-0741-6_5
Published:
Publisher Name: Springer, Vienna
Print ISBN: 978-3-7091-0740-9
Online ISBN: 978-3-7091-0741-6
eBook Packages: Computer ScienceComputer Science (R0)