IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v248y2026icp213-238.html

Mean-field dynamics of attractive resource interaction: From uniform to aggregated states

Author

Listed:
  • Satur, Oksana R.

Abstract

We introduce and study a nonlinear discrete dynamical system describing the evolution of a resource distribution among interacting agents. The model generalizes several classical mean-field and opinion-dynamics frameworks and is defined on the standard simplex, where each coordinate evolves according to an interaction rule depending on preference-based mean-field interactions. We provide a complete analytical description of the long-term behavior of the system. First, we establish monotonicity properties and show that the dynamics always remains in a positively invariant region determined by initial conditions. We prove the existence of a unique fixed point for any admissible parameter set and derive an explicit closed-form formula for the equilibrium in arbitrary dimension. We then analyze the local stability of the fixed point and identify parameter regimes leading to aggregation or uniform distributions. Finally, we characterize all possible asymptotic scenarios and show that, despite the nonlinear structure, the system does not exhibit oscillatory or chaotic behavior: every trajectory converges to the unique equilibrium. The results provide a full qualitative theory for this class of monotone resource-interaction models and offer a mathematical explanation for the transition from uniform to aggregated states.

Suggested Citation

  • Satur, Oksana R., 2026. "Mean-field dynamics of attractive resource interaction: From uniform to aggregated states," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 248(C), pages 213-238.
  • Handle: RePEc:eee:matcom:v:248:y:2026:i:c:p:213-238
    DOI: 10.1016/j.matcom.2026.04.022
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.matcom.2026.04.022?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:matcom:v:248:y:2026:i:c:p:213-238. 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.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.