Synchronization in Weighted Uncorrelated Complex Networks in a Noisy Environment: Optimization and Connections with Transport Efficiency

Abstract

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 link is proportional to $(k_i{k}_j{)}^{\beta }$ with $k_i$ and $k_j$ being the degrees of the nodes connected by the link. Subject to the constraint that the total network cost is fixed, we find that in the mean-field approximation on uncorrelated scale-free graphs, synchronization is optimal at ${\beta }^{\ast }$$=$-1. Numerical results, based on exact numerical diagonalization of the corresponding network Laplacian, confirm the mean-field results, with small corrections to the optimal value of ${\beta }^{\ast }$. Employing our recent connections between the Edwards-Wilkinson process and resistor networks, and some well-known connections between random walks and resistor networks, we also pursue a naturally related problem of optimizing performance in queue-limited communication networks utilizing local weighted routing schemes.

Papers on related research can be found at http://www.rpi.edu/~korniss/Research/

References in corpus (12)

• Prediction and predictability of global epidemics: the role of the airline transportation network
• Network Synchronization, Diffusion, and the Paradox of Heterogeneity
• Enhancing complex-network synchronization
• Suppressing Roughness of Virtual Times in Parallel Discrete-Event Simulations
• Synchronization transition in scale-free networks: Clusters of synchrony
• Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications (Extended Version)
• Diffusion Processes on Power-Law Small-World Networks
• Testing the Collective Properties of Small-World Networks through Roughness Scaling
• Scaling in Small-World Resistor Networks
• Impact of network structure on the capacity of wireless multihop ad hoc communication
• Maximum flow and topological structure of complex networks
• Virtual Time Horizon Control via Communication Network Design

Cited by in corpus (4)

• Synchrony-optimized Networks of Non-identical Kuramoto Oscillators
• Diffusion Processes on Small-World Networks with Distance-Dependent Random-Links
• Limits on Relief through Constrained Exchange on Random Graphs
• Scale-Free Overlay Topologies with Hard Cutoffs for Unstructured Peer-to-Peer Networks