Master Data Science

2018-2019

EXAM
Part Social Networks

(45 minutes)

Question 1. Let us consider the following graph G defined by the list of its edges : {1, 2},
{1, 3}, {1, 6}, {2, 4}, {3, 5}, {3, 8}, {4, 5}, {4, 6}, {5, 7}, {6, 7}, {6, 11}, {7, 10}, {8, 9}, {9, 10}, {10,
11}
1.1. Prove that the graph G is planar and define its face number.
1.2. Why is the face number an important measure in graph drawing ?

Question 2. Give the definition of the following network families :

2.1. Scale-free network
2.2. Small world network

Question 3.
3.1. Recall the definition of the preferential attachment
32. Describe the main principle to generate a scale-free network with a preferential attachment

Question 4.
4.1. Recall the main steps of a force-directed algorithm
4.2. What is its strength and its weakness ?

Question 5
Let us consider a set X of n individuals and a dissimilarity d defined on XxX which measures
the proximities between the individuals. The objective is to represent the individuals into a 2-
geometrical space in such a way that the proximities are preserved. Precisely define the
associated mathematical problem.