1. Lecture 12: Network Visualization Slides are modified from Lada Adamic, Adam Perer, Ben Shneiderman, and Aleks Aris

2. Outline What is a network? How do you analyze networks today? What are the challenges? How to integrate with other methods?

3. What are networks? Networks are collections of points joined by lines.  “Network” ≡ “Graph” pointslines verticesedges, arcsmath nodeslinkscomputer science sitesbondsphysics actorsties, relationssociology  node  edge 3

4. Network elements: edges Directed (also called arcs) A -> B A likes B, A gave a gift to B, A is B’s child Undirected A B or A – B A and B like each other A and B are siblings A and B are co-authors Edge attributes weight (e.g. frequency of communication) ranking (best friend, second best friend…) type (friend, relative, co-worker) properties depending on the structure of the rest of the graph: e.g. betweenness 4

5. Planar graphs A graph is planar if it can be drawn on a plane without any edges crossing

6. #s of planar graphs of different sizes 1:1 2:2 3:4 4:11 Every planar graph has a straight line embedding

7. Trees Trees are undirected graphs that contain no cycles

8. Cliques and complete graphs K n is the complete graph (clique) with K vertices each vertex is connected to every other vertex there are n*(n-1)/2 undirected edges K5K5 K8K8 K3K3

9. Outline What is a network? How do you analyze networks today? What are the challenges? How to integrate with other methods?

10. Why Visualization? Use the eye for pattern recognition; people are good at scanning recognizing remembering images Graphical elements facilitate comparisons via length shape orientation texture Animation shows changes across time Color helps make distinctions Aesthetics make the process appealing http://amaznode.fladdict.net/ http://www.touchgraph.com/TGAmazonBrowser.html

11. Graph Drawing Aesthetics Minimize edge crossings Draw links as straight as possible Maximize minimum angle Maximize symmetry Minimize longest link Minimize drawing area Centralize high-degree nodes Distribute nodes evenly Maximize convexity (of polygons) Keep multi-link paths as straight as possible … Source: Davidson & Harel

12. Node Placement Methods Node-link diagrams Force-directed Geographical maps Circular layouts One or multiple concentric Temporal layouts Clustering Semantic Substrates

13. Force-directed Layout Also known as: Spring Spreads nodes Minimizes chance of node occlusion

14. Geographical Map Familiar location of nodes

15. Circular Layouts (1 circle) Ex: Schemaball Database schema Tables connected via foreign keys

16. Circular Layouts (concentric) Radial Tree Viewer

17. Circular (concentric) & Temporal Hudson Bay Food Web

18. Temporal Layout

19. Clustering

20. Hierarchical Clustering

21. Semantic Substrates Group nodes into regions According to an attribute Categorical, ordinal, or binned numerical In each region: Place nodes according to other attribute(s)

22. Force-directed >30% Familiar Layout ~30% Circular Layout ~15% Node layout strategy First 100 in visualcomplexity.com Statistics on Strategies

23. Outline What is a network? How do you analyze networks today? What are the challenges? How to integrate with other methods? http://graphexploration.cond.org/index.html

24. Challenges of Network Visualization Basic networks: nodes and links Node labels e.g. article title, book author, animal name Link labels e.g. Strength of connection, type of link Directed networks Node attributes Categorical (e.g. mammal/reptile/bird/fish/insect) Ordinal(e.g. small/medium/large) Numerical (e.g. age/weight) Link Attributes Categorical (e.g. car/train/boat/plane) Ordinal(e.g. weak/normal/strong) Numerical (e.g. probability/length/time to traverse/strength)

25. C1) Basic Networks (nodes & links) Power Law Graph 5000 nodes Uniformly distributed

26. C1) Basic Networks (continued) Social friendship network 3 degrees from Heer 47,471 people 432,430 relations

27. C2) Node Labels Adding labels Nodes overlap with other nodes Nodes overlap with links 250 nodes

28. C3) Link Labels Challenges: Length Space Belongingness Distinction from other labels & other types of labels

29. C4) Directed Networks Direction arrows labels Thickness color SeeNet, Becker et al.

30. C5 & C6) Node & Link Attributes Types: Categorical (e.g. mammal/reptile/bird/fish/insect) Ordinal(e.g. small/medium/large) Numerical (e.g. age/weight) Value of node attribute indicated by node shape Value of link attribute indicated by a letter

31. C1 ~12% C4 ~10% C2 ~66% Challenges First 100 in visualcomplexity.com Statistics on Challenges C5 ~10% C6 ~2% C1) Basic networks C2) Node labels C3) Link labels C4) Directed networks C5) Node attributes C6) Link attributes

32. Outline What is a network? How do you analyze networks today? What are the challenges? How to integrate with other methods?

33. Integrating with other methods  Social network analysis is inherently complex  Analysts must understand every node's attributes as well as relationships between nodes.  The visualizations are helpful but too messy and incomprehensible when data is huge. Statistics are used to detect important individuals, relationships, and clusters, Integrate this with Network visualization in which users can easily and dynamically filter nodes and edges. “Integrating Statistics and Visualization” by Adam Perer, Ben Shneiderman

34. Overview the network both statistically and visually  Present just sense of the structure, clusters and depth of a network  Present some statistics to provide a way to both confirm and quantify the visual findings

35.  Issues: Panning and zooming naively is not enough Zooming into sections of the network force users to lose the global structure.  Solution Allow user-controlled Statistics to drive the navigation Filter and Zoom to gain deeper insights

36.  Users can select a node to see all of its attributes.  What do we achieve? – “the ability to see each node and follow its edges to all other nodes. Details on Demand

37. Outline What is a network? How do you analyze networks today? What are the challenges? How to integrate with other methods?