An algorithm for motif-based network design

TL;DR

This paper introduces a novel algorithm for designing directed networks that promotes specific motifs and global properties, enabling tailored network structures for biological and complex systems.

Contribution

The paper presents a new motif-based network generation algorithm that explicitly controls motif distribution and global network features like small-worldness and modularity.

Findings

Successfully generates networks with high motif occurrence

Can produce networks with small-world and modular properties

Effective in designing biologically relevant network structures

Abstract

A determinant property of the structure of a biological network is the distribution of local connectivity patterns, i.e., network motifs. In this work, a method for creating directed, unweighted networks while promoting a certain combination of motifs is presented. This motif-based network algorithm starts with an empty graph and randomly connects the nodes by advancing or discouraging the formation of chosen motifs. The in- or out-degree distribution of the generated networks can be explicitly chosen. The algorithm is shown to perform well in producing networks with high occurrences of the targeted motifs, both ones consisting of 3 nodes as well as ones consisting of 4 nodes. Moreover, the algorithm can also be tuned to bring about global network characteristics found in many natural networks, such as small-worldness and modularity.