C5 Flashcards
1
Q
network science
A
understanding data by investigating interactions and relationschips between individual data objects as a network
2
Q
density
A
number of links / maximum number of possible links
= m / m_max
sparse if m «_space;m_max
3
Q
degree distribution
A
distribution of how often each degree value occurs
4
Q
giant component
A
component with the largest number of connections
5
Q
real-world netwroks
A
- sparse networks (density)
- fat-tailed power-law degree distribution
3.
4.
5.
6
Q
degree centrality (undirected graphs)
A
measure the number of adjacent nodes
7
Q
closeness centrality
A
based on the average distance to all other nodes
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)