Related papers: Better synchronizability predicted by a new coupli…

Yang, Wang, and Motter [Phys. Rev. Lett. 109, 258701 (2012)] analyzed a model for network observability transitions in which a sensor placed on a node makes the node and the adjacent nodes observable. The size of the connected components…

We study the evolution of heterogeneous networks of oscillators subject to a state-dependent interconnection rule. We find that heterogeneity in the node dynamics is key in organizing the architecture of the functional emerging networks. We…

Designing high-performing networks requires optimizing for functionality while respecting physical, geometric, or budget constraints. Yet, mathematical and computational tools to design such systems remain limited, particularly for…

We consider synchronization of coupled chaotic systems and propose an adaptive strategy that aims at evolving the strength of the coupling to achieve stability of the synchronized evolution. We test this idea in a simple configuration in…

Previous studies have shown that bipartite Hubbard systems with inhomogeneous hopping amplitudes can exhibit higher pair-binding energies than the uniform model. Here we examine whether this result holds for systems with a more generic band…

We propose efficient algorithms for two key tasks in the analysis of large nonuniform networks: uniform node sampling and cluster detection. Our sampling technique is based on augmenting a simple, but slowly mixing uniform MCMC sampler with…

We investigate the stability of synchronization in networks of dynamical systems with strongly delayed connections. We obtain strict conditions for synchronization of periodic and equilibrium solutions. In particular, we show the existence…

We study the synchronization of coupled maps on a variety of networks including regular one and two dimensional networks, scale free networks, small world networks, tree networks, and random networks. For small coupling strengths nodes show…

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…

Various types of promising techniques have come into being for influence maximization whose aim is to identify influential nodes in complex networks. In essence, real-world applications usually have high requirements on the balance between…

Linkage methods are among the most popular algorithms for hierarchical clustering. Despite their relevance the current knowledge regarding the quality of the clustering produced by these methods is limited. Here, we improve the currently…

Many community detection algorithms require the introduction of a measure on the set of nodes. Previously, a lot of efforts have been made to find the top-performing measures. In most cases, experiments were conducted on several datasets or…

A parallel splitting method is proposed for solving systems of coupled monotone inclusions in Hilbert spaces. Convergence is established for a wide class of coupling schemes. Unlike classical alternating algorithms, which are limited to two…

Probabilistic networks display a wide range of high average clustering coefficients independent of the number of nodes in the network. In particular, the local clustering coefficient decreases with the degree of the subtending node in a…

Motivated by synchronization problems in noisy environments, we study the Edwards-Wilkinson process on weighted uncorrelated scale-free networks. We consider a specific form of the weights, where the strength (and the associated cost) of a…

Evaluation of link prediction methods is a hard task in very large complex networks because of the inhibitive computational cost. By setting a lower bound of the number of common neighbors (CN), we propose a new framework to efficiently and…

Transport processes on spatial networks are representative of a broad class of real world systems which, rather than being independent, are typically interdependent. We propose a measure of utility to capture key features that arise when…

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…

Small-world and scale-free networks are known to be more easily synchronized than regular lattices, which is usually attributed to the smaller network distance between oscillators. Surprisingly, we find that networks with a homogeneous…

We consider the relation of symmetries and subspace controllability for spin networks with XXZ coupling subject to control of a single node by a local potential (Z-control). Such networks decompose into excitation subspaces. Focusing on the…