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

Multistability and global attractivity for fractional-order spiking neural networks

Author

Listed:
  • Zhang, Shuo
  • Liu, Lu
  • Wang, Chunhua
  • Zhang, Xiaomeng
  • Ma, Rong

Abstract

Fractional-Order Spiking Neural Network (FOSNN) has the characteristic of infinite memory and neural impulses, which can more accurately describe neural network systems and demonstrate higher precision data processing capabilities in artificial intelligence. The neural spiking leads to multiple equilibrium points coexisting in the networks system. Multistability analysis mainly studies the problem of the multiple equilibrium points, which helps to improve the robustness and reliability of the networks. However, fractional calculus and neural spiking increase the theoretical difficulty of multistability and attractivity analysis in neural networks, which is the main motivation to study and discuss. Firstly, for a Hopfield type of FOSNN with pulse activation functions, the solution existence is proved according to Filippov solutions. Secondly, the state space is divided and the sufficient conditions for multistability are proposed and proved by using fixed point theorem, Laplace transform, Mittag-Leffler function monotonicity analysis, etc. Furthermore, the boundedness and global attractivity of FOSNN are discussed based on fractional-order Lyapunov method. Finally, using the fractional-order prediction correction algorithm, some numerical examples are conducted in order to verify the correctness for all proposed results.

Suggested Citation

  • Zhang, Shuo & Liu, Lu & Wang, Chunhua & Zhang, Xiaomeng & Ma, Rong, 2026. "Multistability and global attractivity for fractional-order spiking neural networks," Applied Mathematics and Computation, Elsevier, vol. 508(C).
  • Handle: RePEc:eee:apmaco:v:508:y:2026:i:c:s0096300325003431
    DOI: 10.1016/j.amc.2025.129617
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.amc.2025.129617?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:apmaco:v:508:y:2026:i:c:s0096300325003431. 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: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.