Structure properties of collaboration network with tunable clustering (Q2656765)

From MaRDI portal
Revision as of 19:08, 19 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Structure properties of collaboration network with tunable clustering
scientific article

    Statements

    Structure properties of collaboration network with tunable clustering (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 March 2021
    0 references
    This paper studies structure properties of one-mode collaboration network with tunable clustering. The one-mode collaboration network with tunable clustering is constructed by the following steps. The network model begins with a complete graph with \(m_0=2(n-m)\) nodes. At each time step, a complete graph with m new nodes is added and each new node \(v_i\) for \(i=1,\cdots,m\) can be linked with \(n-m\) old nodes \((\omega_1,\cdots,\omega_{n-m})\) and some neighbours of these nodes, where \(n-m>1\). The probability that \(v_i\) is linked to \(\omega_l\) for \(l=1,\cdots,n-m\) is \(k_{\omega_l}\sum_j k_j\), where \(k_{\omega_l}\) is the degree of old node \(\omega_l\). When the \(m\) new nodes are connected to \(\omega_l\), one neighbour of \(\omega_l\) randomly selected links with each new node. If all neighbors of old node \(\omega_l\) are linked to \(v_i\) for \(i=1,\cdots,m\), the previous preferential attachment process is used. Structural properties studied include degree distribution, clustering coefficient and average path length. Simulations have been performed and illustrated the theoretical results.
    0 references
    0 references
    0 references
    average path length
    0 references
    collaboration network
    0 references
    complex system
    0 references
    degree distribution
    0 references
    mean-field approach
    0 references
    tunable clustering
    0 references