Complexity and Heterogeneity in a Dynamic Network

David Lambert and Fabio Vanni

LEM Papers Series from Laboratory of Economics and Management (LEM), Sant'Anna School of Advanced Studies, Pisa, Italy

Abstract: We present an analytical solution for the connectivity of a network model with a "non-simultaneous" linking scheme. Despite its simplicity, this model exhibits node-space correlations in the link distribution, and anomalous fluctuations behavior of the time series of the connectivity variable, and a finite-size e ff ect: the maximum number of links occurs away from the critical value of the system parameter. We derive an exact Master Equation for this model using a quantum algebra approach to stochastic processes. Fluctuations are much more important than the mean-field approximation predicts, which we attribute to the heterogeneity in the model. The maximal heterogeneous population corresponds to the critical value of the system. Finally as an explanatory case we evaluate the growth of the network value in relation with the system interconnectedness.

Keywords: Complexity; heterogeneity; critical phenomena; network value; coordination costs; stochastic processes (search for similar items in EconPapers)
Date: 2017-09-18
New Economics Papers: this item is included in nep-cta
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.lem.sssup.it/WPLem/files/2017-22.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ssa:lemwps:2017/22

Access Statistics for this paper

More papers in LEM Papers Series from Laboratory of Economics and Management (LEM), Sant'Anna School of Advanced Studies, Pisa, Italy Contact information at EDIRC.
Bibliographic data for series maintained by ( this e-mail address is bad, please contact ).