Skip to main content
Erschienen in: Knowledge and Information Systems 9/2021

26.07.2021 | Regular Paper

A generative model for time evolving networks

verfasst von: Muhammad Irfan Yousuf, Suhyun Kim

Erschienen in: Knowledge and Information Systems | Ausgabe 9/2021

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Time evolving networks have some properties in common with complex networks, while some characteristics are specific to their time evolving nature. A number of interesting properties have been observed in time-varying complex networks such as densification power-law, shrinking diameter, scale-free degree distribution, big clustering coefficient and the emergence of community structure. Existing generative models either fail to simulate all the properties or undermine the social interactions between the existing nodes over time. In this paper, we propose a generative model called socializing graph model (SGM) for those networks that evolve over time. It is an iterative procedure consisting of two steps. In the first step, we add one new node to the network at every timestamp and connect it to an existing node using a preferential attachment rule. In the second step, we add a number of edges between the existing nodes in order to reflect the emergence of social interactions between nodes over time and mimic the evolution of real networks. We present empirical results to show that SGM generates realistic prototypes of evolving networks.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

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!

Fußnoten
1
We calculate \(\Delta \) at time t and use this value to add \(\Delta \) number of edges so that the network has \(m_{t+1}\) edges at time \(t+1\).
 
2
While we used the recommended values for parameters of BA and FF models, there could be a possibility that tuning the parameters of these models could yield better results. We leave it for future exploration.
 
