Design of Self-Organising Networks

Abstract

A key problem in the study and design of complex systems is the apparent disconnection between the microscopic and the macroscopic. It is not straightforward to identify the local interactions that give rise to an observed global phenomenon, nor is it simple to design a system that will exhibit some desired global property using only local knowledge. Here we propose a methodology that allows for the identification of local interactions that give rise to a desired global property of a network, the degree distribution. Given a set of observable processes acting on a network, we determine the conditions that must satisfied to generate a desired steady-state degree distribution. We thereby provide a simple example for a class of tasks where a system can be designed to self-organize to a given state.

15 pages, 5 figures; corrected typos, further descriptions added to all sections, subsections added to sec.3 for easier navigation

References in corpus (6)

• Nonequilibrium phase transition in the coevolution of networks and opinions
• Generic Absorbing Transition in Coevolution Dynamics
• Adaptive networks: coevolution of disease and topology
• Analytical Solution of the Voter Model on Disordered Networks
• Adaptive network models of collective decision making in swarming systems
• Absence of epidemic thresholds in a growing adaptive network