Generative model for feedback networks

Abstract

We propose a model for network formation and study some of its statistical properties. The motivation for the model comes from the growth of several kinds of real networks (i.e., kinship and trading networks, networks of corporate alliances, networks of autocatalytic chemical reactions). These networks grow either by establishing closer connections by adding links in the existing network or by adding new nodes. A node in these networks lacks the information of the entire network. In order to establish a closer connection to other nodes it starts a search in the neighboring part of the network and waits for a possible feedback from a distant node that received the "searching signal." Our model imitates this behavior by growing the network via the addition of a link that creates a cycle in the network or via the addition of a new node with a link to the network. The forming of a cycle creates feedback between the two ending nodes. After choosing a starting node, a search is made for another node at a suitable distance; if such a node is found, a link is established between this and the starting node, otherwise (such a node cannot be found) a new node is added and is linked to the starting node. We simulate this algorithm and find that we cannot reject the hypothesis that the empirical degree distribution is a q-exponential function, which has been used to model long-range processes in nonequilibrium statistical mechanics.

Locations

• Physical Review E - View
• eScholarship (California Digital Library) - View - PDF
• arXiv (Cornell University) - View - PDF
• PubMed - View
• DataCite API - View