{
  "id": "cond-mat/0608341",
  "version": "v1",
  "published": "2006-08-15T22:18:59.000Z",
  "updated": "2006-08-15T22:18:59.000Z",
  "title": "Response of Complex Systems to Complex Perturbations: Complexity Matching",
  "authors": [
    "Paolo Allegrini",
    "Mauro Bologna",
    "Paolo Grigolino",
    "Mirko Lukovic"
  ],
  "comment": "4 pages, 3 figures, submitted to prl",
  "categories": [
    "cond-mat.stat-mech"
  ],
  "abstract": "We argue that complex systems, defined as non-Poisson renewal process, with complexity index $\\mu$, exchange information through complexity matching. We illustrate this property with detailed theoretical and numerical calculations describing a system with complexity index $\\mu_{S}$ perturbed by a signal with complexity index $\\mu_{P}$. We focus our attention on the case $1.5 \\leq \\mu_S \\leq 2$ and $1 \\leq \\mu_{P} \\leq 2$. We show that for $\\mu_{S} \\geq \\mu_P$, the system S reproduces the perturbation, and the response intensity increases with increasing $\\mu_P$. The maximum intensity is realized by the matching condition $\\mu_P = \\mu_S$. For $\\mu_{P} > \\mu_{S}$ the response intensity dies out as $1/t^{\\mu_P-\\mu_S}$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2006-08-15T22:18:59.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "complex systems",
      "complexity matching",
      "complex perturbations",
      "complexity index",
      "non-poisson renewal process"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 4,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2006cond.mat..8341A"
    }
  }
}