Related papers: Enhance synchronizability via age-based coupling
The propensity for synchronization is studied in a complex network of asymmetrically coupled units, where the asymmetry in a given link is determined by the relative age of the involved nodes. In growing scale-free networks synchronization…
In this paper, inspired by the idea that the hub nodes of a highly heterogeneous network are not only the bottlenecks, but also effective controllers in the network synchronizing process, we bring forward an asymmetrical coupling method…
In this paper, we investigate the factors that affect the synchronization of coupled oscillators on networks. By using the edge-intercrossing method, we keep the degree distribution unchanged to see other statistical properties' effects on…
We investigate a class of growing graphs embedded into the $d$-dimensional torus where new vertices arrive according to a Poisson process in time, are randomly placed in space and connect to existing vertices with a probability depending on…
Most real systems are growing. In order to model the evolution of real systems, many growing network models have been proposed to reproduce some specific topology properties. As the structure strongly influences the network function,…
In this Letter, we propose a growing network model that can generate scale-free networks with a tunable community strength. The community strength, $C$, is directly measured by the ratio of the number of external edges to internal ones; a…
We study a way to set the natural frequency of a newly added oscillator in a growing network to enhance synchronization. Population growth is one of the typical features of many oscillator systems for which synchronization is required to…
This study considers a wireless network where multiple nodes transmit status updates to a base station (BS) via a shared, error-free channel with limited bandwidth. The status updates arrive at each node randomly. We use the Age of…
Given $n$ randomly located source-destination (S-D) pairs on a fixed area network that want to communicate with each other, we study the age of information with a particular focus on its scaling as the network size $n$ grows. We propose a…
Heterogeneity in the degree (connectivity) distribution has been shown to suppress synchronization in networks of symmetrically coupled oscillators with uniform coupling strength (unweighted coupling). Here we uncover a condition for…
In this paper, we investigate the collective synchronization of system of coupled oscillators on Barab\'{a}si-Albert scale-free network. We propose an approach of structural perturbations aiming at those nodes with maximal betweenness. This…
In this paper, the investigation is first motivated by showing two examples of simple regular symmetrical graphs, which have the same structural parameters, such as average distance, degree distribution and node betweenness centrality, but…
Synchronization is critical for system level behaviour in physical, chemical, biological and social systems. Empirical evidence has shown that the network topology strongly impacts the synchronizablity of the system, and the analysis of…
We consider $N$ oscillators coupled by a mean field as in the Winfree model. The model is governed by two parameters: the coupling strength $\kappa$ and the spectrum width $\gamma$ of the frequencies of each oscillator. In the uncoupled…
Using Memory Tabu Search(MTS) algorithm, we investigate the relationship between structural characters and synchronizability of scale-free networks by maximizing and minimizing the ratio $Q$ of the eigenvalues of the coupling matrix by…
We obtain scaling limit results for asymmetric trap models and their infinite volume counterparts, namely asymmetric K processes. Aging results for the latter processes are derived therefrom.
By considering the eigenratio of the Laplacian of the connection graph as synchronizability measure, we propose a procedure for weighting dynamical networks to enhance theirsynchronizability. The method is based on node and edge betweenness…
We study the growth of a reference network with aging of sites defined in the following way. Each new site of the network is connected to some old site with probability proportional (i) to the connectivity of the old site as in the…
We propose a geometric growth model for weighted scale-free networks, which is controlled by two tunable parameters. We derive exactly the main characteristics of the networks, which are partially determined by the parameters. Analytical…
A recent paper "Emergence of scaling in random networks" (cond-mat/9910332) by Barabasi and Albert proposes a growth mechanism to produce a stationary scale free distribution of the number of edges per node in large networks such as the…