Design of Self-Organizing Networks: Creating specified degree distributions

Holly Silk, Martin Homer, Thilo Gross

Research output: Contribution to journalArticle (Academic Journal)peer-review

12 Citations (Scopus)
294 Downloads (Pure)

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.
Original languageEnglish
Article number7508902
Pages (from-to)147-158
Number of pages12
JournalIEEE Transactions on Network Science and Engineering
Volume3
Issue number3
Early online date12 Jul 2016
DOIs
Publication statusPublished - Jul 2016

Research Groups and Themes

  • Engineering Mathematics Research Group

Keywords

  • Complex networks
  • Network dynamics
  • Self-organization

Fingerprint

Dive into the research topics of 'Design of Self-Organizing Networks: Creating specified degree distributions'. Together they form a unique fingerprint.

Cite this