Pinning Synchronization of Multiplex Delayed Networks With Stochastic Perturbations

Adaptive Exponential Synchronization of Complex Networks With Nondifferentiable Time-Varying Delay

In recent years, the adaptive exponential synchronization (AES) problem of delayed complex networks has been extensively studied. Existing results rely heavily on assuming the differentiability of the time-varying delay, which is not easy to verify in reality. Dealing with nondifferentiable delay in the field of AES is still a challenging problem. In this brief, the AES problem of complex networks with general time-varying delay is addressed, especially when the delay is nondifferentiable. A delay differential inequality is proposed to deal with the exponential stability of delayed nonlinear systems, which is more general than the widely used Halanay inequality. Next, the boundedness of the adaptive control gain is theoretically proved, which is neglected in much of the literature. Then, the AES criteria for networks with general delay are established for the first time by using the proposed inequality and the boundedness of the control gain. Finally, an example is given to demonstrate the effectiveness of the theoretical results.

Interlayer Link Prediction in Multiplex Social Networks Based on Multiple Types of Consistency Between Embedding Vectors

Online users are typically active on multiple social media networks (SMNs), which constitute a multiplex social network. With improvements in cybersecurity awareness, users increasingly choose different usernames and provide different profiles on different SMNs. Thus, it is becoming increasingly challenging to determine whether given accounts on different SMNs belong to the same user; this can be expressed as an interlayer link prediction problem in a multiplex network. To address the challenge of predicting interlayer links, feature or structure information is leveraged. Existing methods that use network embedding techniques to address this problem focus on learning a mapping function to unify all nodes into a common latent representation space for prediction; positional relationships between unmatched nodes and their common matched neighbors (CMNs) are not utilized. Furthermore, the layers are often modeled as unweighted graphs, ignoring the strengths of the relationships between nodes. To address these limitations, we propose a framework based on multiple types of consistency between embedding vectors (MulCEVs). In MulCEV, the traditional embedding-based method is applied to obtain the degree of consistency between the vectors representing the unmatched nodes, and a proposed distance consistency index based on the positions of nodes in each latent space provides additional clues for prediction. By associating these two types of consistency, the effective information in the latent spaces is fully utilized. In addition, MulCEV models the layers as weighted graphs to obtain representation. In this way, the higher the strength of the relationship between nodes, the more similar their embedding vectors in the latent representation space will be. The results of our experiments on several real-world and synthetic datasets demonstrate that the proposed MulCEV framework markedly outperforms current embedding-based methods, especially when the number of training iterations is small.

Finite-Time Passivity and Synchronization of Multi-Weighted Complex Dynamical Networks Under PD Control

This article focuses on finite-time passivity (FTP) and finite-time synchronization (FTS) for complex dynamical networks with multiple state/derivative couplings based on the proportional-derivative (PD) control method. Several criteria of FTP for complex dynamical networks with multiple state couplings (CDNMSCs) are formulated by utilizing the PD controller and constructing an appropriate Lyapunov function. Furthermore, FTP is further used to investigate the FTS in CDNMSCs under the PD controller. In addition, the FTP and FTS for complex dynamical networks with multiple derivative couplings (CDNMDCs) are also studied by exploiting the PD control method and some inequality techniques. Finally, two numerical examples are worked out to demonstrate the validity of the presented PD controllers.

Intralayer Synchronization of Multiplex Dynamical Networks via Pinning Impulsive Control

These days, the synchronization of multiplex networks is an emerging and important research topic. Grounded framework and theory about synchronization and control on multiplex networks are yet to come. This article studies the intralayer synchronization on a multiplex network (i.e., a set of networks connected through interlayer edges), via the pinning impulsive control method. The topologies of different layers are independent of each other, and the individual dynamics of nodes in different layers are different as well. Supra-Laplacian matrices are adopted to represent the topological structures of multiplex networks. Two cases are considered according to impulsive sequences of multiplex networks: 1) pinning controllers are applied to all the layers simultaneously at the instants of a common impulse sequence and 2) pinning controllers are applied to each layer at the instants of distinct impulse sequences. Using the Lyapunov stability theory and the impulsive control theory, several intralayer synchronization criteria for multiplex networks are obtained, in terms of the supra-Laplacian matrix of network topology, self-dynamics of nodes, impulsive intervals, and the pinning control effect. Furthermore, the algorithms for implementing pinning schemes at every impulsive instant are proposed to support the obtained criteria. Finally, numerical examples are presented to demonstrate the effectiveness and correctness of the proposed schemes.

