Forecasting Procedure Based on Full Information

Duccio Piovani, Jelena Grujić and Henrik J. Jensen ()
Additional contact information
Duccio Piovani: nam.R, Head of Data Science
Jelena Grujić: Artificial Intelligence Laboratory, Vrije Universiteit Brussel, Department of Computer Science, Sciences and Bioengineering Sciences
Henrik J. Jensen: Imperial College London, Department of Mathematics and Centre for Complexity Science

Chapter Chapter 15 in Multilevel Strategic Interaction Game Models for Complex Networks, 2019, pp 285-298 from Springer

Abstract: 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.

Date: 2019
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-030-24455-2_15

Ordering information: This item can be ordered from
http://www.springer.com/9783030244552

DOI: 10.1007/978-3-030-24455-2_15

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().