Structure properties of collaboration network with tunable clustering

DOI10.1016/J.INS.2019.08.002MaRDI QIDQ2656765zbMATH OpenOpenAlexWikidataFDO

Authors Guo-Feng Li, Yinghong Ma, Lu Yang, Long Wang

Publication date 16 March 2021

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2019.08.002

zbMATH Keywords

average path lengthcollaboration networkcomplex systemdegree distributionmean-field approachtunable clustering

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Review text

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.

Recommendations

• Star-like scale-free network model with tunable clustering
• The degree distribution of a generalized collaboration network with group preferential attachment
• EVOLVING SCALE-FREE NETWORK MODEL WITH TUNABLE CLUSTERING
• The structure of scientific collaboration networks
• Complex scale-free networks with tunable power-law exponent and clustering

Cites work

• Characterizing unpredictable patterns in wireless sensor network data
• Collective dynamics of `small-world' networks
• Competition and fitness in one-mode collaboration network
• Connectivity distribution and attack tolerance of general networks with both preferential and random attachments
• CPP: towards comprehensive privacy preserving for query processing in information networks
• Distributed estimation over complex networks
• Dominating communities for hierarchical control of complex networks
• Edge-based compartmental modelling of an SIR epidemic on a dual-layer static-dynamic multiplex network with tunable clustering
• Emergence of Scaling in Random Networks
• Knowledge acquisition: a complex networks approach
• Laplacian centrality: A new centrality measure for weighted networks
• Stability analysis of token-based wireless networked control systems under deception attacks
• Structure properties of one-mode collaboration network model based on rate equation approach
• The structure of scientific collaboration networks

Cited in

(5)

• The agglomeration phenomenon influence on the scaling law of the scientific collaboration system
• Structure properties of one-mode collaboration network model based on rate equation approach
• Complex network model based on node attraction with tunable parameters
• Star-like scale-free network model with tunable clustering
• Coopetition bunch graphs: competition and cooperation on COVID19 research

This page was built for publication: Structure properties of collaboration network with tunable clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2656765)