Skip to main content
Top
Published in:

01-12-2016 | Original Article

An algebraic approach to temporal network analysis based on temporal quantities

Authors: Vladimir Batagelj, Selena Praprotnik

Published in: Social Network Analysis and Mining | Issue 1/2016

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

In a temporal network, the presence and activity of nodes and links can change through time. To describe temporal networks we introduce the notion of temporal quantities. We define the addition and multiplication of temporal quantities in a way that can be used for the definition of addition and multiplication of temporal networks. The corresponding algebraic structures are semirings. The usual approach to (data) analysis of temporal networks is to transform the network into a sequence of time slices—static networks corresponding to selected time intervals and analyze each of them using standard methods to produce a sequence of results. The approach proposed in this paper enables us to compute these results directly. We developed fast algorithms for the proposed operations. They are available as an open source Python library TQ (Temporal Quantities) and a program Ianus. The proposed approach enables us to treat as temporal quantities also other network characteristics such as degrees, connectivity components, centrality measures, Pathfinder skeleton, etc. To illustrate the developed tools we present some results from the analysis of Franzosi’s violence network and Corman’s Reuters terror news network.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Appendix
Available only for authorised users
Literature
go back to reference Batagelj V (2009) Social network analysis, large-scale. Meyers RA (ed) Encyclopedia of complexity and systems science, Springer, 8245–8265 Batagelj V (2009) Social network analysis, large-scale. Meyers RA (ed) Encyclopedia of complexity and systems science, Springer, 8245–8265
go back to reference Batagelj V, Cerinšek M (2013) On bibliographic networks. Scientometrics 96(3):845–864CrossRef Batagelj V, Cerinšek M (2013) On bibliographic networks. Scientometrics 96(3):845–864CrossRef
go back to reference Bhadra S, Ferreira A (2003) Complexity of connected components in evolving graphs and the computation of multicast trees in dynamic networks. In ADHOC-NOW, LNCS 2865, Springer, 259–270 Bhadra S, Ferreira A (2003) Complexity of connected components in evolving graphs and the computation of multicast trees in dynamic networks. In ADHOC-NOW, LNCS 2865, Springer, 259–270
go back to reference Cantos-Mateos G, Zulueta MÁ, Vargas-Quesada B, Chinchilla-Rodríguez Z (2014) Estudio evolutivo de la investigación española con células madre. Visualización e identificación de las principales líneas de investigación. El Profesional de la Información, 23(3), 259–271 Cantos-Mateos G, Zulueta MÁ, Vargas-Quesada B, Chinchilla-Rodríguez Z (2014) Estudio evolutivo de la investigación española con células madre. Visualización e identificación de las principales líneas de investigación. El Profesional de la Información, 23(3), 259–271
go back to reference Casteigts A, Flocchini P, Quattrociocchi W, Santoro N (2012) Time-varying graphs and dynamic networks. Int J Parallel Emergent Distribut Syst 27(5):387–408CrossRef Casteigts A, Flocchini P, Quattrociocchi W, Santoro N (2012) Time-varying graphs and dynamic networks. Int J Parallel Emergent Distribut Syst 27(5):387–408CrossRef
go back to reference Corman SR, Kuhn T, McPhee RD, Dooley KJ (2002) Studying complex discursive systems: centering resonance analysis of communication. Human Commun Res 28(2):157–206 Corman SR, Kuhn T, McPhee RD, Dooley KJ (2002) Studying complex discursive systems: centering resonance analysis of communication. Human Commun Res 28(2):157–206
go back to reference de Nooy W, Mrvar A, Batagelj V (2012) Exploratory social network analysis with Pajek (structural analysis in the social sciences), revised and expanded, 2nd edn. Cambridge University Press, Cambridge de Nooy W, Mrvar A, Batagelj V (2012) Exploratory social network analysis with Pajek (structural analysis in the social sciences), revised and expanded, 2nd edn. Cambridge University Press, Cambridge
go back to reference Feenstra RC, Lipsey RE, Deng H, Ma AC, Mo H (2005). World Trade Flows: 1962–2000. NBER Working Paper No. 11040 Feenstra RC, Lipsey RE, Deng H, Ma AC, Mo H (2005). World Trade Flows: 1962–2000. NBER Working Paper No. 11040
go back to reference Fletcher JG (1980) A more general algorithm for computing closed semiring costs between vertices of a directed graph. CACM 23:350–351CrossRef Fletcher JG (1980) A more general algorithm for computing closed semiring costs between vertices of a directed graph. CACM 23:350–351CrossRef
go back to reference Franzosi R (1997) Mobilization and Counter-Mobilization Processes: From the “Red Years” (1919–20) to the “Black Years” (1921–22) in Italy. A New Methodological Approach to the Study of Narrative Data. Theor Soc 26(2–3):275–304CrossRef Franzosi R (1997) Mobilization and Counter-Mobilization Processes: From the “Red Years” (1919–20) to the “Black Years” (1921–22) in Italy. A New Methodological Approach to the Study of Narrative Data. Theor Soc 26(2–3):275–304CrossRef
go back to reference Freeman LC (1978) Centrality in social networks; conceptual clarification. Social Networks 1:215–239CrossRef Freeman LC (1978) Centrality in social networks; conceptual clarification. Social Networks 1:215–239CrossRef
go back to reference George B, Kim S, Shekhar S (2007) Spatio-temporal network databases and routing algorithms: a summary of results. In: Papadias D, Zhang D, Kollios G (eds) SSTD 2007, LNCS 4605. Springer-Verlag, Berlin, Heidelberg, pp 460–477 George B, Kim S, Shekhar S (2007) Spatio-temporal network databases and routing algorithms: a summary of results. In: Papadias D, Zhang D, Kollios G (eds) SSTD 2007, LNCS 4605. Springer-Verlag, Berlin, Heidelberg, pp 460–477
go back to reference Gondran M, Minoux M (2008) Graphs, dioids and semirings: new models and algorithms. Springer, HiedelbergMATH Gondran M, Minoux M (2008) Graphs, dioids and semirings: new models and algorithms. Springer, HiedelbergMATH
go back to reference Guerrero-Bote VP, Zapico-Alonso F, Espinosa-Calvo ME, Crisóstomo RG, de Moya-Anegón F (2006) Binary pathfinder: an improvement to the pathfinder algorithm. Info Proc Manag 42(6):1484–1490CrossRef Guerrero-Bote VP, Zapico-Alonso F, Espinosa-Calvo ME, Crisóstomo RG, de Moya-Anegón F (2006) Binary pathfinder: an improvement to the pathfinder algorithm. Info Proc Manag 42(6):1484–1490CrossRef
go back to reference Gulyás L, Kampis G, Legendi RO (2013) Elementary models of dynamic networks. Eur Phys J Special Topics 222:1311–1333CrossRef Gulyás L, Kampis G, Legendi RO (2013) Elementary models of dynamic networks. Eur Phys J Special Topics 222:1311–1333CrossRef
go back to reference Holme P (2015) Modern temporal network theory: a colloquium. Eur Phys J B 88:234CrossRef Holme P (2015) Modern temporal network theory: a colloquium. Eur Phys J B 88:234CrossRef
go back to reference Holme P, Saramäki J (eds) (2013) Temporal Networks. Understanding Complex Systems. Springer, Hiedelberg Holme P, Saramäki J (eds) (2013) Temporal Networks. Understanding Complex Systems. Springer, Hiedelberg
go back to reference Kim H, Yoon JW, Crowcroft J (2012) Network analysis of temporal trends in scholarly research productivity. J Informetr 6:97–110CrossRef Kim H, Yoon JW, Crowcroft J (2012) Network analysis of temporal trends in scholarly research productivity. J Informetr 6:97–110CrossRef
go back to reference Moody J (2002) The importance of relationship timing for diffusion. Social Forces 81(1):25–56CrossRef Moody J (2002) The importance of relationship timing for diffusion. Social Forces 81(1):25–56CrossRef
go back to reference Moody J, McFarland D, Bender-deMoll S (2005) Dynamic network visualization. Am J Sociol 110(4):1206–1241CrossRef Moody J, McFarland D, Bender-deMoll S (2005) Dynamic network visualization. Am J Sociol 110(4):1206–1241CrossRef
go back to reference Praprotnik S, Batagelj V (2016) Spectral centrality measures in temporal networks. Ars Mathematica Contemporanea 11:11–33MathSciNetMATH Praprotnik S, Batagelj V (2016) Spectral centrality measures in temporal networks. Ars Mathematica Contemporanea 11:11–33MathSciNetMATH
go back to reference Praprotnik S, Batagelj V (2016) Semirings for temporal network analysis. http://arxiv.org/abs/1603.08261 Praprotnik S, Batagelj V (2016) Semirings for temporal network analysis. http://​arxiv.​org/​abs/​1603.​08261
go back to reference Riordan J (1958) Introduction to combinatorial analysis. Wiley, New YorkMATH Riordan J (1958) Introduction to combinatorial analysis. Wiley, New YorkMATH
go back to reference Schvaneveldt RW (ed) (1990) Pathfinder associative networks: studies in knowledge organization. Ablex, Norwood, NJMATH Schvaneveldt RW (ed) (1990) Pathfinder associative networks: studies in knowledge organization. Ablex, Norwood, NJMATH
go back to reference Xuan BB, Ferreira A, Jarry A (2003) Computing shortest, fastest, and foremost journeys in dynamic networks. Int J Foundations Comput Sci 14(2):267–285MathSciNetCrossRefMATH Xuan BB, Ferreira A, Jarry A (2003) Computing shortest, fastest, and foremost journeys in dynamic networks. Int J Foundations Comput Sci 14(2):267–285MathSciNetCrossRefMATH
Metadata
Title
An algebraic approach to temporal network analysis based on temporal quantities
Authors
Vladimir Batagelj
Selena Praprotnik
Publication date
01-12-2016
Publisher
Springer Vienna
Published in
Social Network Analysis and Mining / Issue 1/2016
Print ISSN: 1869-5450
Electronic ISSN: 1869-5469
DOI
https://doi.org/10.1007/s13278-016-0330-4

Premium Partner