Response of Complex Systems to Complex Perturbations: Complexity Matching
| dc.creator | Allegrini, Paolo | |
| dc.creator | Bologna, Mauro | |
| dc.creator | Grigolino, Paolo | |
| dc.creator | Lukovic, Mirko | |
| dc.date | 2006-08-15 | |
| dc.date.accessioned | 2026-07-07T07:19:41Z | |
| dc.date.available | 2026-07-07T07:19:41Z | |
| dc.description | We argue that complex systems, defined as non-Poisson renewal process, with complexity index $μ$, exchange information through complexity matching. We illustrate this property with detailed theoretical and numerical calculations describing a system with complexity index $μ_{S}$ perturbed by a signal with complexity index $μ_{P}$. We focus our attention on the case $1.5 \leq μ_S \leq 2$ and $1 \leq μ_{P} \leq 2$. We show that for $μ_{S} \geq μ_P$, the system S reproduces the perturbation, and the response intensity increases with increasing $μ_P$. The maximum intensity is realized by the matching condition $μ_P = μ_S$. For $μ_{P} > μ_{S}$ the response intensity dies out as $1/t^{μ_P-μ_S}$. | |
| dc.description | 4 pages, 3 figures, submitted to prl | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0608341 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0608341 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/114717 | |
| dc.subject | Statistical Mechanics | |
| dc.title | Response of Complex Systems to Complex Perturbations: Complexity Matching | |
| dc.type | text |