Structure properties of collaboration network with tunable clustering (Q2656765): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q552803
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Long Wang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ins.2019.08.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2965990004 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q107675944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability analysis of token-based wireless networked control systems under deception attacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knowledge acquisition: a complex networks approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed estimation over complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: CPP: towards comprehensive privacy preserving for query processing in information networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity distribution and attack tolerance of general networks with both preferential and random attachments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing unpredictable patterns in wireless sensor network data / rank
 
Normal rank
Property / cites work
 
Property / cites work: From the Cover: The structure of scientific collaboration networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating communities for hierarchical control of complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian centrality: A new centrality measure for weighted networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-based compartmental modelling of an SIR epidemic on a dual-layer static-dynamic multiplex network with tunable clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure properties of one-mode collaboration network model based on rate equation approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competition and fitness in one-mode collaboration network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank

Latest revision as of 18:44, 24 July 2024

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
    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

    Identifiers