IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v199y2026ics0304414926001006.html

Fixation of leadership in non-Markovian growth processes

Author

Listed:
  • Iyer, T.

Abstract

Consider a model where N equal agents possess ‘values’, belonging to N0, that are subject to incremental growth over time. More precisely, the values of the agents are represented by N independent, increasing N0 valued processes with random, independent waiting times between jumps. We show that the event that a single agent possesses the maximum value for all sufficiently large times (called ‘leadership’) occurs with probability zero or one, and provide necessary and sufficient conditions for this to occur. Under mild conditions we also provide criteria for a single agent to become the unique agent of maximum value for all sufficiently large times, and also conditions for the emergence of a unique agent having value that tends to infinity before ‘explosion’ occurs (i.e. conditions for ‘strict leadership’ or ‘monopoly’ to occur almost surely). The novelty of this model lies in allowing non-exponentially distributed waiting times between jumps in value. In the particular case when waiting times are mixtures of exponential distributions, we improve a well-established result on the ‘balls in bins’ model with feedback, removing the requirement that the feedback function be bounded from below and also allowing random feedback functions. As part of the proofs we derive necessary and sufficient conditions for the distribution of a convergent series of independent random variables to have an atom on the real line, a result which we believe may be of interest in its own right.

Suggested Citation

  • Iyer, T., 2026. "Fixation of leadership in non-Markovian growth processes," Stochastic Processes and their Applications, Elsevier, vol. 199(C).
  • Handle: RePEc:eee:spapps:v:199:y:2026:i:c:s0304414926001006
    DOI: 10.1016/j.spa.2026.104968
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304414926001006
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.spa.2026.104968?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:199:y:2026:i:c:s0304414926001006. 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: 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.