IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v179y2025ics0304414924002151.html
   My bibliography  Save this article

Coarsening in zero-range processes

Author

Listed:
  • Armendáriz, Inés
  • Beltrán, Johel
  • Cuesta, Daniela
  • Jara, Milton

Abstract

We prove a fluid limit describing coarsening for zero-range processes on a finite number of sites, with asymptotically constant jump rates. When time and occupation per site are linearly rescaled by the total number of particles, the evolution of the process is described by a piecewise linear trajectory in the simplex indexed by the sites. The linear coefficients are determined by the trace process of the underlying random walk on the subset of non-empty sites, and the trajectory reaches an absorbing configuration in finite time. A boundary of the simplex is called absorbing for the fluid limit if a trajectory started at a configuration in the boundary remains in it for all times. We identify the set of absorbing configurations and characterize the absorbing boundaries.

Suggested Citation

  • Armendáriz, Inés & Beltrán, Johel & Cuesta, Daniela & Jara, Milton, 2025. "Coarsening in zero-range processes," Stochastic Processes and their Applications, Elsevier, vol. 179(C).
    • Handle: RePEc:eee:spapps:v:179:y:2025:i:c:s0304414924002151
    DOI: 10.1016/j.spa.2024.104507
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304414924002151
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.spa.2024.104507?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Armendáriz, Inés & Grosskinsky, Stefan & Loulakis, Michail, 2013. "Zero-range condensation at criticality," Stochastic Processes and their Applications, Elsevier, vol. 123(9), pages 3466-3496.
    2. Hong Chen & Avi Mandelbaum, 1991. "Discrete Flow Networks: Bottleneck Analysis and Fluid Approximations," Mathematics of Operations Research, INFORMS, vol. 16(2), pages 408-446, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Natalia Chernova & Sergey Foss & Bara Kim, 2012. "On the stability of a polling system with an adaptive service mechanism," Annals of Operations Research, Springer, vol. 198(1), pages 125-144, September.
    2. Ward Whitt & Wei You, 2020. "Heavy-traffic limits for stationary network flows," Queueing Systems: Theory and Applications, Springer, vol. 95(1), pages 53-68, June.
    3. Grosskinsky, Stefan & Jatuviriyapornchai, Watthanan, 2019. "Derivation of mean-field equations for stochastic particle systems," Stochastic Processes and their Applications, Elsevier, vol. 129(4), pages 1455-1475.
    4. Lisa Fleischer & Jay Sethuraman, 2005. "Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions," Mathematics of Operations Research, INFORMS, vol. 30(4), pages 916-938, November.
    5. Vianney Bœuf & Philippe Robert, 2019. "A stochastic analysis of a network with two levels of service," Queueing Systems: Theory and Applications, Springer, vol. 92(3), pages 203-232, August.
    6. Yunan Liu & Ward Whitt, 2011. "A Network of Time-Varying Many-Server Fluid Queues with Customer Abandonment," Operations Research, INFORMS, vol. 59(4), pages 835-846, August.
    7. Liron Ravner & Yutaka Sakuma, 2021. "Strategic arrivals to a queue with service rate uncertainty," Queueing Systems: Theory and Applications, Springer, vol. 97(3), pages 303-341, April.
    8. Nicholas M. Ercolani & Sabine Jansen & Daniel Ueltschi, 2019. "Singularity Analysis for Heavy-Tailed Random Variables," Journal of Theoretical Probability, Springer, vol. 32(1), pages 1-46, March.
    9. Heng-Qing Ye & Jihong Ou & Xue-Ming Yuan, 2005. "Stability of Data Networks: Stationary and Bursty Models," Operations Research, INFORMS, vol. 53(1), pages 107-125, February.
    10. Mailler, Cécile & Mörters, Peter & Ueltschi, Daniel, 2016. "Condensation and symmetry-breaking in the zero-range process with weak site disorder," Stochastic Processes and their Applications, Elsevier, vol. 126(11), pages 3283-3309.
    11. Hong Chen & Tan Wang & David D. Yao, 2021. "Financial Network and Systemic Risk—A Dynamic Model," Production and Operations Management, Production and Operations Management Society, vol. 30(8), pages 2441-2466, August.
    12. Shaler Stidham, 2002. "Analysis, Design, and Control of Queueing Systems," Operations Research, INFORMS, vol. 50(1), pages 197-216, February.
    13. Alexey Piunovskiy & Yi Zhang, 2011. "Accuracy of fluid approximations to controlled birth-and-death processes: absorbing case," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 73(2), pages 159-187, April.
    14. J. G. Dai & O. B. Jennings, 2004. "Stabilizing Queueing Networks with Setups," Mathematics of Operations Research, INFORMS, vol. 29(4), pages 891-922, November.
    15. Ward Whitt, 2001. "The Reflection Map with Discontinuities," Mathematics of Operations Research, INFORMS, vol. 26(3), pages 447-484, August.
    16. Jose Blanchet, 2013. "Optimal Sampling of Overflow Paths in Jackson Networks," Mathematics of Operations Research, INFORMS, vol. 38(4), pages 698-719, November.
    17. Landim, C., 2023. "Metastability from the large deviations point of view: A Γ-expansion of the level two large deviations rate functional of non-reversible finite-state Markov chains," Stochastic Processes and their Applications, Elsevier, vol. 165(C), pages 275-315.
    18. Anatolii A. Puhalskii & Alexander A. Vladimirov, 2007. "A Large Deviation Principle for Join the Shortest Queue," Mathematics of Operations Research, INFORMS, vol. 32(3), pages 700-710, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:spapps:v:179:y:2025:i:c:s0304414924002151. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.