Related papers: Optimal Synchronization in Space
The deployment of modern network applications is increasing the network size and traffic volumes at an unprecedented pace. Storing network-related information (e.g., traffic traces) is key to enable efficient network management. However,…
By employing a recently introduced optimization algorithm we explicitely design optimally synchronizable (unweighted) networks for any given scale-free degree distribution. We explore how the optimization process affects degree-degree…
Spatially constrained planar networks are frequently encountered in real-life systems. In this paper, based on a space-filling disk packing we propose a minimal model for spatial maximal planar networks, which is similar to but different…
Small world networks interpolate between fully regular and fully random topologies and simultaneously exhibit large local clustering as well as short average path length. Small world topology has therefore been suggested to support network…
Recently, In [Phys. Rev. Lett. 104, 018701 (2010)] the authors studied a spatial network which is constructed from a regular lattice by adding long-range edges (shortcuts) with probability $P_{ij}\sim r_{ij}^{-\alpha}$, where $r_{ij}$ is…
We investigate robust linear consensus over networks under capacity-constrained communication. The capacity of each edge is encoded as an upper bound on the number of state variables that can be communicated instantaneously. When the edge…
Traffic dynamics on single or isolated complex networks has been extensively studied in the past decade. Recently, several coupled network models have been developed to describe the interactions between real-world networked systems. In a…
Optimal paths connecting randomly selected network nodes and fixed routers are studied analytically in the presence of non-linear overlap cost that penalizes congestion. Routing becomes increasingly more difficult as the number of selected…
We investigate the optimization of synchronizability in multiplex networks and demonstrate that the interlayer coupling strength is the deciding factor for the efficiency of optimization. The optimized networks have homogeneity in the…
We study the synchronized interval in undirected and unweighted random networks of coupled oscillators as a function of the number of edges. In many coupled oscillator systems, synchronization is stable in a finite interval of coupling…
The concept of optimal communication channels shapes our understanding of wave-based communication. Its analysis, however, always pertains to specific communication-domain geometries, without a general theory of scaling laws or fundamental…
This dissertation is a study on the design and analysis of novel, optimal routing and rate control algorithms in wireless, mobile communication networks. Congestion control and routing algorithms upto now have been designed and optimized…
This paper studies a constrained optimization problem over networked systems with an undirected and connected communication topology. The algorithm proposed in this work utilizes singular perturbation, dynamic average consensus, and saddle…
Motivated by the shape of transportation networks such as subways, we consider a distribution of points in the plane and ask for the network $G$ of given length $L$ that is optimal in a certain sense. In the general model, the optimality…
The mathematical framework of multiplex networks has been increasingly realized as a more suitable framework for modelling real-world complex systems. In this work, we investigate the optimization of synchronizability in multiplex networks…
Small-world networks are the focus of recent interest because they appear to circumvent many of the limitations of either random networks or regular lattices as frameworks for the study of interaction networks of complex systems. Here, we…
This work clarifies the relation between network circuit (topology) and behavior (information transmission and synchronization) in active networks, e.g. neural networks. As an application, we show how to determine a network topology that is…
We apply statistical physics to study the task of resource allocation in random networks with limited bandwidths along the transportation links. The mean-field approach is applicable when the connectivity is sufficiently high. It allows us…
Small networks of chaotic units which are coupled by their time-delayed variables, are investigated. In spite of the time delay, the units can synchronize isochronally, i.e. without time shift. Moreover, networks can not only synchronize…
We present a study of the application of a variant of a recently introduced heuristic algorithm for the optimization of transport routes on complex networks to the problem of finding the optimal routes of communication between nodes on…