Dynamical robustness in presence of attractive-repulsive interactions

Sharma, Amit; Rakshit, Biswambhar

doi:10.1016/j.chaos.2022.111823

Cited by 7 publications

(2 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…From locally coupled [41] to scale-free [42] and multilayer networks [43] have been assumed to frame the interaction among the constituents. Even, mean-field coupled network [44], weighted network [45], additional repulsion [46,47] and time-delayed coupling [48] has been taken into account that affect aging of networks.…”

Section: Introductionmentioning

confidence: 99%

Dynamical robustness of complex networks subject to long-range connectivity

Majhi

2022

Preprint

View full text Add to dashboard Cite

In spite of a few attempts in understanding the dynamical robustness of complex networks, this extremely important subject of research is still in its dawn as compared to the other dynamical processes on networks. We hereby consider the concept of long-range interactions among the dynamical units of complex networks and demonstrate for the first time that such a characteristic can have noteworthy impacts on the dynamical robustness of networked systems, regardless of the underlying network topology. We present a comprehensive analysis of this phenomenon on top of diverse network architectures. Such dynamical damages being able to substantially affect the network performance, determining mechanisms that boost the robustness of networks becomes a fundamental question. In this work, we put forward a prescription based upon self-feedback that can efficiently resurrect global rhythmicity of complex networks composed of active and inactive dynamical units, and thus can enhance the network robustness. We have been able to delineate the whole proposition analytically while dealing with all d-path adjacency matrices, having an excellent agreement with the numerical results. For the numerical computations, we examine scale-free networks, Watts-Strogatz small world model and also Erdös-Rényi random network, along with Landau-Stuart oscillators for casting the local dynamics.

show abstract

Section: Introductionmentioning

confidence: 99%

Dynamical robustness of complex networks subject to long-range connectivity

Majhi

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…From locally coupled [41] to scale-free [42] and multilayer networks [43] have been assumed to frame the interaction among the constituents. Even mean-field coupled network [44], weighted network [45], additional repulsion [46,47] and time-delayed coupling [48] have been taken into account that affect ageing of networks.…”

Section: Introductionmentioning

confidence: 99%

Dynamical robustness of complex networks subject to long-range connectivity

Majhi

2022

Proc. R. Soc. A.

View full text Add to dashboard Cite

In spite of a few attempts in understanding the dynamical robustness of complex networks, this extremely important subject of research is still in its dawn as compared to the other dynamical processes on networks. We hereby consider the concept of long-range interactions among the dynamical units of complex networks and demonstrate for the first time that such a characteristic can have noteworthy impacts on the dynamical robustness of networked systems, regardless of the underlying network topology. We present a comprehensive analysis of this phenomenon on top of diverse network architectures. Such dynamical damages being able to substantially affect the network performance, determining mechanisms that boost the robustness of networks becomes a fundamental question. In this work, we put forward a prescription based upon self-feedback that can efficiently resurrect global rhythmicity of complex networks composed of active and inactive dynamical units, and thus can enhance the network robustness. We have been able to delineate the whole proposition analytically while dealing with all d -path adjacency matrices, having an excellent agreement with the numerical results. For the numerical computations, we examine scale-free networks, Watts–Strogatz small-world model and also Erdös–Rényi random network, along with Landau–Stuart oscillators for casting the local dynamics.

show abstract

Dependence of the Behaviors of Trajectories of Dynamic Conflict Systems on the Interaction Vector

Satur

2023

J Math Sci

View full text Add to dashboard Cite

Dynamical robustness in presence of attractive-repulsive interactions

Cited by 7 publications

References 28 publications

Dynamical robustness of complex networks subject to long-range connectivity

Dynamical robustness of complex networks subject to long-range connectivity

Dynamical robustness of complex networks subject to long-range connectivity

Dependence of the Behaviors of Trajectories of Dynamic Conflict Systems on the Interaction Vector

Contact Info

Product

Resources

About