skip to main content
10.1145/3366424.3383301acmconferencesArticle/Chapter ViewAbstractPublication PagesthewebconfConference Proceedingsconference-collections
research-article

Dynamic Network Modeling from Motif-Activity

Published: 20 April 2020 Publication History

Abstract

Graph structure in dynamic networks changes rapidly. Using temporal information about their connections, models for dynamic networks can be developed and used to understand the process of how their structure changes over time. Additionally, higher-order motifs have been established as building blocks for the structure of networks. In this paper, we first demonstrate empirically in three dynamic network datasets, that motifs with edges: (1) do not transition from one motif type to another (e.g, wedges becoming triangles and vice-versa); (2) motifs re-appear in other time periods and the rate depends on their configuration. We propose the Dynamic Motif-Activity Model (DMA) for sampling synthetic dynamic graphs with parameters learned from an observed network. We evaluate our DMA model, with two dynamic graph generative model baselines, by measuring different graph structure metrics in the generated synthetic graphs and comparing with the graph used as input. Our results show that employing motifs captures the underlying graph structure and modeling their activity recreates the fast changes seen in dynamic networks.

References

[1]
Austin R. Benson, Rediet Abebe, Michael T. Schaub, Ali Jadbabaie, and Jon Kleinberg. 2018. Simplicial closure and higher-order link prediction. Proceedings of the National Academy of Sciences of the United States of America 115, 48 (2018), E11221–E11230. https://doi.org/10.1073/pnas.1800683115 arxiv:1802.06916
[2]
Fan Chung and Linyuan Lu. 2002. The average distances in random graphs with given expected degrees.Proceedings of the National Academy of Sciences of the United States of America 99, 25 (2002), 15879–15882. https://doi.org/10.1073/pnas.252631999
[3]
P Erdös and a Rényi. 1959. On random graphs. Publicationes Mathematicae 6 (1959), 290–297. https://doi.org/10.2307/1999405 arxiv:1205.2923
[4]
Petter Holme. 2013. Epidemiologically Optimal Static Networks from Temporal Network Data. PLoS Computational Biology 9, 7 (2013). https://doi.org/10.1371/journal.pcbi.1003142
[5]
Petter Holme. 2015. Modern temporal network theory: a colloquium. European Physical Journal B 88, 9 (2015). https://doi.org/10.1140/epjb/e2015-60657-4 arxiv:1508.01303
[6]
Yuriy Hulovatyy, Huili Chen, and T Milenković. 2015. Exploring the structure and function of temporal networks with dynamic graphlets. Bioinformatics 31, 12 (2015), i171–i180.
[7]
Brian Karrer and M. E. J. Newman. 2009. Random graph models for directed acyclic networks. Physical Review E (2009). https://doi.org/10.1103/PhysRevE.80.046110 arxiv:0907.4346
[8]
Bryan Klimt and Yiming Yang. 2004. The enron corpus: A new dataset for email classification research. In European Conference on Machine Learning. Springer, 217–226.
[9]
Jérôme Kunegis. 2013. KONECT - The koblenz network collection. Proceedings of the 22nd International Conference on World Wide Web (2013), 1343–1350.
[10]
Timothy La Fond, Dan Roberts, Jennifer Neville, James Tyler, and Stacey Connaughton. 2012. The impact of communication structure and interpersonal dependencies on distributed teams. (2012), 558–565.
[11]
Guillaume Laurent, Jari Saramäki, and Márton Karsai. 2015. From calls to communities: a model for time-varying social networks. European Physical Journal B 88, 11 (2015), 1–10. https://doi.org/10.1140/epjb/e2015-60481-x arxiv:1506.00393
[12]
Jure Leskovec, D Chakrabarti, J Kleinberg, C Faloutsos, and Zoubin Ghahramani. 2010. Kronecker graphs: An approach to modeling networks. Journal of Machine Learning Research 11 (2010), 985–1042. https://doi.org/10.1145/1756006.1756039 arxiv:0812.4905
[13]
Jure Leskovec, Jon Kleinberg, and Christos Faloutsos. 2007. Graph evolution: Densification and shrinking diameters. ACM Transactions on Knowledge Discovery from Data (TKDD) 1, 1(2007), 2.
[14]
Lun Li, David Alderson, John C Doyle, and Walter Willinger. 2006. Towards a Theory of Scale-Free Graphs : Definition, Properties, and Implications. 2 (2006), 431–523.
[15]
R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon. 2002. Network motifs: Simple building blocks of complex networks. Science 298, 5594 (2002), 824–827. https://doi.org/10.1126/science.298.5594.824
[16]
Antoine Moinet, Michele Starnini, and Romualdo Pastor-Satorras. 2015. Burstiness and Aging in Social Temporal Networks. Physical Review Letters 114, 10 (2015). https://doi.org/10.1103/PhysRevLett.114.108701 arxiv:1412.0587
[17]
Sebastian Moreno and Jennifer Neville. 2009. An Investigation of the Distributional Characteristics of Generative Graph Models. Win (2009).
[18]
Sebastian Moreno, Jennifer Neville, and Sergey Kirshner. 2018. Tied kronecker product graph models to capture variance in network populations. ACM Transactions on Knowledge Discovery from Data 12, 3 (2018). https://doi.org/10.1145/3161885
[19]
Krzysztof Nowicki and Tom a. B Snijders. 2001. Estimation and Prediction for Stochastic Blockstructures. J. Amer. Statist. Assoc. 96, 455 (2001), 1077–1087. https://doi.org/10.1198/016214501753208735
[20]
Ashwin Paranjape, Austin R Benson, and Jure Leskovec. 2017. Motifs in temporal networks. In Proceedings of the Tenth ACM International Conference on Web Search and Data Mining. ACM, 601–610.
[21]
N. Perra, B. Gonçalves, R. Pastor-Satorras, and A. Vespignani. 2012. Activity driven modeling of time varying networks. Scientific Reports 2(2012), 1–7. https://doi.org/10.1038/srep00469 arxiv:1203.5351
[22]
Julia Preusse, Jérôme Kunegis, Matthias Thimm, Steffen Staab, and Thomas Gottron. 2013. Structural Dynamics of Knowledge Networks.ICWSM 17(2013), 18.
[23]
Sumit Purohit, Lawrence B Holder, and George Chin. 2018. Temporal Graph Generation Based on a Distribution of Temporal Motifs. Proceedings of the 14th International Workshop on Mining and Learning with Graphs (2018), 7.
[24]
Luis E.C. Rocha and Vincent D. Blondel. 2013. Bursts of Vertex Activation and Epidemics in Evolving Networks. PLoS Computational Biology 9, 3 (2013). https://doi.org/10.1371/journal.pcbi.1002974
[25]
Albert Sunny, Bhushan Kotnis, and Joy Kuri. 2015. Dynamics of history-dependent epidemics in temporal networks. Physical Review E 92, 2 (2015), 022811.
[26]
Christian L. Vestergaard, Mathieu Génois, and Alain Barrat. 2014. How memory generates heterogeneous dynamics in temporal networks. Physical Review E - Statistical, Nonlinear, and Soft Matter Physics 90, 4(2014), 1–19. https://doi.org/10.1103/PhysRevE.90.042805 arxiv:1409.1805
[27]
Stanley Wasserman and Philippa Pattison. 1996. Logit models and logistic regressions for social networks: I. An introduction to markov graphs and p. Psychometrika 61, 3 (1996), 401–425. https://doi.org/10.1007/BF02294547
[28]
Ömer Nebil Yaveroğlu, Noël Malod-Dognin, Darren Davis, Zoran Levnajic, Vuk Janjic, Rasa Karapandza, Aleksandar Stojmirovic, and Nataša Pržulj. 2014. Revealing the hidden Language of complex networks. Scientific Reports 4(2014), 1–9. https://doi.org/10.1038/srep04547
[29]
Xin Zhang, Shuai Shao, H Eugene Stanley, and Shlomo Havlin. 2014. Dynamic motifs in socio-economic networks. EPL (Europhysics Letters) 108, 5 (2014), 58001.
[30]
Qiankun Zhao, Yuan Tian, Qi He, Nuria Oliver, Ruoming Jin, and Wang Chien Lee. 2010. Communication motifs: A tool to characterize social communications. International Conference on Information and Knowledge Management, Proceedings (2010), 1645–1648. https://doi.org/10.1145/1871437.1871694

