CS6010 - Social Networks Analysis
CS6010 - Social Networks Analysis
Network
REGULATION -2013
This drawing should not be confused with the graph itself: very different layouts can
correspond to the same graph.In the abstract, all that matters is which pairs of vertices
are connected by edges.
In the concrete, however, the arrangement of these vertices and edges within a drawing
affects its understandability, usability, fabrication cost, and aesthetics.
The problem gets worse, if the graph changes over time by adding and deleting edges
(dynamic graph drawing) and the goal is to preserve the user's mental map.
9. Write short notes on node-edge diagrams.
A node-edge diagram is an intuitive way to visualize social networks. With the nodeedge visualization, many network analysis tasks, such as component size calculation, centrality
analysis, and pattern sketching, can be better presented in a more straightforward manner.
Many node-edge layouts have been presented to place the nodes in the graph for users to
clearly recognize the structure of the social network.
10. List the three kinds of layouts.
random layout,
force-directed layout,
Tree layout
11. Illustrate random layouts with an example.
A random layout is to put the nodes at random geometric locations in the graph, and
thus it may not yield very clear visualization results, particularly when the number of nodes
immensely increases, e.g. more than thousands of nodes.
However, since a random layout algorithm can efficiently draw the social network graph
in linear time, O(N), sometimes it can be usable to visualize very large network graphs.
12. Explain tree layout with an example.
A basic tree layout is to choose a node as the root of tree, and the nodes connected to
the root become children of the root node. Nodes that are at more levels away from the root
become the grand-children of the root and so on. For a better visual presentation of domain
specific information, more suitable variants of the tree layout were proposed, such as
hyperbolic tree layout and a radial tree layout.
13. Mention the three kinds of tree layouts for social network visualization.
hyperbolic tree layout
radial tree layout.
H3 tree layout
14. Explain node-link diagrams.
The principle of node-link diagrams is to graphically represent actors of the network by
nodes and connections by links.
CS6010- SOCIAL NETWORK ANALYSIS
REGULATION -2013
Node-link diagrams are the most commonly used representation of graphs and networks. It is
well illustrated by Freeman in his survey and history of social network visualization.
15. Write notes on property-based layouts.
Property-based Layouts. The simplest layout of a social network assigns the value of a node
property as a location in a coordinate system. This layout is simple to compute and helps
discover patterns in the distribution of that property along the network, but it may obscure its
global structure
16. Define Force-directed and Energy-based layouts.
A force-directed layout draws analogies from a physical structure of rods and springs
connecting spheres with the links and nodes in a network. Forces are designed to satisfy lowlevel properties that guarantee minimal overlap of nodes and proximity of related nodes.
17. What are the advantages and disadvantages of force-directed layouts?
Advantages:
Forces are designed to satisfy low-level properties that guarantee minimal overlap of
nodes and proximity of related nodes.
For example, attractive forces are often defined between any pair of connected nodes,
while repulsive forces are defined between all pairs of nodes.
The equilibrium state of such a system of forces results in the optimal placement of
nodes under that definition.
Disadvantages:
On one hand, they are expensive to compute, since the time to compute grows cubically
with the number of nodes in the network.
This makes them impractical even for simple real-life social networks, in the order of
only thousands of nodes.
On the other hand, maybe more critically, a force directed layout often results in a
hairball for most moderately sized networks, due to the power law distribution.
Brandes and Pich presented an experimental study that shows that multidimensional
scaling approaches to graph layout can satisfy aesthetic properties better than forcedirected placement
18. Write notes on spectral layouts.
This type of algorithms are based on spectral algebra on key matrices that can be
extracted from the social structure. It was shown that the eigenvectors of certain matrices can
be used as lower dimensional, typically2D, embeddings of the graph. The most widely
application of this technique uses the eigenvectors of the adjacency matrix. In other cases, the
eigenvectors of the Laplacian matrix are used as the embedding coordinates
19. Write notes on matrix-oriented techniques.
social network graph consists of nodes connected with edges, it can be transformed into
a simple Boolean matrix whose rows and columns represent the vertices of the graph.
Moreover, the Boolean values in the matrix can be further replaced with valued
attributes associated with the edges to provide more informative network visualizations.
REGULATION -2013
Since a matrix presentation can help minimize the occlusion problems caused by the
node-edge diagram, the matrix-based representation of graphs offers an alternative to
the traditional node-edge diagrams.
REGULATION -2013
REGULATION -2013