IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v70y2022i6p3386-3402.html
   My bibliography  Save this article

A Probabilistic Approach to Growth Networks

Author

Listed:
  • Predrag Jelenković

    (Department of Electrical Engineering, Columbia University, New York, New York 10027)

  • Jané Kondev

    (Martin A. Fisher School of Physics, Brandeis University, Waltham, Massachusetts 02453)

  • Lishibanya Mohapatra

    (School of Physics and Astronomy, College of Science, Rochester Institute of Technology, Rochester, New York 14623)

  • Petar Momčilović

    (Department of Industrial and Systems Engineering, Texas A&M University, College Station, Texas 77843)

Abstract

Widely used closed product-form networks have emerged recently as a primary model of stochastic growth of subcellular structures, for example, cellular filaments. The baseline bio-molecular model is equivalent to a single-class closed queueing network, consisting of single-server and infinite-server queues. Although this model admits a seemingly tractable product-form solution, explicit analytical characterization of its partition function is difficult due to the large-scale nature of bio-molecular networks. To this end, we develop a novel methodology, based on a probabilistic representation of product-form solutions and large-deviations concentration inequalities, which identifies distinct operating regimes and yields explicit expressions for the marginal distributions of queue lengths. The parameters of the derived distributions can be computed from equations involving large-deviations rate functions, often admitting closed-form algebraic expressions. From a methodological perspective, a fundamental feature of our approach is that it provides exact results for order-one probabilities, even though our analysis involves large-deviations rate functions, which characterize only vanishing probabilities on a logarithmic scale.

Suggested Citation

  • Predrag Jelenković & Jané Kondev & Lishibanya Mohapatra & Petar Momčilović, 2022. "A Probabilistic Approach to Growth Networks," Operations Research, INFORMS, vol. 70(6), pages 3386-3402, November.
  • Handle: RePEc:inm:oropre:v:70:y:2022:i:6:p:3386-3402
    DOI: 10.1287/opre.2021.2195
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2021.2195
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2021.2195?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
    ---><---

    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:inm:oropre:v:70:y:2022:i:6:p:3386-3402. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.