Visualization tab

Visualization algorithms change the graphical appearance of the network; they are accesible via the visualization tab. Basic illustrations of how to layout networks or display attribute values are provided in the two trails on visualization and analysis and advanced attribute management.

visone distinguishes between three major visualization categories

• layout to recompute the positions (coordinates) or nodes, links-bends, or labels to optimize readability or other specified layout criteria;
• mapping to specify how attribute values (such as node centrality, tie strength, or class membership) are encoded in grapical variables (such as size, width, or color);
• geometry to apply geometric transformations such as rotation, reflection, or scaling to the network or parts of the network;

layout

Layout refers to the task of obtaining positions for the elements of a network visualization, where computing node positions is of primary interest. Other tasks are (re-)routing the links of a visualization, e.g. to avoid overlap between link and node representations, or to automatically arrange label positions for better readability.

node layout

The methods in this section deal with the computation of node positions for one or more networks. Generally, nodes are considered to be geometric points (or objects that are described by a single point), and links are represented as straight lines between their incident nodes. Thus, most methods produce so called straight-line drawings (also referred to as node-link diagrams or sociograms).

There are several general objectives that most methods try to optimize, such as:

• links should have more or less the same length.
• nodes should be distributed well over the drawing area.
• the number of meaningless link crossings should be kept small.
• structural symmetries in the network should be represented well.

Additionally, some methods are constrained by additional or different objectives:

• node placement is restricted with respect to a given scalar node attribute, e.g., such that nodes lie on concentric circles or verical layers corresponding to the attributes values.
• given a sequence of networks, the layout should ease comparison with respect to the layout of the previous network in the sequence.
• the layout should reveal specific structural properties.

stress minimization

Stress minimization, an instance of a family of dimension-reduction techniques referred to as multidimensional scaling (MDS), is our preferred method to obtain a general-purpose layout for networks. The main idea is to compute a layout such that graph-theoretic distances (i.e., shortest-path lengths) between nodes are represented as good as possible, where more weight is placed on representation error with respect to shorter distances than larger ones. The method usually meets the general criteria mentioned above, and yields better results than spring embedders in most cases.

Note that the outcome of stress minimization is dependent on the current layout of the network. We suggest to compute a metric MDS layout first to obtain good results. Also note that computing a layout via the quick layout button corresponds to this procedure, i.e., applying stress minimization to a metric MDS layout.

For more details on the options available in visone, see the concept page for stress minimization.

metric MDS

Metric MDS, also referred to as classical scaling is the original, spectral-decomposition variant of multidimensional scaling. As with stress minimization, the goal is to represent shortest-path distances as well as possible. In contrast to stress minimization all distances are treated equally. Thus, this approach generally yields good representation of large distance, but poor representation of shorter distances, affecting layout quality. However, since metric MDS produces a unique solution, it is suited well to serve as initialization for stress minimization.

See the metric MDS concept page for more technical details.

centrality layout

Centrality layout, like status layout is used to obtain a layout that represents values of a given numerical nodal attribute, e.g. a centrality index of nodes. Nodes with the same attribute value are arranged on concentric circles, where nodes with higher value are closer to the center, and nodes with lower value are in the periphery. At the same time, the algorithm tries to reduce link crossings as much as possible. Circumferences corresponding to regular intervals with respect to the attribute values are shown in the background of the visualization, to increase legibility of each node's corresponding value.

See the centrality layout concept page for details on available options.

status layout

Status layout, like centrality layout is used to obtain a layout that represents values of a given numerical nodal attribute, e.g. a centrality index of nodes. Nodes with the same attribute value are arranged on horizontal lines, where nodes with higher value are closer to the top, and nodes with lower value are closer to the bottom of the drawing. The algorithm tries to avoid link crossings. Note also, that bend-points for the links are introduced to increase readability. Optionally, the status niveaus (i.e., horizontal lines) corresponding to attribute values can be shown in the background of the visualization.

See the status layout concept page for more details.

dynamic layout

Dynamic layout refers to techniques for obtaining coherent positions of nodes for several networks, usually embodying a time-series of a network. The goal is to convey the evolution of the network, by easing comparison between a current layout and the preceeding one. In visone, three methods are currently offered to obtain a dynamic layout, all based on stress minimization. One approach calculates one single layout for an aggregate of all individual networks, and applies these positions, i.e., all nodes strictly maintain their position throughout the sequence. The other two approaches trade off this perfect stability for better readability of individual networks.

Note that dynamic layout can only be applied to network collections. Also, visone provides animation of the sequence via the icon in the toolbar.

See the dynamic layout concept page for more information on technical details and available options.

stress minimization (dyad attributes)

This method differs from standard stress minization in the choice of input distances. Usually, shortest-path distances are considered. Here, any numerical dyad attribute may be choosen as input. The method then tries to arrange nodes, such that those distances are matched as well as possible in the layout.

spring embedder

The spring embedder is the most commonly known general-purpose layout technique (however, we generally advise to use stress minimization due to better scaling and quality). The available method is an instance force-directed methods in which a network is likened to a physical system of repelling objects (the nodes) and springs of a given length (the links) binding adjacent nodes together. Nodes are iteratively repositioned based on the forces exerted on them, so that the system moves toward a force equilibrium.

See the spring embedder concept page for further details.

spectral layout

Spectral layout computes positions based on Eigenvectors of a networks adjacency matrix or the corresponding Laplacian.

See the spectral layout concept page for more details.

circular layout

Circular layout arranges nodes on one or more circles, based on the connectedness in the network.

See the circular layout concept page for details.

random layout

Random layout assigns a random position for each node.

link routing

Links are re-routed to avoid overlap between nodes and links, by introducing or moving bend-points of links.

See the link routing concept page for details on available options.

label placement

...

mapping

Methods in the mapping category are all used to map attribute values to visual attributes of the network diagram. Graphical attributes are [[#color|color], size, and labels. These are available for aboth nodes and links. Mappings only available for nodes are the mappings to the geometrical attributes coordinates, and the order in wich nodes are rendered.

geometry

affine transformations

...

procrustes analysis

...