{
  "abstract": "We study the efficiency--complexity tradeoff for resource-limited agents through directed first-passage percolation. Nonnegative i.i.d. edge weights represent physical energy expenditure, while the logarithmic size of a constrained path family measures representational complexity. For translation-invariant families, a path-joining property yields deterministic large-distance costs in rational directions and joint convexity in constraint parameter and direction, under suitable moment and feasibility assumptions. Our main result concerns the limiting cost parameterized by path-family entropy. Using techniques from analytic combinatorics in several variables (ACSV), we establish its almost-sure existence and joint continuity in entropy and direction for nested families satisfying additional generating-function conditions, on the corresponding entropy range. Path-count asymptotics supply the change of parameter linking this cost to the constraint-parameterized cost. Two planar examples constrain the number of turns or the number of East-runs of length at least two.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.33864",
  "author_total": 2,
  "authors": [
    {
      "name": "Yuliy Baryshnikov"
    },
    {
      "name": "Efe Onaran"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/3kgem93y4wshq.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.33864",
  "fulltext_url": null,
  "id": "3kgem93y4wshq",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.33864",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.SY"
    ],
    [
      "arxiv",
      "eess.SY"
    ],
    [
      "arxiv",
      "math.CO"
    ],
    [
      "arxiv",
      "math.PR"
    ],
    [
      "arxiv",
      "q-bio.NC"
    ],
    [
      "openalex",
      "2610|Stochastic processes and statistical mechanics"
    ]
  ],
  "openalex": "W7223933645",
  "pdf_url": "https://arxiv.org/pdf/2610.33864",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-24",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/3kgem93y4wshq.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:35:40Z",
      "native_id": "2610.33864",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.33864"
    }
  ],
  "subjects": [
    {
      "field": "biology",
      "origin": "arxiv:q-bio.NC",
      "subfield": "neuroscience"
    },
    {
      "field": "mathematics",
      "origin": "arxiv:math.CO",
      "subfield": "combinatorics"
    },
    {
      "field": "mathematics",
      "origin": "arxiv:math.PR",
      "subfield": "probability"
    }
  ],
  "title": "Efficiency--Complexity Tradeoff and Constrained Percolation",
  "title_text": "Efficiency--Complexity Tradeoff and Constrained Percolation",
  "type": "preprint",
  "updated_at": "2026-10-30T12:35:44Z",
  "url": "https://research.draconitic.com/paper/3kgem93y4wshq",
  "venue": "arXiv",
  "versions": []
}