IDEAS home Printed from https://ideas.repec.org/h/spr/lnechp/978-3-319-00912-4_19.html
   My bibliography  Save this book chapter

Least Susceptible Networks to Systemic Risk

In: Artificial Economics and Self Organization

Author

Listed:
  • Ryota Zamami

    (National Defense Academy of Japan)

  • Hiroshi Sato

    (National Defense Academy of Japan)

  • Akira Namatame

    (National Defense Academy of Japan)

Abstract

There is empirical evidence that as the connectivity of a network increases, there is an increase in the network performance, but at the same time, there is an increase in the chance of risk contagion which is extremely large. If external shocks or excess loads at some agents are propagated to the other connected agents due to failure, the domino effects often come with disastrous consequences. In this paper, we design the least susceptible network to systemic risk. We consider the threshold-based cascade model, proposed by Watts [13]. We propose the network design model in which the associated adjacency matrix has the largest maximum eigenvalue. The topology of such a network is characterized as a core-periphery structures that consists of a partial complete graph of hub nodes and stub nodes that are connected to one of the hub nodes. The introduced network can reduce the turbulence of shocks triggered and prevent the spread of systemic risk. By both mathematical analysis and agent-based simulations, we show that the slightly differences of the structure of network causes systemic risk.

Suggested Citation

  • Ryota Zamami & Hiroshi Sato & Akira Namatame, 2014. "Least Susceptible Networks to Systemic Risk," Lecture Notes in Economics and Mathematical Systems, in: Stephan Leitner & Friederike Wall (ed.), Artificial Economics and Self Organization, edition 127, pages 245-256, Springer.
    • Handle: RePEc:spr:lnechp:978-3-319-00912-4_19
    DOI: 10.1007/978-3-319-00912-4_19
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:lnechp:978-3-319-00912-4_19. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.