相关论文: Enhance synchronizability via age-based coupling

This paper considers an uplink Internet of Things system with synchronous periodic traffic, where multiple devices generate their status updates at the beginning of each global frame and attempt to send them to a common access point. To…

Neural networks can synchronize by learning from each other. In the case of discrete weights full synchronization is achieved in a finite number of steps. Additional networks can be trained by using the inputs and outputs generated during…

The contradiction between the fact that many empirical networks possess power-law degree distribution and the finding that network of heterogeneous degree distribution is difficult to synchronize has been a paradox in the study of network…

We analyse growing networks ranging from collaboration graphs of scientists to the network of similarities defined among the various transcriptional profiles of living cells. For the explicit demonstration of the scale-free nature and…

An approach based on the kernel methods for capturing the nonlinear interdependence between two signals is introduced. It is demonstrated that the proposed approach is useful for characterizing generalized synchronization with a successful…

This paper considers optimization over multiple renewal systems coupled by time average constraints. These systems act asynchronously over variable length frames. For each system, at the beginning of each renewal frame, it chooses an action…

Many real networks such as the World Wide Web, financial, biological, citation and social networks have a power-law degree distribution. Networks with this feature are also called scale-free. Several models for producing scale-free networks…

Many real-world complex networks arise as a result of a competition between growth and rewiring processes. Usually the initial part of the evolution is dominated by growth while the later one rather by rewiring. The initial growth allows…

A scale-free network is grown in the Euclidean space with a global directional bias. On a vertical plane, nodes are introduced at unit rate at randomly selected points and a node is allowed to be connected only to the subset of nodes which…

We investigate transition to synchronization in Sakaguchi-Kuramoto (SK) model on complex networks analytically as well as numerically. Natural frequencies of a percentage ($f$) of higher degree nodes of the network are assumed to be…

We study the generalized synchronization and its stability using master stability function (MSF), in a network of coupled nearly identical dynamical systems. We extend the MSF approach for the case of degenerate eigenvalues of the coupling…

Activity or spin patterns on random scale-free network are studied by mean field analysis and computer simulations. These activity patterns evolve in time according to local majority-rule dynamics which is implemented using (i) parallel or…

We introduce a one-parametric family of tree growth models, in which branching probabilities decrease with branch age $\tau$ as $\tau^{-\alpha}$. Depending on the exponent $\alpha$, the scaling of tree depth with tree size $n$ displays a…

Time synchronization is an important aspect of sensor network operation. However, it is well known that synchronization error accumulates over multiple hops. This presents a challenge for large-scale, multi-hop sensor networks with a large…

We investigate the decay rates of correlations for nonuniformly hyperbolic systems with or without singularities, on piecewise H\"older observables. By constructing a new scheme of coupling methods using the probability renewal theory, we…

Although species longevity is subject to a diverse range of selective forces, the mortality curves of a wide variety of organisms are rather similar. We argue that aging and its universal characteristics may have evolved by means of a…

Using a simple model with link removals as well as link additions, we show that an evolving network is scale free with a degree exponent in the range of (2, 4]. We then establish a relation between the network evolution and a set of…

This paper presents an algorithm for generating scale-free networks with adjustable clustering coefficient. The algorithm is based on a random walk procedure combined with a triangle generation scheme which takes into account genetic…

Through the distinction between ``real'' and ``virtual'' links between the nodes of a graph, we develop a set of simple rules leading to scale-free networks with a tunable degree distribution exponent. Albeit sharing some similarities with…

Many complex systems--from social and communication networks to biological networks and the Internet--are thought to exhibit scale-free structure. However, prevailing explanations rely on the constant addition of new nodes, an assumption…