We study synchronization for two unidirectionally coupled networks. This is a substantial generalization of several recent papers investigating inside network. derive analytically criterion the networks which have same (inside) topological connectivity. Then numerical examples are given fit theoretical analysis. In addition, calculations with different connections presented and interesting desynchronization alternately appear increasing value coupling strength.

In this paper, synchronization between two discrete-time networks, called “outer synchronization” for brevity, is theoretically and numerically studied. First, a sufficient criterion outer coupled networks which have the same connection topologies derived analytically. Numerical examples are also given they in line with theoretical analysis. Additionally, numerical investigations of different analyzed as well. The involved results show that these matrices can reach synchronization.

For complex and popular software, project teams could receive a large number of bug reports. It is often tedious costly to manually assign these reports developers who have the expertise fix bugs. Many triage techniques been proposed automate this process. In paper, we describe our study on applying conventional projects different sizes. We find that effectiveness technique largely depends size team (measured in terms developers). The methods become less effective when increases. To further...

In a supply chain network (SCN), the failure of one node may result in cascading failures and lead to paralysis entire network. The accurate identification critical nodes SCN is important for securing chain. This study proposes new method identifying SCNs based on topological functional characteristics SCNs. effectiveness this verified using an underloaded cascade process. A comparison with results obtained from other methods confirms that proposed could effectively identify key SCN. Thus,...

In this paper, we calculate the number of spanning trees in prism and antiprism graphs corresponding to skeleton a an antiprism. By electrically equivalent transformations rules weighted generating function, obtain relationship for at successive two generations. Using knowledge difference equations, derive analytical expressions enumeration trees. addition, again Apollonian networks, which shows that method is simple effective. Finally compare entropy our networks with other studied find...

In this paper, we study consensus problems in a family of tree networks and investigate first second order denoted as network coherence characterized by Laplacian spectrum. According to the structures, obtain recursive relationships matrix its eigenvalues at two successive generations. We then analytical expressions for sum reciprocals square all nonzero eigenvalues. Finally, calculate see that scalings with size N are lnN N, which smaller than some studied graphs, such Peano basin fractal,...

This brief investigates robustness of the consensus characterized as coherence in noisy scale-free networks under average degree, random nodal failures, and target attacks. A new centrality index named leader is proposed to identify more influential spreaders based on coherence. It shown that leaderless leader-follower better at same network size with higher degree. The obtained results reveal becomes worse attacks where nodes are removed by descending order closeness eigenvector centrality....

Abstract Random walk is a stochastic process that moves through network between different states according to set of probability rules. This mechanism crucial for understanding the importance nodes and their similarities, it widely used in page ranking, information retrieval community detection. In this study, we introduce family rounded fractal networks with varying topologies conduct an analysis investigate scaling behaviour mean first-passage time (MFPT) random walks. We present exact...

In a generic model of excitable media, we simulate wave emission from heterogeneity (WEH) induced by an electric field. Based on the WEH effect, rotating field is proposed to terminate existed spatiotemporal turbulence. Compared with effects resulted periodic pulsed field, displays several improvements, such as lower required intensity, emitting waves smaller obstacles, and shorter suppression time. Furthermore, due rotation it can automatically source boundary obstacle small curvature.

Abstract In this paper, we investigate adaptive outer synchronization for identifying unknown network topology and parameters between two coupled complex networks with time-varying delays existing in the node dynamics coupling forms. By designing controllers updating laws, obtain theorems on appearance of using Lyapunov stability theory. numerical examples, provide detailed identification criteria system parameter according to obtained give some examples show efficiency proposed controllers.

Abstract In this paper, we study noisy consensus dynamics in two families of weighted ring-trees networks and recursive trees with a controlled initial state. Based on the topological structures, obtain exact expressions for first- second-order network coherence as function involved parameters provide scalings regarding size. We then show that weights dominate behaviors scalings. Finally, make comparison between same number nodes is better than since state ring.

On the basis of Koch networks that were constructed using fractals, we propose a family with novel features include an initial state is complete graph arbitrary number nodes as generalization triangle. In subsequent evolutionary step, existing create finite graphs. The analytical expressions for degree distribution, clustering coefficient, average path length, and correlations are obtained. This follows power-law has large small rich properties. can be assortative, disassortative, or...

In this paper, we use a hybrid feedback control method to study lag synchronization in uncertain drive-response dynamical networks with feature that the unknown system parameter exists node dynamics. We then design two methods achieve including linear and adaptive control. With designed controllers update laws for dynamics, obtain theorems on based LaSalle invariance principle. When is achieved, identify parameter. Finally, provide numerical examples verify efficiency of proposed schemes.

In this paper we study the problem of enumerating spanning trees on Apollonian networks and obtain an exact expression for number trees, which is relevant to some dynamical characteristics networks, such as reliability, synchronization random walks. addition, compare entropy our with other fractal find that highest among studied networks.