Lecture 6 - Social Network Analysis Flashcards

1
Q

Why analyse social networks?

A

Network influences behavior

If a person had a friend who became obese, chances of becoming obese increased by 57%.

Social interactions in youth, determine who are likely to commit a crime

Aids transmission, immigration, voting. behaviour, epidemics etc..

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Basic definitions - Nodes

A

Objects, individuals, players

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Basic definitions - Edges

A

Connections between nodes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Basic definitions - Weighted edges

A

The intensity of a link

How many hours do two people spend together?

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Basic definitions - Unweighted edges

A

0 or 1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Basic definitions - Directed edges

A

One way relationship

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Basic definitions - Undirected edges

A

Mutual relationships

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Degree of a node

A

Number of edges connected to a node

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Neighborhood

A

Two nodes are neighbours if they share an edge in-between

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Density of a network

A

Average degree of all the nodes in the network

Only tells a partial story

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Walks and Paths

A
•Walk
Sequence of  links connecting two nodes
•Cycle
A walk that starts and ends at the same node
•Path
A walk where a node appears at most once
•Geodesic
The shortest path between two nodes
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Connectedness

A
•A network is connected if
There is a path between every two nodes
•Diameter of  a network
The largest geodesic (the maximum length of  shortest paths)
•Average path length
What is the most likely
distance between any
nodes?
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Six degrees of separation

A
Academic co-authorship networks
•Math: mean 7.6
•Physics: mean 5.9
•Economics: mean 9.5
Facebook friendship network
•Mean 4.74 (721 million users)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Clustering Coefficient

A

How many of your friends know each other?

Real world networks are highly clustered

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Betweeenness Centrality

A

Number of shortest path that passes through a node

- Represents the influence of a node for information flows

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Network Types to model real world cases

A

Random networks - Links between each node is random

Small world Networks - similar to social networks in real world, a group of people are closely related, a few people have far reaching connections

Scale free networks - start with 1 node, add a new node via a link. Rich get richer phenomenon

17
Q

Strong Ties and Weak Ties

A

Strong ties

  • Close friendships
  • Your friends are also friends with each other

Weak ties

  • A distant friend
  • Your friends do not know each other
18
Q

Strength of Weak Ties

A

•A is looking for a job
-C, D, E and F are close friends and want to help A
-But what they know is similar to what A knows
•B has access to a bunch of information
-That A cannot directly perceive
•Job leads, novel information, etc.