One model, three layers: nested persistence conditions under resource pooling and information renewal

We study one stochastic model built from two substantive assumptions (technical conditions are stated with them): resources fluctuate multiplicatively above an absorbing floor and can be pooled, and an agent's sustained information inflow can only come from the products of other agents, because a fixed natural source of finite entropy is eventually exhausted. A fixed set of N agents is partitioned into pooling groups; the drift of proportional returns μ(n) may depend on the number n of agents not yet ruined; and each agent's production probability ν_j(t) may follow a bistable capacity law driven by the time it can spend building capacity. We prove that, almost surely on the event that exactly the agents in a set S are never ruined, the long-run information inflow of an agent i in S equals R · Σ_{j ∈ S, j ≠ i} ν_j^∞, where R is the information carried by one product and ν_j^∞ is the limiting production probability. Material ruin and loss of production capacity therefore remove an agent's contribution to others in exactly the same way. It follows that the probability that all N agents persist equals 1{ min_i R · Σ_{j ≠ i} ν_j^∞ ≥ η } · Π_j p_{k_j}(μ(N)), an explicit product over groups, and that, if any agent persists, the number of agents never ruined lies in the set { n : n·μ(n) > σ²/2 } (a necessary condition, not a sufficient one). Three earlier results are the cases in which one constant of the model at a time is made endogenous: with constant μ and ν, an individual needs both pooled survival and enough surviving partners; with endogenous ν, insufficient support for others lowers the information inflow of materially secure agents, with a discontinuity and a restoration deadline; with load-dependent μ(n), joint survival of everyone is possible only inside a viability window. The three conditions are nested, in that each takes as input what the next outer layer determines, and none can substitute for another. All results concern a fixed cohort of agents, with no entry and no removal; they are exact within the model, and numerical illustrations agree with them. This working paper unifies three companion preprints (doi:10.5281/zenodo.23618657, doi:10.5281/zenodo.23644239, doi:10.5281/zenodo.23669076). Sections 4–6 restate their results; the unified model, the survivor-set inflow lemma, the joint persistence formula with heterogeneous capacities and the nesting theorem are new.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-20
DOI
https://doi.org/10.5281/zenodo.24383928
Primary Topic
Complex Systems and Time Series Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

One model, three layers: nested persistence conditions under resource pooling and information renewal

Yusuke Tanaka
1 links
Zenodo (CERN European Organization for Nuclear Research)
Complex Systems and Time Series Analysis
article

One model, three layers: nested persistence conditions under resource pooling and information renewal

Yusuke Tanaka
article en

Abstract

We study one stochastic model built from two substantive assumptions (technical conditions are stated with them): resources fluctuate multiplicatively above an absorbing floor and can be pooled, and an agent's sustained information inflow can only come from the products of other agents, because a fixed natural source of finite entropy is eventually exhausted. A fixed set of N agents is partitioned into pooling groups; the drift of proportional returns μ(n) may depend on the number n of agents not yet ruined; and each agent's production probability ν_j(t) may follow a bistable capacity law driven by the time it can spend building capacity. We prove that, almost surely on the event that exactly the agents in a set S are never ruined, the long-run information inflow of an agent i in S equals R · Σ_{j ∈ S, j ≠ i} ν_j^∞, where R is the information carried by one product and ν_j^∞ is the limiting production probability. Material ruin and loss of production capacity therefore remove an agent's contribution to others in exactly the same way. It follows that the probability that all N agents persist equals 1{ min_i R · Σ_{j ≠ i} ν_j^∞ ≥ η } · Π_j p_{k_j}(μ(N)), an explicit product over groups, and that, if any agent persists, the number of agents never ruined lies in the set { n : n·μ(n) > σ²/2 } (a necessary condition, not a sufficient one). Three earlier results are the cases in which one constant of the model at a time is made endogenous: with constant μ and ν, an individual needs both pooled survival and enough surviving partners; with endogenous ν, insufficient support for others lowers the information inflow of materially secure agents, with a discontinuity and a restoration deadline; with load-dependent μ(n), joint survival of everyone is possible only inside a viability window. The three conditions are nested, in that each takes as input what the next outer layer determines, and none can substitute for another. All results concern a fixed cohort of agents, with no entry and no removal; they are exact within the model, and numerical illustrations agree with them. This working paper unifies three companion preprints (doi:10.5281/zenodo.23618657, doi:10.5281/zenodo.23644239, doi:10.5281/zenodo.23669076). Sections 4–6 restate their results; the unified model, the survivor-set inflow lemma, the joint persistence formula with heterogeneous capacities and the nesting theorem are new.

Zenodo (CERN European Organization for Nuclear Research)
Complex Systems and Time Series Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon