Likelihood-based approach to discriminate mixtures of network models that vary in time

Abstract Discriminating between competing explanatory models as to which is more likely responsible for the growth of a network is a problem of fundamental importance for network science. The rules governing this growth are attributed to mechanisms such as preferential attachment and triangle closur...

Full description

Bibliographic Details
Main Authors: Naomi A. Arnold, Raul J. Mondragón, Richard G. Clegg
Format: Article
Language:English
Published: Nature Publishing Group 2021-03-01
Series:Scientific Reports
Online Access:https://doi.org/10.1038/s41598-021-84085-0
id doaj-87bf7a855812485985f136472c5354ad
record_format Article
spelling doaj-87bf7a855812485985f136472c5354ad2021-03-11T12:14:52ZengNature Publishing GroupScientific Reports2045-23222021-03-0111111310.1038/s41598-021-84085-0Likelihood-based approach to discriminate mixtures of network models that vary in timeNaomi A. Arnold0Raul J. Mondragón1Richard G. Clegg2School of Electronic Engineering and Computer Science, Queen Mary University of LondonSchool of Electronic Engineering and Computer Science, Queen Mary University of LondonSchool of Electronic Engineering and Computer Science, Queen Mary University of LondonAbstract Discriminating between competing explanatory models as to which is more likely responsible for the growth of a network is a problem of fundamental importance for network science. The rules governing this growth are attributed to mechanisms such as preferential attachment and triangle closure, with a wealth of explanatory models based on these. These models are deliberately simple, commonly with the network growing according to a constant mechanism for its lifetime, to allow for analytical results. We use a likelihood-based framework on artificial data where the network model changes at a known point in time and demonstrate that we can recover the change point from analysis of the network. We then use real datasets and demonstrate how our framework can show the changing importance of network growth mechanisms over time.https://doi.org/10.1038/s41598-021-84085-0
collection DOAJ
language English
format Article
sources DOAJ
author Naomi A. Arnold
Raul J. Mondragón
Richard G. Clegg
spellingShingle Naomi A. Arnold
Raul J. Mondragón
Richard G. Clegg
Likelihood-based approach to discriminate mixtures of network models that vary in time
Scientific Reports
author_facet Naomi A. Arnold
Raul J. Mondragón
Richard G. Clegg
author_sort Naomi A. Arnold
title Likelihood-based approach to discriminate mixtures of network models that vary in time
title_short Likelihood-based approach to discriminate mixtures of network models that vary in time
title_full Likelihood-based approach to discriminate mixtures of network models that vary in time
title_fullStr Likelihood-based approach to discriminate mixtures of network models that vary in time
title_full_unstemmed Likelihood-based approach to discriminate mixtures of network models that vary in time
title_sort likelihood-based approach to discriminate mixtures of network models that vary in time
publisher Nature Publishing Group
series Scientific Reports
issn 2045-2322
publishDate 2021-03-01
description Abstract Discriminating between competing explanatory models as to which is more likely responsible for the growth of a network is a problem of fundamental importance for network science. The rules governing this growth are attributed to mechanisms such as preferential attachment and triangle closure, with a wealth of explanatory models based on these. These models are deliberately simple, commonly with the network growing according to a constant mechanism for its lifetime, to allow for analytical results. We use a likelihood-based framework on artificial data where the network model changes at a known point in time and demonstrate that we can recover the change point from analysis of the network. We then use real datasets and demonstrate how our framework can show the changing importance of network growth mechanisms over time.
url https://doi.org/10.1038/s41598-021-84085-0
work_keys_str_mv AT naomiaarnold likelihoodbasedapproachtodiscriminatemixturesofnetworkmodelsthatvaryintime
AT rauljmondragon likelihoodbasedapproachtodiscriminatemixturesofnetworkmodelsthatvaryintime
AT richardgclegg likelihoodbasedapproachtodiscriminatemixturesofnetworkmodelsthatvaryintime
_version_ 1724224604769091584