C5 Flashcards

1
Q

network science

A

understanding data by investigating interactions and relationschips between individual data objects as a network

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

density

A

number of links / maximum number of possible links
= m / m_max

sparse if m &laquo_space;m_max

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

degree distribution

A

distribution of how often each degree value occurs

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

giant component

A

component with the largest number of connections

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

real-world netwroks

A
  1. sparse networks (density)
  2. fat-tailed power-law degree distribution
    3.
    4.
    5.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

degree centrality (undirected graphs)

A

measure the number of adjacent nodes

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

closeness centrality

A

based on the average distance to all other nodes

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

betweenness centrality

A

measure the number of shortest paths that run through a node (how crucial are you for the connectivity of the network)

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