Network coherence and eigentime identity on a family of weighted fractal networks

Zong, Yue; Dai, Meifeng; Wang, Xiaoqian; He, Jiaojiao; Zou, Jiahui; Su, Weiyi

doi:10.1016/j.chaos.2018.02.020

Cited by 20 publications

(3 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Subsequently, additional studies have delved into the analysis of network coherence in deterministic networks. These studies have explored aspects such as introducing weighted factors, scale-free loop structures, multi-layer networks, asymmetric networks, and optimization techniques [10][11][12][13][14][15][16] and many references cited therein. Furthermore, the calculation of network coherence can be achieved through the global mean first passage time of a random walk [17,18].…”

Section: Introductionmentioning

confidence: 99%

Consensus analysis of chain star networks coupled by leaf nodes

Chen,

Zhou,

Sun

2023

Phys. Scr.

View full text Add to dashboard Cite

Coupled star networks coupled by hub nodes have attracted signiﬁcant interest due to the interplay between their coupling forms and dynamics. This paper introduces a novel family of chain star networks that are connected via a small number of leaf nodes. The coherence of these star networks is quantiﬁed using the Laplacian spectrum. By leveraging the network structures, we calculate the characteristic polynomial of the Laplacian matrix and obtain an exact solution for network coherence in relation to network parameters. In addition, we explore the robustness of network coherence against variations in network parameters. Furthermore, we compare the coherence performance of coupled star networks across diﬀerent coupling forms. Our ﬁndings demonstrate that the networks coupled by leaf nodes exhibit better coherence.

show abstract

Section: Introductionmentioning

confidence: 99%

Consensus analysis of chain star networks coupled by leaf nodes

Chen,

Zhou,

Sun

2023

Phys. Scr.

View full text Add to dashboard Cite

show abstract

“…Scholars take common networks topology as the main research object, and have achieved abundant theoretical results [8][9][10][11][12][13][14][15][16]. Y. Yi et al took Koch Network as the research object to study the first-order coherence of Koch network with leaderless and one leader [8].…”

Section: Introductionmentioning

confidence: 99%

Coherence Analysis of Symmetric Star Topology Networks

Gao¹,

Zhu

Chen

et al. 2022

Front. Phys.

View full text Add to dashboard Cite

The dynamics of complex networks are closely related to the topological structure. As an important research branch, the problem of network consensus has attracted more attention. In this paper, the first-order coherence of three kinds of symmetric star topology networks are studied by using the theory of network science. Firstly, three kinds of symmetric star topology network models are given. Secondly, the first-order coherence of these networks are calculated by using matrix theory. The relationships among the first-order coherence of the network and branch length and the number of branches change are obtained by numerical simulation. Finally, we found that the third network has the best consensus, and the change of branch length has more effective impact on network consensus.

show abstract

“…In this paper, we construct a class of the weighted-crystal network to study the ART and the AWSP within the range of topological properties [26][27][28]. Sections 2 and 3 are model construction and partition.…”

Section: Introductionmentioning

confidence: 99%

Scaling of average receiving time and average weighted shortest path on weighted-crystal network

Li¹,

Li²,

Sun³

2021

J. Stat. Mech.

View full text Add to dashboard Cite

In this paper, we focus on a network with even nodes named the weighted-crystal network, which is different from the regular iterative rules. By employing the self-similarity of the crystal network, we study and calculate the average receiving time (ART) and average weighted shortest path (AWSP) after dividing the network into n + 1 blocks. In particular, we pay attention to the hexagon crystal network in order to obtain exact results. The obtained scaled results show that ART grows linearly or sublinearly with the iterative and increases with the weight factor r. Meanwhile, the results of AWSP indicate that AWSP exhibits a sublinear dependence on the network order when r = 1. Otherwise, AWSP tends towards constants when 0 < r < 1.

show abstract

Network coherence and eigentime identity on a family of weighted fractal networks

Cited by 20 publications

References 21 publications

Consensus analysis of chain star networks coupled by leaf nodes

Consensus analysis of chain star networks coupled by leaf nodes

Coherence Analysis of Symmetric Star Topology Networks

Scaling of average receiving time and average weighted shortest path on weighted-crystal network

Contact Info

Product

Resources

About