A multilayer network model of interaction between rumor propagation and media influence.

Rumors spread among the crowd have an impact on media influence, while media influence also has an impact on rumor dissemination. This article constructs a two-layer rumor media interaction network model, in which the rumors spread in the crowd are described using the susceptibility-apathy-propagation-recovery model, and the media influence is described using the corresponding flow model. The rationality of the model is studied, and then a detailed analysis of the model is conducted. In the simulation section, we undertake a sensitivity analysis of the crucial parameters within our model, focusing particularly on their impact on the basic reproduction number. According to data simulation analysis, the following conclusion can be drawn: First, when the media unilaterally influences the crowd and does not accept feedback from the crowd, the influence of the media will decrease to zero over time, which has a negative effect on the spread of rumors among the crowd (the degree of rumor dissemination decreases). Second, when the media does not affect the audience and accepts feedback from the audience, this state is similar to the media collecting information stage, which is to accept rumors from the audience but temporarily not disclose their thoughts. At this time, both the media influence and the spread of rumors in the audience will decrease. Finally, the model is validated using an actual dataset of rumors. The simulation results show an R-squared value of 0.9606, indicating that the proposed model can accurately simulate rumor propagation in real social networks.

The impact of inner-coupling and time delay on synchronization: From single-layer network to hypernetwork.

Though synchronization of complex dynamical systems has been widely studied in the past few decades, few studies pay attention to the impact of network parameters on synchronization in hypernetworks. In this paper, we focus on a specific hypernetwork model consisting of coupled Rössler oscillators and investigate the impact of inner-coupling and time delay on the synchronized region (SR). For the sake of simplicity, the inner-coupling matrix is chosen from three typical forms, which result in classical bounded, unbounded, and empty SR in a single-layer network, respectively. The impact of inner-couplings or time delays on unbounded SR is the most interesting one among the three types of SR. Once the SR of one subnetwork is unbounded, the SR of the whole hypernetwork is also unbounded with a different inner-coupling matrix. In a hypernetwork with unbounded SR, the time delays change not only the size but also the type of SR. In a hypernetwork with bounded or empty SR, the time delays have almost no effect on the type of SR.

Identifying partial topology of complex dynamical networks via a pinning mechanism.

In this paper, we study the problem of identifying the partial topology of complex dynamical networks via a pinning mechanism. By using the network synchronization theory and the adaptive feedback controlling method, we propose a method which can greatly reduce the number of nodes and observers in the response network. Particularly, this method can also identify the whole topology of complex networks. A theorem is established rigorously, from which some corollaries are also derived in order to make our method more cost-effective. Several numerical examples are provided to verify the effectiveness of the proposed method. In the simulation, an approach is also given to avoid possible identification failure caused by inner synchronization of the drive network.

Improved switching condition for reachable set estimation of discrete-time switched delayed neural networks.

This research delves into the reachable set estimation (RSE) problem for general switched delayed neural networks (SDNNs) in the discrete-time context. Note that existing relevant research on SDNNs predominantly relies on either time-dependent or state-dependent switching approaches. The time-dependent versions necessitate the stability of each subnetwork beforehand, whereas the state-dependent switching strategies solely depend on the current state, thus disregarding the historical information of the neuron states. For fully harnessing the historical information pertaining to neuron states, a delicate combined switching strategy (CSS) is formulated with the explicit goal of furnishing a relaxed and less conservative design framework tailored for discrete-time SDNNs, where all subnetworks can also be unstable. By resorting to the established time-dependent multiple Lyapunov-Krasovskii functional (TDMLF) technique, the improved criteria are subsequently presented, ensuring that the reachable set encompassing all potential states of SDNNs is confined to an anticipated bounded set. Ultimately, the practicality and superiority of the presented RSE approach are thoroughly validated by two illustrative simulation examples.

Synchronization of Intermittently Coupled Neural Networks With Coupling Delay.

In recent years, the synchronization of coupled neural networks (CNNs) has been extensively studied. However, existing results heavily rely on assuming continuous couplings, overlooking the prevalence of intermittent couplings in reality. In this article, we address for the first time the synchronization challenge posed by intermittently CNNs (ICNNs) with coupling delay. To overcome the difficulties arising from intermittent couplings, we put forward a general piecewise delay differential inequality to characterize the dynamics during both coupled intervals and decoupled intervals. Based on the proposed inequality, we establish delay-independent synchronization criteria (DISCs) for ICNNs, enabling them to tackle general coupling delay. Notably, unlike previous studies, the achievement of synchronization in our approach does not rely on external control. Furthermore, for ICNNs that synchronize only under small delays, we formulate non-linear matrix inequality (LMI)-based delay-dependent synchronization criteria (DDSCs) that are computationally efficient and do not require delay differentiability. Finally, we provide illustrative examples to demonstrate our theoretical results.

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.

Synchronization of Complex Networks With Nondifferentiable Time-Varying Delay.

In this article, we investigate the synchronization of complex networks with general time-varying delay, especially with nondifferentiable delay. In the literature, the time-varying delay is usually assumed to be differentiable. This assumption is strict and not easy to verify in engineering. Until now, the synchronization of networks with nondifferentiable delay through adaptive control remains a challenging problem. By analyzing the boundedness of the adaptive control gain and extending the well-known Halanay inequality, we solve this problem and establish several synchronization criteria for networks under the centralized adaptive control and networks under the decentralized adaptive control. Particularly, the boundedness of the centralized adaptive control gain is theoretically proved. Numerical simulations are provided to verify the theoretical results.

A New Method for Topology Identification of Complex Dynamical Networks.

Topology identification of complex dynamical networks received extensive attention in the past decade. Most existing studies rely heavily on the linear independence condition (LIC). We find that a critical step in using this condition is not rigorous. Besides, it is difficult to verify this condition. Without regulating the original network, possible identification failure caused by network synchronization cannot be avoided. In this paper, we propose a new method to overcome these shortcomings. We add a regulation mechanism to the original network and construct an auxiliary network consisting of isolated nodes. Along with the outer synchronization between the regulated network and the auxiliary network, we show that the original network can be identified. Our method can avoid identification failure caused by network synchronization. Moreover, we show that there is no need to check the LIC. We finally provide some examples to demonstrate that our method is reliable and has good performances.