Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated just now
PreprintCC BY-NC-ND 4.0arXiv

Condensation and optimal targeting of repeated forcing in heterogeneous networks

Abstract

Many networks receive repeated external forcing through a subset of entry nodes, for example infections imported from another population, information seeded by a campaign, or invasive species arriving through ports. We study how concentrating such forcing on important entry nodes, with seeding probability πi∝ wiγ, changes the size of the resulting cascades in a stochastic SIR model on bipartite networks. The response to one seeding event is linear in the degree of the seeded node, so the relative gain from targeting does not depend on transmissibility. The targeting distribution is a Gibbs measure. For importance tails p(w)∼ w−a and responses growing as wη, the targeted response diverges at γ1=a−1−η and the forcing condenses on a few nodes at γ2=a−1. Under repeated forcing, the burden-maximizing exponent γ* is strictly positive, and in large populations depletion of nodes already reached bounds it by the condensation point, γ*≤γ2. The optimum decays as γ*≃ K/x for intense forcing, where x is the expected number of seeding events per entry node, and approaches the condensation point as γ2−γ*≃(a−1)/ln(1/x) for sparse forcing. A cut-off of the importance distribution rounds the transitions in populations smaller than a crossover size nc and removes them in larger ones. Networks calibrated to survey data on sexual partnerships have between 0.08 nc and 0.8 nc entry nodes, which places them in the finite-size regime, where the asymptotic results hold only qualitatively.

Related

  1. Symmetry-enriched topological order in tensor networks: Defects, gauging and anyon condensation
    Dominic J. Williamson, Nick Bultinck, Frank Verstraete
    QuantumPeer-reviewedCC BYFull text86 citedAtomic, molecular & optical physicsOpenAlex
  2. Allocation Condensation in Redistributive Networks
    T. Ashwin Bhattathiripad, Vipin P. Veetil
    arXivPreprintCC BY-NC-ND 4.0Full textStatistical & nonlinear physicsarXiv
  3. Optimal Control of Chemical Reaction Networks with Thermodynamic Cost
    Tetsuya J. Kobayashi, Alix Robin, Shuhei A. Horiguchi
    arXivPreprintCC BY 4.0Full textPhysical chemistryMathematical physicsarXiv
  4. Optimal design of higher-order interactions for mutual synchronization among three collectively oscillating networks
    Sotaro Kuroiwa, Yuzuru Kato
    arXivPreprintarXiv licenceFull textStatistical & nonlinear physicsarXiv
  5. Cost convexity controls the architecture of resistance-optimal networks
    Hugo Tovar, Genaro Vázquez-Victorio, Enrique Hernández-Lemus +2
    arXivPreprintCC BY-SA 4.0Full textBiological & medical physicsarXiv
BibTeX
@misc{herreradiestra2026condensation,
  title = {{Condensation and optimal targeting of repeated forcing in heterogeneous networks}},
  author = {Jose Herrera-Diestra},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.29714},
  eprint = {2610.29714},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.29714},
  note = {CC BY-NC-ND 4.0},
}
RIS
TY  - UNPB
TI  - Condensation and optimal targeting of repeated forcing in heterogeneous networks
AU  - Jose Herrera-Diestra
PY  - 2026
DA  - 2026/10/21
PB  - arXiv
DO  - 10.48550/arxiv.2610.29714
UR  - https://arxiv.org/abs/2610.29714
AB  - Many networks receive repeated external forcing through a subset of entry nodes, for example infections imported from another population, information seeded by a campaign, or invasive species arriving through ports. We study how concentrating such forcing on important entry nodes, with seeding probability π_i∝ w_i^γ, changes the size of the resulting cascades in a stochastic SIR model on bipartite networks. The response to one seeding event is linear in the degree of the seeded node, so the relative gain from targeting does not depend on transmissibility. The targeting distribution is a Gibbs measure. For importance tails p(w)∼ w^−a and responses growing as w^η, the targeted response diverges at γ_1=a−1−η and the forcing condenses on a few nodes at γ_2=a−1. Under repeated forcing, the burden-maximizing exponent γ^* is strictly positive, and in large populations depletion of nodes already reached bounds it by the condensation point, γ^*≤γ_2. The optimum decays as γ^*≃ K/x for intense forcing, where x is the expected number of seeding events per entry node, and approaches the condensation point as γ_2−γ^*≃(a−1)/ln(1/x) for sparse forcing. A cut-off of the importance distribution rounds the transitions in populations smaller than a crossover size n_c and removes them in larger ones. Networks calibrated to survey data on sexual partnerships have between 0.08 n_c and 0.8 n_c entry nodes, which places them in the finite-size regime, where the asymptotic results hold only qualitatively.
ER  -