This event is about interacting with the community. We share our latest updates, give insights for new users and also offer two workshops: one for beginners and one for advanced users. If you want to attend one or more workshops, better be prepared with a notebook and a modern webbrowser (although it is only for convenience, not a requirement). We also intend to discuss future development directions and receive feedback on the current status of NetworKit.

Preliminary program (all times in CET)

• 1:00pm - 1:20pm : Welcome and introduction (Henning Meyerhenke, HU Berlin)
• 1:20pm - 1:30pm : History and Numbers (Fabian Brandt-Tumescheit, HU Berlin)
• 1:30pm - 2:10pm : Scientific Talk: "Robustness of Complex Networks" (Rob Kooij, Tu Delft)
• Abstract: Network Science aims to understand the graph structure of networks and the dynamic processes that take place on networks. Examples of processes on networks are transport of items (IP packets with digitalized information, cars, containers) and diffusion (epidemics, electric current, water flows, human emotions). The Network Architectures and Services Section at the Delft University of Technology contributes to the fundaments of Network Science: we investigate amongst others geometric representations of networks, epidemic spread on networks, spectra of graphs and network algorithms. In addition, we apply our mathematical knowledge to the design, management and control of critical infrastructures, such as telecom networks and power grids, in order to make these networks robust, resilient, efficient and reliable. In this talk we will give two examples of our results in the field of robustness of complex networks, namely robustness of network controllability and cascading failures in power grids.

COFFEE BREAK

• 2:30pm - 2:40pm : What is new in NetworKit? (Fabian Brandt-Tumescheit, HU Berlin)
• 2:40pm - 3:10pm : Workshop I: Introduction for Beginners (Eugenio Angriman, HU Berlin)
• 3:10pm - 3:40pm : Workshop II: Advanced Users (Alexander van der Grinten, HU Berlin)

COFFEE BREAK

• 4:00pm - 4:50pm : Community Panel - Discussion and Outlook (moderated by Henning Meyerhenke)
• 4:50pm - 5:00pm : Wrap Up (Henning Meyerhenke)

Overview

The goal of this day is to both present NetworKit to people who don’t know it yet and to update more seasoned users and developers about the new features, which have grown quite a bit over the last years. Also, in this meeting we wish to discuss future development directions and receive feedback on the current status of NetworKit.

Preliminary program (all times in CEST)

• 11:30am - 11:45am : Welcome and introduction (Henning Meyerhenke, HU Berlin)
• 11:45am - 12:15pm : Tutorial for new users (Eugenio Angriman, HU Berlin)
• Presentation Slides
• Notebooks + Resources
• 12:15pm - 12:45pm : Scientific Talk: "Integrating NetworKit into a web-based Environment for Network Analysis and Exploration" (Jörn Kreutel, Beuth Hochschule für Technik Berlin)
• Presentation Slides
• Abstract: The talk will present a web based platform for network analysis in the digital humanities that is being developed as a work in progress and uses NetworKit as its core analysis engine. The architecture of the platform will be outlined, and we will demonstrate some exploration functions that enhance networks with additional data related to its constituting entities.

LUNCH BREAK

• 1:30pm - 2:00pm : Scientific Talk: "On Mining Distances out of Massive Time-Evolving Graphs" (Mattia D'Emidio, University of L’Aquila, Italy)
• Presentation Slides
• Abstract: Computing shortest-path distances is a fundamental primitive in the context of graph mining, since this kind of information is essential to a broad range of prominent application domains, including among others network analysis, data routing, web search optimization, and route planning.
  
  Textbook approaches for shortest paths (e.g. executing Dijkstra’s algorithm or precomputing a distance matrix) do not scale well with the graph’ size, as they either take seconds to answer a single query on the distance or have a huge memory footprint, when the graph has millions of vertices/arcs. Therefore, to achieve faster query answering and affordable space requirements, smarter and more scalable methods have been designed, the most practical of them being based on a compact representation of the transitive closure of the input graph, called the 2-hop-cover labeling. This talk surveys the main characteristics of such methods, along with some recent algorithms that have been introduced to allow the usage of the 2-hop-cover technique in time-evolving scenarios, i.e. the realistic case when the managed graph undergoes topological modifications over time. We discuss empirical evidences, obtained by experimental evaluations on both real-world and synthetic inputs, that suggest that 2-hop-cover based algorithmic frameworks represent the most promising step forward towards an effective solution for mining distances in general, massive, time-evolving graphs. Most results presented in this talk, as well as most results concerning shortest-path queries in massive complex networks, are of experimental nature and have been achieved also thanks to the recent development of effective toolkits for large-scale graph processing, such as NetworKit. Only a few works with worst-case guarantees are known, and only for special cases (e.g. restrictions on the input): this represents a major open problem that deserves further investigation.
• 2:00pm - 2:25pm : Overview Talk: New in NetworKit under the hood (Fabian Brandt-Tumescheit, HU Berlin)
• Presentation Slides

COFFEE BREAK

• 2:40pm - 3:10pm : Overview Talk: New algorithms in NetworKit (Alexander van der Grinten, HU Berlin)
• Presentation Slides
• 3:10pm - 3:50pm : Discussion (moderated by Henning Meyerhenke)
• 3:50pm - 4:00pm : Wrap-up (Henning Meyerhenke)

Overview

We are happy to announce the first NetworKit Day, which will be held on September 12, 2017 at the Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany. The goal of this day is to both present NetworKit to people who don’t know it yet and to update more seasoned users and developers about the current features, which have grown quite a bit over the last years. Also, in this meeting we wish to discuss future development directions and receive feedback on the current status of NetworKit. If you would like to attend or receive further information, feel free to send an e-mail to Elisabetta Bergamini.

The meeting will take place in Room 301, Building 50.34 (Computer Science Department), Am Fasanengarten 5, 76131 Karlsruhe. Here you can find a map of the campus.

Preliminary program

• 10:30am : Welcome and opening remarks
• 10:40am : NetworKit overview talk
• 11:00am : Tutorial + Demo
• 12:15pm : Lunch
• 2:00pm - 2:25pm : Overview Talk: New in NetworKit under the hood (Fabian Brandt-Tumescheit, HU Berlin)
• 1:30pm : Scientific talk 1 (by Michael Hamann)
• 1:50pm : Scientific talk 2 (by Oskar Taubert)
• 2:10pm : What's new in NetworKit?
• 2:50pm : Coffee break
• 3:15pm : Discussion of future directions for NetworKit
• 4:15pm : Concluding remarks
• 4:30pm : End