Tracking Global Challenges with HPC, HPDA and Simulations
This course was part of the HiDALGO Online workshop on “Tackling Global challenges with HPC, HPDA and simulations” (7th-9th July 2021). This course has been done by Bernhard Geiger (Know-Center Graz, Austria)
In this short tutorial, we introduce the concept of a network (or graph) in its most common incarnations. We will discuss graph properties on a micro-level (e.g., node properties such as degree and centrality), meso-level (e.g., concepts such as clique or a community), and macro-level (such as graph diameter and assortativity). All these concepts will be illustrated with practical examples. In the hands-on part of this tutorial, the participants get the chance to construct graph objects from raw data, visualize such graph objects, and compute graph properties using existing libraries. Thus, at the end of the tutorial the participants have obtained:
- a basic understanding of the concept of a graph,
- knowledge of available quantitative measures for network analysis,
- capabilities to visualize graphs,
- capabilities to transform a graph into equivalent representations and vice versa, as well as
- a basic understanding of Python libraries for network analysis.
Prerequisites for this tutorial include basic maths skills and, for the hands-on part, basic programming skills in Python and the ability to execute a provided Jupyter Notebook.