In this paper, we propose a novel two-stage rumor spreading Susceptible-Infected-Authoritative-Removed (SIAR) model for complex homogeneous and heterogeneous networks. The interaction Markov chains (IMC) mean-field equations based on the SIAR are derived to describe dynamic between rumors authoritative information. We use Monte Carlo simulation method characterize dynamics of Susceptible-Infected-Removed (SIR) models, showing that with consideration information gives more realistic...

Disconnecting impaired or suspicious nodes and rewiring to those reliable, adaptive networks have the potential inhibit cascading failures, such as DDoS attack computer virus. The weights of disconnected links, indicating workload can be transferred redistributed newly connected links maintain network operations. Distinctively different from existing studies focused on unweighted networks, this paper presents a new mean-field model analyze reliability weighted against failures. By taking...

Clustering is an effective method for improving the performance of large scale mobile ad hoc networks.However, when moving speed very fast, topology changes quickly, which leads to frequent cluster updates.The drastically increasing control overheads severely threaten throughput network.SCBCS (Signal Characteristic Based Cluster Scheme) proposed as a potentially reduce caused by formation and maintenance in aeronautical networks.Each node periodically broadcasts Hello packets.The packets can...

A tiny fraction of influential individuals play a critical role in the dynamics on complex systems. Identifying nodes networks has theoretical and practical significance. Considering uncertainties network scale topology, timeliness dynamic behaviors real networks, we propose rapid identifying method (RIM) to find high-influential nodes. Instead ranking all nodes, our only aims at small number network. We set as initial spreaders, evaluate performance RIM by susceptible–infected–recovered...

Epidemic models trade the modeling accuracy for complexity reduction. This paper proposes to group vertices in directed graphs based on connectivity and carries out epidemic spread analysis basis, thereby substantially reducing while preserving accuracy. A group-based continuous-time Markov SIS model is developed. The adjacency matrix of network also collapsed according grouping, evaluate Jacobian model. By adopting mean-field approximation groups nodes links, significantly reduced as...

In this paper, to study rum or spreading model for the web forum of which topological structure has a strong heterogeneity, we propose novel susceptible-exposed-infected-removed (SEIR) by introducing importance and fuzziness content or. We derive mean-field equations characterizing dynamics SEIR on heterogeneous network. Then steady-state analysis is conducted investigate critical threshold final size spreading. The simulation results demonstrate that small can effectively reduce maximum...

This paper is concerned with the delay‐dependent synchronization criterion for neutral‐type stochastic delayed complex networks. Firstly, expectations of crossterms containing Itô integral are investigated. In fact, delay systems, if we want to obtain condition less conservatism, how deal cross terms properly vital importance, and many existing results did not these correctly. Then, based on this, this establishes a novel derivation process, mathematical development avoids bounding terms....

When virus spreads in a network, individuals may adaptively change their contact relationships to reduce risk of infection. In order describe the interaction between time varying network topology and dynamics nodes, here we propose susceptible–infected–susceptible (SIS) model on weighted adaptive heterogeneous where networks are described. Rewiring strategies designed inhibit epidemic spreading. Our results show that individual behaviors have significant influence spreading network. The...

Abstract In this paper, we investigate the connectivity of scale-free networks and introduce degree variance which describes numerical distance between average vertices networks, is looked as a measure on robustness scale free subjected to failures. According variance, subject random failures intentional attacks, discuss vertices’ ability defense cascading Furthermore, when given, scheme nonlinear integer program designed attacks according variance. From scheme, can obtain optimal failures,...

Much work in cooperative communication has been done from the perspective of physical and network layers. However, exact impact signal error rate performance on routing discovery still remains unclear multihop ad hoc networks. In this paper, we show symbol (SER) improvement obtained commutation, examine how to incorporate factor SER into distributed scheme called DGCR (Dynamic Geographic Cooperative Routing). For a single hop, present two types metric specify degree that one node is suitable...

Neural networks (NNs) are always perturbed by random noise such as continuous and jump noise. This paper is concerned with the passivity problem of NNs Since Gaussian can depict rather than noise, Poisson utilized to give a description Then employing predictable projection operator Lyapunov theory, criterion presented linear matrix inequality (LMI) format. The main contribution this extend research Two numerical examples provided illustrate effectiveness proposed criterion.