Literatur
1.
Zurück zum Zitat Adamic L, Buyukkokten O, Adar E (2003) A social network caught in the web. First Monday 8(6) Adamic L, Buyukkokten O, Adar E (2003) A social network caught in the web. First Monday 8(6)
2.
Zurück zum Zitat Ahn Y-Y, Han S, Kwak H, Moon S, Jeong H (2007) Analysis of topological characteristics of huge online social networking services. In: Proceedings of the 16th international conference on world wide web, WWW ’07, pp 835–844 Ahn Y-Y, Han S, Kwak H, Moon S, Jeong H (2007) Analysis of topological characteristics of huge online social networking services. In: Proceedings of the 16th international conference on world wide web, WWW ’07, pp 835–844
3.
Zurück zum Zitat Albert R, Jeong H, Barabási A-L (1999) Internet: diameter of the world-wide web. Nature 401(6749):130–131CrossRef Albert R, Jeong H, Barabási A-L (1999) Internet: diameter of the world-wide web. Nature 401(6749):130–131CrossRef
5.
Zurück zum Zitat Benson A, Kleinberg J (2019) Link prediction in networks with core-fringe data. In: The world wide web conference, pp 94–104 Benson A, Kleinberg J (2019) Link prediction in networks with core-fringe data. In: The world wide web conference, pp 94–104
6.
Zurück zum Zitat Bojchevski A, Shchur O, Zügner D, Günnemann S (2018) NetGAN: generating graphs via random walks. In: Proceedings of the 35th international conference on machine learning, vol 80, pp 610–619 Bojchevski A, Shchur O, Zügner D, Günnemann S (2018) NetGAN: generating graphs via random walks. In: Proceedings of the 35th international conference on machine learning, vol 80, pp 610–619
7.
Zurück zum Zitat Bonato A, Hadi N, Horn P, Pralat P, Wang C (2009) A dynamic model for on-line social networks. In: Proceedings of the 6th international workshop on algorithms and models for the web-graph, WAW ’09, pp 127–142 Bonato A, Hadi N, Horn P, Pralat P, Wang C (2009) A dynamic model for on-line social networks. In: Proceedings of the 6th international workshop on algorithms and models for the web-graph, WAW ’09, pp 127–142
8.
Zurück zum Zitat Broder A, Kumar R, Maghoul F, Raghavan P, Rajagopalan S, Stata R, Tomkins A, Wiener J (2000) Graph structure in the web. In: Proceedings of the 9th international world wide web conference on computer networks: the international journal of computer and telecommunications networking, pp 309–320 Broder A, Kumar R, Maghoul F, Raghavan P, Rajagopalan S, Stata R, Tomkins A, Wiener J (2000) Graph structure in the web. In: Proceedings of the 9th international world wide web conference on computer networks: the international journal of computer and telecommunications networking, pp 309–320
9.
Zurück zum Zitat Bu Z, Xia Z, Wang J, Zhang C (2013) A last updating evolution model for online social networks. Physica A: Stat Mech Appl 392:2240–2247CrossRef Bu Z, Xia Z, Wang J, Zhang C (2013) A last updating evolution model for online social networks. Physica A: Stat Mech Appl 392:2240–2247CrossRef
10.
11.
Zurück zum Zitat Deijfen M, van den Esker H, van der Hofstad R, Hooghiemstra G (2009) A preferential attachment model with random initial degrees. Arkiv för Matematik 47:41–72MathSciNetCrossRef Deijfen M, van den Esker H, van der Hofstad R, Hooghiemstra G (2009) A preferential attachment model with random initial degrees. Arkiv för Matematik 47:41–72MathSciNetCrossRef
12.
Zurück zum Zitat Ferrara E (2012) A large-scale community structure analysis in Facebook. EPJ Data Sci 1:9CrossRef Ferrara E (2012) A large-scale community structure analysis in Facebook. EPJ Data Sci 1:9CrossRef
14.
Zurück zum Zitat Flaxman AD, Frieze AM, Vera J (2007) A geometric preferential attachment model of networks II. In: Algorithms and models for the web-graph, pp 41–55 Flaxman AD, Frieze AM, Vera J (2007) A geometric preferential attachment model of networks II. In: Algorithms and models for the web-graph, pp 41–55
15.
Zurück zum Zitat Giammatteo P, Donato D, Zlatić V, Caldarelli G (2010) A PageRank-based preferential attachment model for the evolution of the world wide web. EPL (Europhys Lett) 91(1):18004CrossRef Giammatteo P, Donato D, Zlatić V, Caldarelli G (2010) A PageRank-based preferential attachment model for the evolution of the world wide web. EPL (Europhys Lett) 91(1):18004CrossRef
16.
Zurück zum Zitat Golder SA, Wilkinson DM, Huberman BA (2007) Rhythms of social interaction: messaging within a massive online network, pp 41–66 Golder SA, Wilkinson DM, Huberman BA (2007) Rhythms of social interaction: messaging within a massive online network, pp 41–66
17.
Zurück zum Zitat Huang H, Tang J, Wu S, Liu L, Fu X (2014) Mining triadic closure patterns in social networks. In: Proceedings of the 23rd international conference on world wide web, WWW ’14 Companion, pp 499–504 Huang H, Tang J, Wu S, Liu L, Fu X (2014) Mining triadic closure patterns in social networks. In: Proceedings of the 23rd international conference on world wide web, WWW ’14 Companion, pp 499–504
18.
Zurück zum Zitat Kojaku S, Masuda N (2018) Core-periphery structure requires something else in the network. New J Phys 20:043012CrossRef Kojaku S, Masuda N (2018) Core-periphery structure requires something else in the network. New J Phys 20:043012CrossRef
19.
Zurück zum Zitat Kumar R, Novak J, Tomkins A (2006) Structure and evolution of online social networks. In: Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining, KDD ’06, pp 611–617 Kumar R, Novak J, Tomkins A (2006) Structure and evolution of online social networks. In: Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining, KDD ’06, pp 611–617
20.
Zurück zum Zitat Leskovec J, Chakrabarti D, Kleinberg J, Faloutsos C, Ghahramani Z (2010) Kronecker graphs: an approach to modeling networks. J Mach Learn Res 11:985–1042MathSciNetMATH Leskovec J, Chakrabarti D, Kleinberg J, Faloutsos C, Ghahramani Z (2010) Kronecker graphs: an approach to modeling networks. J Mach Learn Res 11:985–1042MathSciNetMATH
21.
Zurück zum Zitat Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the eleventh ACM SIGKDD international conference on knowledge discovery in data mining, KDD ’05, pp 177–187 Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the eleventh ACM SIGKDD international conference on knowledge discovery in data mining, KDD ’05, pp 177–187
22.
Zurück zum Zitat Melancon G (2006) Just how dense are dense graphs in the real world? A methodological note. In: Proceedings of the 2006 AVI workshop on beyond time and errors: novel evaluation methods for information visualization, BELIV ’06, pp 1–7 Melancon G (2006) Just how dense are dense graphs in the real world? A methodological note. In: Proceedings of the 2006 AVI workshop on beyond time and errors: novel evaluation methods for information visualization, BELIV ’06, pp 1–7
23.
Zurück zum Zitat Mislove A, Marcon M, Gummadi KP, Druschel P, Bhattacharjee B (2007) Measurement and analysis of online social networks. In: Proceedings of the 7th ACM SIGCOMM conference on internet measurement, IMC ’07, pp 29–42 Mislove A, Marcon M, Gummadi KP, Druschel P, Bhattacharjee B (2007) Measurement and analysis of online social networks. In: Proceedings of the 7th ACM SIGCOMM conference on internet measurement, IMC ’07, pp 29–42
24.
25.
Zurück zum Zitat Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577–8582CrossRef Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577–8582CrossRef
26.
Zurück zum Zitat Orman GK, Labatut V (2009) A comparison of community detection algorithms on artificial networks. Springer, Berlin, pp 242–256 Orman GK, Labatut V (2009) A comparison of community detection algorithms on artificial networks. Springer, Berlin, pp 242–256
27.
Zurück zum Zitat Purohit S, Holder L, Chin G (2018) Temporal graph generation based on a distribution of temporal motifs. In: International workshop on mining and learning with graphs Purohit S, Holder L, Chin G (2018) Temporal graph generation based on a distribution of temporal motifs. In: International workshop on mining and learning with graphs
28.
29.
Zurück zum Zitat Romero D, Kleinberg J (2010) The directed closure process in hybrid social-information networks, with an analysis of link formation on twitter. In: Proceedings on 4th international AAAI conference on weblogs and social media Romero D, Kleinberg J (2010) The directed closure process in hybrid social-information networks, with an analysis of link formation on twitter. In: Proceedings on 4th international AAAI conference on weblogs and social media
30.
Zurück zum Zitat Seshadhri C, Kolda TG, Pinar A (2012) Community structure and scale-free collections of Erdös Rényi graphs. Phys Rev E 85:056109CrossRef Seshadhri C, Kolda TG, Pinar A (2012) Community structure and scale-free collections of Erdös Rényi graphs. Phys Rev E 85:056109CrossRef
31.
Zurück zum Zitat Stephen PB, Martin GE (2000) Models of core/periphery structures. Soc Netw 21(4):375–395CrossRef Stephen PB, Martin GE (2000) Models of core/periphery structures. Soc Netw 21(4):375–395CrossRef
32.
Zurück zum Zitat Tamara GK, Ali P, Todd PCS (2014) A scalable generative graph model with community structure. SIAM J Sci Comput 36(5):C424–C452MathSciNetCrossRef Tamara GK, Ali P, Todd PCS (2014) A scalable generative graph model with community structure. SIAM J Sci Comput 36(5):C424–C452MathSciNetCrossRef
33.
Zurück zum Zitat Tibély G, Kovanen L, Karsai M, Kaski K, Kertész J, Saramäki J (2011) Communities and beyond: mesoscopic analysis of a large social network with complementary methods. Phys Rev E 83:056125CrossRef Tibély G, Kovanen L, Karsai M, Kaski K, Kertész J, Saramäki J (2011) Communities and beyond: mesoscopic analysis of a large social network with complementary methods. Phys Rev E 83:056125CrossRef
34.
Zurück zum Zitat Watts DJ, Strogatz SH (1998) Collective dynamics of “small-world” networks. Nature 393(6684):440–442CrossRef Watts DJ, Strogatz SH (1998) Collective dynamics of “small-world” networks. Nature 393(6684):440–442CrossRef
35.
Zurück zum Zitat Zhou D, Zheng L, Han J, He J (2020) A data-driven graph generative model for temporal interaction networks. In: Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery and data mining, pp 401–411 Zhou D, Zheng L, Han J, He J (2020) A data-driven graph generative model for temporal interaction networks. In: Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery and data mining, pp 401–411
36.
Zurück zum Zitat Zhou D, Zheng L, Xu J, He J (2019) Misc-GAN: a multi-scale generative model for graphs. Front Big Data 2:3CrossRef Zhou D, Zheng L, Xu J, He J (2019) Misc-GAN: a multi-scale generative model for graphs. Front Big Data 2:3CrossRef
Metadaten
Titel
A generative model for time evolving networks
verfasst von
Muhammad Irfan Yousuf
Suhyun Kim
Publikationsdatum
26.07.2021
Verlag
Springer London
Erschienen in
Knowledge and Information Systems / Ausgabe 9/2021
Print ISSN: 0219-1377
Elektronische ISSN: 0219-3116
DOI
https://doi.org/10.1007/s10115-021-01596-y

Weitere Artikel der Ausgabe 9/2021

Knowledge and Information Systems 9/2021 Zur Ausgabe