The first theme to discuss will be the basics of installing and running Gephi, and inputting data. We introduce the edgelist data format for dyadic data, and the standards of entering node labels and attributes. We also discuss the possibilities of generating random network data in Gephi.
The second theme will be about the core skill of networks visualization: selecting, tuning, and evaluating graph layouts. We will discuss several layout approaches, such as circle and concentric layouts, spring embedders, attribute based layouts. We will also discuss options and considerations for static publishing: publishing graphs for balk and white journal manuscripts, power point presentations, posters.
The third theme is about filterings: ways to select nodes and edges to display. We will discuss related measures that one can use for filtering, such as centrality measures, edge betweenness, components, attributes and attribute combinations. We discuss single and multiple filters, and the significance of nested filters.
The fourth theme will be about the practical challenges of working with large graphs. We discuss considerations for choosing layout algorithms for large graphs, ways to collapse, filter and simplify large graphs. We introduce the method of density heatmaps.
The fifth theme is about online publishing, and generating interactive visualizations of graphs. We discuss settings and considerations for java script based interactive formats.