Leader-follower coherence in noisy ring-trees networks

Sun, Weigang; Hong, Mei-du; Liu, Suyu; Fan, Kai

doi:10.1007/s11071-020-06011-9

Cited by 22 publications

(16 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although not completely synchronous, bursting is of certain synchronicity. This synchronicity will make many methods fail to identify (Li et al 2014;Baraniuk et al 2010;Wang et al 2011b;Lee et al 2013;Su et al 2014), but the method presented in this paper has good applicability (Zhu et al 2019;Sun et al 2020).…”

Section: Numerical Simulationmentioning

confidence: 99%

Detecting synaptic connections in neural systems using compressive sensing

Yan

2021

Cogn Neurodyn

View full text Add to dashboard Cite

Revealing synaptic connections between neurons is of great significance and practical value to biomedicine and bioneurology. We present a general approach to reconstruct neuronal synapses, which is based on compressive sensing and special data processing. And this approach is more suitable for nervous system with peak time series. Numerical simulations illustrate the feasibility and effectiveness of the proposed approach. Moreover, this approach not only adapts to the asymmetry of neural connections and the diversity of coupling strength, but also adapts to the excitability and inhibition of neural node classification. In addition, the effects of the factors on the synaptic connection identification performance and their optimal states for the synaptic connection recovery are discussed. Besides, it is of great practical significance to control the order of Taylor expansion to improve the performance of synaptic connection recognition.

show abstract

Section: Numerical Simulationmentioning

confidence: 99%

Detecting synaptic connections in neural systems using compressive sensing

Yan

2021

Cogn Neurodyn

View full text Add to dashboard Cite

show abstract

“…As a significant interdisciplinary field, consensus-related research has received much attention from both engineers and scholars in the past two decades, and there exist many applications or research works on the consensus problem, for instances, formation control, sensor networks, decision making, and so on. Scholars have conducted significant valuable research on consensus from various aspects, such as the order of system (first or second order [ 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 10 , 11 , 12 , 13 , 14 , 15 , 16 , 17 , 18 , 19 ]), ways of communication (continuous or intermittent [ 4 , 7 ], control methods (adaptive control [ 5 ], intermittent control [ 7 ], sliding mode control [ 19 ]), convergence time (finite time or fixed time [ 6 , 8 ]) and so on.…”

Section: Introductionmentioning

confidence: 99%

“…For solving consensus problems, the connecting relations among nodes are characterised by the graph of the network, and the convergence index of the dynamics model, such as consensus speed [ 1 , 9 ] and network coherence [ 11 , 12 , 13 , 14 , 15 , 16 ], can be determined by the second smallest Laplacian eigenvalue

and the Laplacian spectrum. Similarly, as a branch of coordination problems, synchronization problems are always connected with the notion of system topologies [ 20 , 21 , 22 , 23 , 24 , 25 ].…”

Section: Introductionmentioning

confidence: 99%

“…There exists significant coordination-related research on the Laplacian eigenvalues [ 1 , 9 , 10 , 11 , 12 , 13 , 14 , 15 , 16 , 17 , 18 , 19 , 20 , 21 , 22 ] of the network graph. In these enlightening works, Ref.…”

Section: Introductionmentioning

confidence: 99%

“…In Ref. [ 14 ], an analytical expression for the leader–follower coherence is determined depending on the number of leader nodes and network parameters. In [ 15 ], based on the tree construction, the authors show that the consensus in symmetric and asymmetric trees becomes better with an increasing number of leader nodes.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Consensus-Related Performance of Triplex MASs Based on Partial Complete Graph Structure

Bian

Huang

et al. 2022

Entropy

View full text Add to dashboard Cite

This article mainly studies first-order coherence related to the robustness of the triplex MASs consensus models with partial complete graph structures; the performance index is studied through algebraic graph theory. The topologies of the novel triplex networks are generated by graph operations and the approach of graph spectra is applied to calculate the first-order network coherence. The coherence asymptotic behaviours of the three cases of the partial complete structures are analysed and compared. We find that under the condition that the number of nodes in partial complete substructures n tends to infinity, the coherence asymptotic behaviour of the two sorts of non-isomorphic three-layered networks will be increased by r−12(r+1), which is irrelevant to the peripheral vertices number p; when p tends to infinity, adding star copies to the original triplex topologies will reverse the original size relationship of the coherence under consideration of the triplex networks. Finally, the coherence of the three-layered networks with the same sorts of parameters, but non-isomorphic graphs, are simulated to verify the results.

show abstract

Noisy consensus dynamics in windmill-type graphs

Sun

Liu

2020

Chaos: An Interdisciplinary Journal of Nonlinear Science

View full text Add to dashboard Cite

In the present study, two types of consensus algorithms, including the leaderless coherence and the leader–follower coherence quantified by the Laplacian spectrum, are applied to noisy windmill graphs. Based on the graph construction, exact solutions are obtained for the leader–follower coherence with freely assigned leaders. In order to compare consensus dynamics of two nonisomorphic graphs with the same number of nodes and edges, two generalized windmill graphs are selected as the network models and then explicit expressions of the network coherence are obtained. Then, coherences of models are compared. The obtained results reveal distinct coherence behaviors originating from intrinsic structures of models. Finally, the robustness of the coherence is analyzed. Accordingly, it is found that graph parameters and the number of leaders have a profound impact on the studied consensus algorithms.

show abstract

Leader-follower coherence in noisy ring-trees networks

Cited by 22 publications

References 26 publications

Detecting synaptic connections in neural systems using compressive sensing

Detecting synaptic connections in neural systems using compressive sensing

Consensus-Related Performance of Triplex MASs Based on Partial Complete Graph Structure

Noisy consensus dynamics in windmill-type graphs

Contact Info

Product

Resources

About