SocialNetworks Flashcards

1
Q

What are the two critical questions that network structure helps answer in DAI?

A
  1. How long for entities to share information 2. How long to agree on a decision
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is the main reasons technological networks resemble on social networks?

A

Network formation is driven by underlying social network structure (similar laws)

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

What was the methodology of Milgram’s experiment (1967)?

A

Letters were sent to random individuals who had to either send directly to target if known, or forward to an acquaintance more likely to know the target

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

What were the results of Milgram’s experiment?

A

42 out of 160 letters reached destination with average path length of 6 steps

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

What is the current average degree of separation on Facebook?

A

Around 4

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

What are three examples of Small World networks?

A

Hollywood, Web topology, and network of airlines

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

What are the four components of a graph G?

A
  1. Vertex set V(G) 2. Edge list E(G) 3. Size n (vertices) 4. Density M (edges)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is the formula for average degree k in a graph?

A

M = nk/2

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

What is Distance D(i,j) in network measures?

A

Shortest path length between nodes i and j

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

What is Characteristic Path Length L(G)?

A

Mean of shortest path lengths (average “degree of separation”)

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

What is the neighborhood Γ(v) of a vertex?

A

Subgraph consisting of all vertices adjacent to v, excluding v

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

What is the neighborhood Γ(S) of a subgraph S?

A

Subgraph consisting of all vertices adjacent to any vertices of S, excluding S

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

What does the clustering coefficient measure?

A

The extent to which vertices adjacent to j are also adjacent to each other

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

What characterizes D-Lattice Networks?

A

Regular d-dimensional k-regular grids with good clustering but not small world properties

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

What are the three main properties of Random Networks?

A
  1. Low clustering 2. Short characteristic path length 3. Small world behavior
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Why aren’t random networks good models of social networks?

A

They aren’t clustered at all, despite achieving small degrees of separation

17
Q

What is the key principle of Watts-Strogatz Model?

A

Networks must be regular enough for clustering but chaotic enough for small degrees of separation

18
Q

How is Watts-Strogatz Model created?

A

By rewiring regular lattice networks to preserve clustering while introducing shortcuts

19
Q

What is Percolation in networks?

A

The process of propagation across a medium/network

20
Q

What is Percolation threshold?

A

The critical value at which diffusion process can complete across the network

21
Q

What does scale-free mean in networks?

A

Network properties are preserved independently of the scale at which we observe it

22
Q

What is the power law formula for network connectivity?

A

P(k) = αk^(-γ)

23
Q

What is the 20%-80% Rule in networks?

A

20% of system population consumes 80% of system’s resources

24
Q

What are the two roles of important nodes in scale-free networks?

A
  1. Hubs: points most other nodes connect to 2. Connectors: nodes that connect large portions of network
25
Q

What are the two steps in Barabási-Albert Model?

A
  1. Start with m0 initial nodes 2. Add new node each step with m edges linking to existing nodes
26
Q

What is the formula for attachment probability in BA Model?

A

∏(ki) = ki / ∑j kj

27
Q

Why are scale-free networks error tolerant?

A

Network structure maintains integrity and path lengths remain stable against random failures

28
Q

Why are scale-free networks vulnerable to attacks?

A

Targeted attacks on hubs fragment network quickly and increase path lengths dramatically

29
Q

What is the percolation threshold in scale-free networks?

A

Practically zero

30
Q

What are Communities in networks?

A

Sets of nodes highly interconnected with each other but less connected with others

31
Q

What is a Temporal Network?

A

A time-varying graph showing active links or links active during specific periods