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

Unknottedness of graphs of pairwise stable networks & network dynamics

Author

Listed:
  • Fixary, Julien

Abstract

We extend Bich–Fixary’s topological structure theorem about graphs of pairwise stable networks. Specifically, we show that certain graphs of pairwise stable networks are not only homeomorphic to their underlying space of societies but are, in fact, ambient isotopic to a trivial copy of this space. This result aligns with Demichelis–Germano’s unknottedness theorem and Predtetchinski’s unknottedness theorem. Furthermore, we introduce the notion of network dynamics which refers to families of vector fields on the set of weighted networks whose zeros correspond to pairwise stable networks. We leverage our version of the unknottedness theorem to demonstrate that most network dynamics can be continuously connected to one another without introducing additional zeros. Finally, we show that this result has a significant consequence on the indices of these network dynamics at any pairwise stable network — a concept that we connect to genericity using Bich–Fixary’s oddness theorem.

Suggested Citation

  • Fixary, Julien, 2025. "Unknottedness of graphs of pairwise stable networks & network dynamics," Journal of Mathematical Economics, Elsevier, vol. 120(C).
  • Handle: RePEc:eee:mateco:v:120:y:2025:i:c:s0304406825000722
    DOI: 10.1016/j.jmateco.2025.103155
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.jmateco.2025.103155?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:mateco:v:120:y:2025:i:c:s0304406825000722. 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/locate/jmateco .

    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.