scholarly journals Generalized Outer Synchronization between Complex Networks with Unknown Parameters

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Di Ning ◽  
Xiaoqun Wu ◽  
Jun-an Lu ◽  
Hui Feng

As is well known, complex networks are ubiquitous in the real world. One network always behaves differently from but still coexists in balance with others. This phenomenon of harmonious coexistence between different networks can be termed as “generalized outer synchronization (GOS).” This paper investigates GOS between two different complex dynamical networks with unknown parameters according to two different methods. When the exact functional relations between the two networks are previously known, a sufficient criterion for GOS is derived based on Barbalat's lemma. If the functional relations are not known, the auxiliary-system method is employed and a sufficient criterion for GOS is derived. Numerical simulations are further provided to demonstrate the feasibility and effectiveness of the theoretical results.

2014 ◽  
Vol 598 ◽  
pp. 714-717
Author(s):  
Sheng Qin Jiang ◽  
Guo Liang Cai ◽  
Shui Ming Cai

This paper studies synchronization of complex networks with multi-unknown parameters and disturbances via discrete control. Based on Lyapunov stability theorem and the stability analysis of impulse system, adaptive-impulse synchronization criteria for general multi-uncertain complex networks have been established. Finally, a numerical simulation is provided to support the theoretical results.


2019 ◽  
Vol 6 (1) ◽  
Author(s):  
Vincenza Carchiolo ◽  
Marco Grassia ◽  
Alessandro Longheu ◽  
Michele Malgeri ◽  
Giuseppe Mangioni

AbstractMany systems are today modelled as complex networks, since this representation has been proven being an effective approach for understanding and controlling many real-world phenomena. A significant area of interest and research is that of networks robustness, which aims to explore to what extent a network keeps working when failures occur in its structure and how disruptions can be avoided. In this paper, we introduce the idea of exploiting long-range links to improve the robustness of Scale-Free (SF) networks. Several experiments are carried out by attacking the networks before and after the addition of links between the farthest nodes, and the results show that this approach effectively improves the SF network correct functionalities better than other commonly used strategies.


2019 ◽  
Vol 105 ◽  
pp. 199-241 ◽  
Author(s):  
Erik D. Demaine ◽  
Felix Reidl ◽  
Peter Rossmanith ◽  
Fernando Sánchez Villaamil ◽  
Somnath Sikdar ◽  
...  

2021 ◽  
Vol 9 ◽  
Author(s):  
Zhaoxing Li ◽  
Qionghai Liu ◽  
Li Chen

A complex network can crash down due to disturbances which significantly reduce the network’s robustness. It is of great significance to study on how to improve the robustness of complex networks. In the literature, the network rewire mechanism is one of the most widely adopted methods to improve the robustness of a given network. Existing network rewire mechanism improves the robustness of a given network by re-connecting its nodes but keeping the total number of edges or by adding more edges to the given network. In this work we propose a novel yet efficient network rewire mechanism which is based on multiobjective optimization. The proposed rewire mechanism simultaneously optimizes two objective functions, i.e., maximizing network robustness and minimizing edge rewire operations. We further develop a multiobjective discrete partite swarm optimization algorithm to solve the proposed mechanism. Compared to existing network rewire mechanisms, the developed mechanism has two advantages. First, the proposed mechanism does not require specific constraints on the rewire mechanism to the studied network, which makes it more feasible for applications. Second, the proposed mechanism can suggest a set of network rewire choices each of which can improve the robustness of a given network, which makes it be more helpful for decision makings. To validate the effectiveness of the proposed mechanism, we carry out experiments on computer-generated Erdős–Rényi and scale-free networks, as well as real-world complex networks. The results demonstrate that for each tested network, the proposed multiobjective optimization based edge rewire mechanism can recommend a set of edge rewire solutions to improve its robustness.


2021 ◽  
Author(s):  
Lyndsay Roach

The study of networks has been propelled by improvements in computing power, enabling our ability to mine and store large amounts of network data. Moreover, the ubiquity of the internet has afforded us access to records of interactions that have previously been invisible. We are now able to study complex networks with anywhere from hundreds to billions of nodes; however, it is difficult to visualize large networks in a meaningful way. We explore the process of visualizing real-world networks. We first discuss the properties of complex networks and the mechanisms used in the network visualizing software Gephi. Then we provide examples of voting, trade, and linguistic networks using data extracted from on-line sources. We investigate the impact of hidden community structures on the analysis of these real-world networks.


2021 ◽  
Author(s):  
Jian Li ◽  
Wenqing Xu ◽  
Zhaojing Wu ◽  
Yungang Liu

Abstract This paper is devoted to the tracking control of a class of uncertain surface vessels. The main contributions focus on the considerable relaxation of the severe restrictions on system uncertainties and reference trajectory in the related literature. Specifically, all the system parameters are unknown and the disturbance is not necessarily to be differentiable in the paper, but either unknown parameters or disturbance is considered but the other one is excluded in the related literature, or both of them are considered but the disturbance must be continuously differentiable. Moreover, the reference trajectories in the related literature must be at least twice continuously differentiable and themselves as well as their time derivatives must be known for feedback, which are generalized to a more broad class ones that are unknown and only one time continuously differentiable in the paper. To solve the control problem, a novel practical tracking control scheme is presented by using backstepping scheme and adaptive technique, and in turn to derive an adaptive state-feedback controller which guarantees that all the states of the resulting closed-loop system are bounded while the tracking error arrives at and then stay within an arbitrary neighborhood of the origin. Finally, simulation is provided to validate the effectiveness of the proposed theoretical results.


2021 ◽  
Vol 31 (11) ◽  
pp. 113113
Author(s):  
Nikita V. Barabash ◽  
Vladimir N. Belykh ◽  
Grigory V. Osipov ◽  
Igor V. Belykh

Sign in / Sign up

Export Citation Format

Share Document