Allocation Condensation in Redistributive Networks
Abstract
We study a fixed network on which new mass is allocated in proportion to a power of each node's stock and then redistributed. Transport retains a fraction of both old and new mass at each node and divides the rest according to fixed background shares. We show that a small amount of retention can sustain concentration on networks where complete redistribution would leave every node's share of new mass vanishing as the network grows. A node receiving most new mass may retain little relative to the network total, yet much more than redistribution alone would supply. For a power above one, the allocation rule amplifies this relative stock advantage at the next step. We identify retention rates tending to zero with network size that allow widely spread and concentrated stationary allocations to coexist on the same network. One of them stays close to the allocation under complete redistribution. Each node can also dominate a separate concentrated allocation, receiving a share of new mass tending to one. The stocks supporting these allocations attract nearby trajectories, although every stationary stock approaches the same background, with even its largest share tending to zero. These allocations continue to coexist under specified changes in transport that preserve the background. Redistribution can therefore spread the stock widely without spreading new allocations in the same way.
Related
- Symmetry-enriched topological order in tensor networks: Defects, gauging and anyon condensation
- TDM flexible PON based optical fronthaul networks: fine-grained QoT-aware dynamic bandwidth allocation
- Efficient routing and spectrum allocation in arbitrary flex-grid entanglement networks
- Condensation and optimal targeting of repeated forcing in heterogeneous networks
- Efficient routing and spectrum allocation in arbitrary flex-grid entanglement networks
BibTeX
@misc{bhattathiripad2026allocation,
title = {{Allocation Condensation in Redistributive Networks}},
author = {T. Ashwin Bhattathiripad and Vipin P. Veetil},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2607.07399},
eprint = {2607.07399},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2607.07399},
note = {CC BY-NC-ND 4.0},
}
RIS
TY - UNPB
TI - Allocation Condensation in Redistributive Networks
AU - T. Ashwin Bhattathiripad
AU - Vipin P. Veetil
PY - 2026
DA - 2026/09/27
PB - arXiv
DO - 10.48550/arxiv.2607.07399
UR - https://arxiv.org/abs/2607.07399
AB - We study a fixed network on which new mass is allocated in proportion to a power of each node's stock and then redistributed. Transport retains a fraction of both old and new mass at each node and divides the rest according to fixed background shares. We show that a small amount of retention can sustain concentration on networks where complete redistribution would leave every node's share of new mass vanishing as the network grows. A node receiving most new mass may retain little relative to the network total, yet much more than redistribution alone would supply. For a power above one, the allocation rule amplifies this relative stock advantage at the next step. We identify retention rates tending to zero with network size that allow widely spread and concentrated stationary allocations to coexist on the same network. One of them stays close to the allocation under complete redistribution. Each node can also dominate a separate concentrated allocation, receiving a share of new mass tending to one. The stocks supporting these allocations attract nearby trajectories, although every stationary stock approaches the same background, with even its largest share tending to zero. These allocations continue to coexist under specified changes in transport that preserve the background. Redistribution can therefore spread the stock widely without spreading new allocations in the same way.
ER -