0% found this document useful (0 votes)
92 views2 pages

Solution - 4

This document contains 10 multiple choice questions about social networks. It covers topics like: 1. Triadic closure and focal closure in network formation. 2. Calculating similarity measures based on common friends or work. 3. Properties of bipartite and complete affiliation networks. 4. Measuring homophily and heterogeneity in network connections. 5. Calculating probabilities of link formation based on common connections.

Uploaded by

manish de
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
92 views2 pages

Solution - 4

This document contains 10 multiple choice questions about social networks. It covers topics like: 1. Triadic closure and focal closure in network formation. 2. Calculating similarity measures based on common friends or work. 3. Properties of bipartite and complete affiliation networks. 4. Measuring homophily and heterogeneity in network connections. 5. Calculating probabilities of link formation based on common connections.

Uploaded by

manish de
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

SOCIAL NETWORKS NPTEL - JULY 2023

4 Week 4
1. Two people meet at a Health Club and then became friends with each other this represents

(a) Triadic Closure


(b) Membership closure
(c) Focal closure
(d) selection closure

Answer: (c)
2. Similarity measure can be defined as

(a) Total number of work done by number of work in common


(b) Number of work they do in common by Total Number of work done by both
(c) Total number of friends by number of friends in common
(d) Number of friends in common by Total Number of friends

Answer: (b)
3. Social affiliation network is

(a) Complete and bipartite


(b) Complete and not bipartite
(c) Bipartite and not Complete
(d) Neither complete nor Bipartite

Answer: (c)
4. In general, when we calculate the value for homophily it represents value between 0 to 1, what value will we
get if it shows heterogeneity?

(a) 0
(b) 1
(c) < 1
(d) > 1

Answer: (c)
5. It is the tendency in which people make friends with similar interests i.e people select other people having
similar habits or interests.

(a) Homophily
(b) Heterogeneity
(c) Social Influence
(d) Selection

Answer: (a)
6. If suppose A and B have 10 friends in common, and there is scenario that each common friend gives A and B
an independent probability of 0.08 of forming a link. What is the probability that there exist a link between
A and B?

(a) 1 − (0.92)10
(b) 1 − (0.08)10
(c) 0.9210
(d) 0.0810

10
SOCIAL NETWORKS NPTEL - JULY 2023

Answer: (a)
Solution:
Applying formula, 1 − (1 − p)n

7. Given a complete graph with 10 vertices the total number of possible triangle for the given graph will be

(a) 10000
(b) 30
(c) 300
(d) 120

Answer: (d)
Solution: (n ∗ (n − 1) ∗ (n − 2))/6
8. Which situation doesn’t occur when homophily in a network of 2 Classes is greater than 0.5?

(a) Across edges are low in proportion


(b) People tend to make friends within their group
(c) The probability of selecting across edge is low
(d) People make friends outside the group

Answer: (d)
9. Which phenomenon is represented in region A of the graph shown below?

Figure 8: Similarity graph

(a) Social Influence


(b) Foci closure
(c) Membership closure
(d) Selection

Answer: (d)

10. Which phenomenon is represented in region B of the similarity graph below?

(a) Social Influence


(b) Foci closure
(c) Membership closure
(d) Selection

Answer: (a)

11

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy