Ordinal Preferential Attachment

A Self-Organizing Principle Generating Dense Scale-Free Networks

Taichi Haruna, Yukio Gunji

    Research output: Contribution to journalArticle

    Abstract

    Networks are useful representations for analyzing and modeling real-world complex systems. They are often both scale-free and dense: their degree distribution follows a power-law and their average degree grows over time. So far, it has been argued that producing such networks is difficult without externally imposing a suitable cutoff for the scale-free regime. Here, we propose a new growing network model that produces dense scale-free networks with dynamically generated cutoffs. The link formation rule is based on a weak form of preferential attachment depending only on order relations between the degrees of nodes. By this mechanism, our model yields scale-free networks whose scaling exponents can take arbitrary values greater than 1. In particular, the resulting networks are dense when scaling exponents are 2 or less. We analytically study network properties such as the degree distribution, the degree correlation function, and the local clustering coefficient. All analytical calculations are in good agreement with numerical simulations. These results show that both sparse and dense scale-free networks can emerge through the same self-organizing process.

    Original languageEnglish
    Article number4130
    JournalScientific reports
    Volume9
    Issue number1
    DOIs
    Publication statusPublished - 2019 Dec 1

    Fingerprint

    Cluster Analysis

    ASJC Scopus subject areas

    • General

    Cite this

    Ordinal Preferential Attachment : A Self-Organizing Principle Generating Dense Scale-Free Networks. / Haruna, Taichi; Gunji, Yukio.

    In: Scientific reports, Vol. 9, No. 1, 4130, 01.12.2019.

    Research output: Contribution to journalArticle

    @article{4dc329faa26d4285b6ba4b177dcc2726,
    title = "Ordinal Preferential Attachment: A Self-Organizing Principle Generating Dense Scale-Free Networks",
    abstract = "Networks are useful representations for analyzing and modeling real-world complex systems. They are often both scale-free and dense: their degree distribution follows a power-law and their average degree grows over time. So far, it has been argued that producing such networks is difficult without externally imposing a suitable cutoff for the scale-free regime. Here, we propose a new growing network model that produces dense scale-free networks with dynamically generated cutoffs. The link formation rule is based on a weak form of preferential attachment depending only on order relations between the degrees of nodes. By this mechanism, our model yields scale-free networks whose scaling exponents can take arbitrary values greater than 1. In particular, the resulting networks are dense when scaling exponents are 2 or less. We analytically study network properties such as the degree distribution, the degree correlation function, and the local clustering coefficient. All analytical calculations are in good agreement with numerical simulations. These results show that both sparse and dense scale-free networks can emerge through the same self-organizing process.",
    author = "Taichi Haruna and Yukio Gunji",
    year = "2019",
    month = "12",
    day = "1",
    doi = "10.1038/s41598-019-40716-1",
    language = "English",
    volume = "9",
    journal = "Scientific Reports",
    issn = "2045-2322",
    publisher = "Nature Publishing Group",
    number = "1",

    }

    TY - JOUR

    T1 - Ordinal Preferential Attachment

    T2 - A Self-Organizing Principle Generating Dense Scale-Free Networks

    AU - Haruna, Taichi

    AU - Gunji, Yukio

    PY - 2019/12/1

    Y1 - 2019/12/1

    N2 - Networks are useful representations for analyzing and modeling real-world complex systems. They are often both scale-free and dense: their degree distribution follows a power-law and their average degree grows over time. So far, it has been argued that producing such networks is difficult without externally imposing a suitable cutoff for the scale-free regime. Here, we propose a new growing network model that produces dense scale-free networks with dynamically generated cutoffs. The link formation rule is based on a weak form of preferential attachment depending only on order relations between the degrees of nodes. By this mechanism, our model yields scale-free networks whose scaling exponents can take arbitrary values greater than 1. In particular, the resulting networks are dense when scaling exponents are 2 or less. We analytically study network properties such as the degree distribution, the degree correlation function, and the local clustering coefficient. All analytical calculations are in good agreement with numerical simulations. These results show that both sparse and dense scale-free networks can emerge through the same self-organizing process.

    AB - Networks are useful representations for analyzing and modeling real-world complex systems. They are often both scale-free and dense: their degree distribution follows a power-law and their average degree grows over time. So far, it has been argued that producing such networks is difficult without externally imposing a suitable cutoff for the scale-free regime. Here, we propose a new growing network model that produces dense scale-free networks with dynamically generated cutoffs. The link formation rule is based on a weak form of preferential attachment depending only on order relations between the degrees of nodes. By this mechanism, our model yields scale-free networks whose scaling exponents can take arbitrary values greater than 1. In particular, the resulting networks are dense when scaling exponents are 2 or less. We analytically study network properties such as the degree distribution, the degree correlation function, and the local clustering coefficient. All analytical calculations are in good agreement with numerical simulations. These results show that both sparse and dense scale-free networks can emerge through the same self-organizing process.

    UR - http://www.scopus.com/inward/record.url?scp=85062766186&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=85062766186&partnerID=8YFLogxK

    U2 - 10.1038/s41598-019-40716-1

    DO - 10.1038/s41598-019-40716-1

    M3 - Article

    VL - 9

    JO - Scientific Reports

    JF - Scientific Reports

    SN - 2045-2322

    IS - 1

    M1 - 4130

    ER -