arXiv (All)
open access
Allocation condensation under asymptotically complete mixing
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 sus
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Continuously varying exponents in the distribution of waiting times in the symmetric exclusion process on a percolation cluster#1116645
- Evolving scale-free networks and node-based random edge deletion#1117328
- Directed mixed membership stochastic blockmodel#972832
- Competing bootstrap processes on the random graph $G(n,p)$#984796
- Random-Priority Frontier Routing: Tight $Θ(n^c)$ Bounds Against $c$-Node Cartels#820895
Record · ID 1076918
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive