IDEAS home Printed from https://ideas.repec.org/p/hal/cesptp/halshs-03531802.html
   My bibliography  Save this paper

Unknottedness of the Graph of Pairwise Stable Networks & Network Dynamics

Author

Listed:
  • Julien Fixary

    (UP1 - Université Paris 1 Panthéon-Sorbonne, CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique)

Abstract

We extend Bich-Fixary's theorem ([2]) about the topological structure of the graph of pairwise stable networks. Namely, we show that the graph of pairwise stable networks is not only homeomorphic to the space of societies, but that it is ambient isotopic to a trivial copy of this space (a result in the line of Demichelis-Germano's unknottedness theorem ([7])). Furthermore, we introduce the notion of (extended) network dynamics which refers to families of vector fields on the set of weighted networks whose zeros correspond to pairwise stable networks. We use our version of the unknottedness theorem to show that most of network dynamics can be continuously connected to each other, without adding additional zeros. Finally, we prove that this result has an important consequence on the indices of these network dynamics at any pairwise stable network, a concept that we link to genericity using Bich-Fixary's oddness theorem ([2]).

Suggested Citation

  • Julien Fixary, 2022. "Unknottedness of the Graph of Pairwise Stable Networks & Network Dynamics," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-03531802, HAL.
  • Handle: RePEc:hal:cesptp:halshs-03531802
    Note: View the original document on HAL open archive server: https://shs.hal.science/halshs-03531802
    as

    Download full text from publisher

    File URL: https://shs.hal.science/halshs-03531802/document
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Pairwise Stability; Unknottedness Theorem; Network Dynamics; Genericity;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:hal:cesptp:halshs-03531802. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.