Cited By

View all
  • (2024)Heterogeneous Network Motif Coding, Counting, and ProfilingACM Transactions on Knowledge Discovery from Data10.1145/368746518:9(1-21)Online publication date: 30-Oct-2024
  • (2023)Complex systems and network science: a surveyJournal of Systems Engineering and Electronics10.23919/JSEE.2023.00008034:3(543-573)Online publication date: Jun-2023
  • (2022)Natural and Artificial Dynamics in Graphs: Concept, Progress, and FutureFrontiers in Big Data10.3389/fdata.2022.10626375Online publication date: 2-Dec-2022
  • Show More Cited By

Index Terms

  1. Dynamic Network Modeling from Motif-Activity
        Index terms have been assigned to the content through auto-classification.

        Recommendations

        Comments

        Information & Contributors

        Information

        Published In

        cover image ACM Conferences
        WWW '20: Companion Proceedings of the Web Conference 2020
        April 2020
        854 pages
        ISBN:9781450370240
        DOI:10.1145/3366424
        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Sponsors

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 20 April 2020

        Permissions

        Request permissions for this article.

        Check for updates

        Author Tags

        1. dynamic networks
        2. motif evolution
        3. motifs
        4. network evolution
        5. temporal graphs

        Qualifiers

        • Research-article
        • Research
        • Refereed limited

        Conference

        WWW '20
        Sponsor:
        WWW '20: The Web Conference 2020
        April 20 - 24, 2020
        Taipei, Taiwan

        Acceptance Rates

        Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • Downloads (Last 12 months)12
        • Downloads (Last 6 weeks)1
        Reflects downloads up to 02 Mar 2025

        Other Metrics

        Citations

        Cited By

        View all
        • (2024)Heterogeneous Network Motif Coding, Counting, and ProfilingACM Transactions on Knowledge Discovery from Data10.1145/368746518:9(1-21)Online publication date: 30-Oct-2024
        • (2023)Complex systems and network science: a surveyJournal of Systems Engineering and Electronics10.23919/JSEE.2023.00008034:3(543-573)Online publication date: Jun-2023
        • (2022)Natural and Artificial Dynamics in Graphs: Concept, Progress, and FutureFrontiers in Big Data10.3389/fdata.2022.10626375Online publication date: 2-Dec-2022
        • (2021)The GR2 Algorithm for Subgraph Isomorphism. A Study from Parallelism to Quantum Computing2021 International Conference on Software, Telecommunications and Computer Networks (SoftCOM)10.23919/SoftCOM52868.2021.9559130(1-6)Online publication date: 23-Sep-2021
        • (2021)The GR3 Algorithm for Parallel Quantum Searching of Subgraph Isomorphism2021 International Conference on Software, Telecommunications and Computer Networks (SoftCOM)10.23919/SoftCOM52868.2021.9559108(1-6)Online publication date: 23-Sep-2021

        View Options

        Login options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        HTML Format

        View this article in HTML Format.

        HTML Format

        Figures

        Tables

        Media

        Share

        Share

        Share this Publication link

        Share on social media