Security synchronization protocol for IT2 stochastic fuzzy multiplex complex networks via fuzzy hybrid control

An issue regarding security synchronization is addressed for a class of interval type-2 (IT2) fuzzy stochastic multiplex complex networks with fuzzy hybrid control under deception attacks. Firstly, some complicated facts are considered in a unified network framework, such as multiplex, multiple delays, and stochastic disturbances, etc. In particular, different from the traditional hypothesis, the uncertainty is taken into consideration for the membership functions and along with the strategy of upper and lower bound and the correlative tradeoff functions to overcome this uncertainty. Secondly, malicious data are injected into channels between sensor and controller that may lead to undesired system performance. Then, based on Lyapunov stability theory and comparison principle, a novel IT2 fuzzy hybrid controller, containing a state feedback controller and a network-based impulsive controller, is designed to ensure a mean-square bounded synchronization so that the error states can converge below error thresholds. Finally, impulsive effects including both positive and negative roles are considered simultaneously in the security synchronization strategy, and the feasibility of the designed scenario is demonstrated by two numerical examples.

Superdiffusion criteria on duplex networks

Diffusion processes widely exist in nature. Some recent papers concerning diffusion processes focus their attention on multiplex networks. Superdiffusion, a phenomenon by which diffusion processes converge to equilibrium faster on multiplex networks than on single networks in isolation, may emerge because diffusion can occur both within and across layers. Some studies have shown that the emergence of superdiffusion depends on the topology of multiplex networks if the interlayer diffusion coefficient is large enough. This paper proposes some superdiffusion criteria relating to the Laplacian matrices of the two layers and provides a construction mechanism for generating a superdiffusible two-layered network. The method we proposed can be used to guide the discovery and construction of superdiffusible multiplex networks without calculating the second smallest Laplacian eigenvalues.

Target Controllability of Two-Layer Multiplex Networks Based on Network Flow Theory

In this paper, we consider the target controllability of two-layer multiplex networks, which is an outstanding challenge faced in various real-world applications. We focus on a fundamental issue regarding how to allocate a minimum number of control sources to guarantee the controllability of each given target subset in each layer, where the external control sources are limited to interact with only one layer. It is shown that this issue is essentially a path cover problem, which is to locate a set of directed paths denoted as P and cycles denoted as C to cover the target sets under the constraint that the nodes in the second layer cannot be the starting node of any element in P , and the number of elements in P attains its minimum. In addition, the formulated path cover problem can be further converted into a maximum network flow problem, which can be efficiently solved by an algorithm called maximum flow-based target path-cover (MFTP). We rigorously prove that MFTP provides the minimum number of control sources for guaranteeing the target controllability of two-layer multiplex networks. It is anticipated that this paper would serve wide applications in target control of real-life networks.

Epidemic Propagation With Positive and Negative Preventive Information in Multiplex Networks

We propose a novel epidemic model based on two-layered multiplex networks to explore the influence of positive and negative preventive information on epidemic propagation. In the model, one layer represents a social network with positive and negative preventive information spreading competitively, while the other one denotes the physical contact network with epidemic propagation. The individuals who are aware of positive prevention will take more effective measures to avoid being infected than those who are aware of negative prevention. Taking the microscopic Markov chain (MMC) approach, we analytically derive the expression of the epidemic threshold for the proposed epidemic model, which indicates that the diffusion of positive and negative prevention information, as well as the topology of the physical contact network have a significant impact on the epidemic threshold. By comparing the results obtained with MMC and those with the Monte Carlo (MC) simulations, it is found that they are in good agreement, but MMC can well describe the dynamics of the proposed model. Meanwhile, through extensive simulations, we demonstrate the impact of positive and negative preventive information on the epidemic threshold, as well as the prevalence of infectious diseases. We also find that the epidemic prevalence and the epidemic outbreaks can be suppressed by the diffusion of positive preventive information and be promoted by the diffusion of negative preventive information.