IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-030-24455-2_15.html
   My bibliography  Save this book chapter

Forecasting Procedure Based on Full Information

In: Multilevel Strategic Interaction Game Models for Complex Networks

Author

Listed:
  • Duccio Piovani

    (nam.R, Head of Data Science)

  • Jelena Grujić

    (Artificial Intelligence Laboratory, Vrije Universiteit Brussel, Department of Computer Science, Sciences and Bioengineering Sciences
    Machine Learning Group, Université Libre de Bruxelles, Computer Science Department, Faculty of Science)

  • Henrik J. Jensen

    (Imperial College London, Department of Mathematics and Centre for Complexity Science)

Abstract

In this chapter we will look at the results obtained when trying to forecast the arrival of transitions exploiting the theory introduced in the previous section. This procedure requires full knowledge on the system, and in order to apply it one needs to know both the full structure of the network and the weights of each link. Despite being unrealistic and of difficult application, this procedure was thought as a necessary first test of the general validity of forecasting method. We will start with a general outline of the method, and then show the results of its application to the two models.

Suggested Citation

  • Duccio Piovani & Jelena Grujić & Henrik J. Jensen, 2019. "Forecasting Procedure Based on Full Information," Springer Books, in: Eitan Altman & Konstantin Avrachenkov & Francesco De Pellegrini & Rachid El-Azouzi & Huijuan Wang (ed.), Multilevel Strategic Interaction Game Models for Complex Networks, chapter 0, pages 285-298, Springer.
    • Handle: RePEc:spr:sprchp:978-3-030-24455-2_15
    DOI: 10.1007/978-3-030-24455-2_15
    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
    for a similarly titled item that would be available.

    More about this item

    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:spr:sprchp:978-3-030-24455-2_15. 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.