Complex Systems Summer School 2016-Tutorials
From Santa Fe Institute Events Wiki
Date & Time:
Motivation and content:
NetLogo Introduction, Monday June 20
Speaker: Abigail Devereaux
Date & Time: Monday, June 20 from 6:00p - 6:50p
Motivation and content: I will walk through the code for the Schelling Segregation model in Netlogo, first on a grid, then on a network. This tutorial is meant for people who want to learn NetLogo. I suggest before we start that you download Netlogo and go through the tutorial here: []
- Chris Revell
Decomposition of Games
Speaker: Santiago Guisasola
Date & Time: TBD
Motivation and content: I will present a method of decomposing n-player 2-strategy games into several components. One of these components, the "strategic" component, contains all needed information to compute Nash Equilibria. So... what are the other components good for?
Introduction to Git
Date & Time: Tuesday, June 21, 8 - 9PM, in a location to be announced later.
Motivation and content: As your model evolves, the source code becomes increasingly more complex and difficult to maintain. Git takes care of this workload by recording every change to your project files, allowing you to review your development history, helping you to try and experiment new model features in a safe way, tracking your model variants and versions, and implementing collaboration with your co-researchers. This tutorial will cover the basics of: commits, branches, merging, versioning, and collaboration. GitHub and GitLab will be discussed.
Suggestions: You should have basic experience using text terminals. Please install Git in your own laptop and make sure to bring it to the tutorial. Also, please open a free account on gitlab.com before joining the tutorial. Optionally, you can also open a free github account. Please contact email@example.com with any inquiries.
Please sign up and contact firstname.lastname@example.org
Structural pattern discovery in spatio-temporal data
Date & Time: TBD
Motivation and content: The problem of informative pattern discovery in time series traditionally receives much attention. Discovering patterns is important in areas as diverse as medicine, security, astronomy, industry, sciences, and finance, to name just a few, where patterns typically convey critical and actionable information.
In this hands-on tutorial, I review three symbolic discretization-based techniques for time-series patterns discovery: (i) SAX-VSM -- an algorithm for discovery of class-characteristic patterns in contrast time series sets, (ii) GrammarViz -- a grammatical inference-based technique for variable-length time series motif (i.e., frequent pattern) discovery, and (iii) RRA -- a grammatical inference and algorithmic (i.e., Kolmogorov) complexity -based algorithm for variable-length time series discord (i.e., anomaly) discovery. In addition, I discuss our recent effort for discretization parameters optimization.
All discussed techniques are implemented in Java (high-throughput) and R (convenience) and I show how to use these in experimental/exploratory settings.
1) SAX-VSM: Interpretable Time Series Classification Using SAX and Vector Space Model
2) GrammarViz 2.0: a tool for grammar-based pattern discovery in time series
3) Time series anomaly discovery with grammar-based compression