2. Topics
•
The explosion of social interactions
•
ICT and social interactions
•
Social Networks
•
Metrics
•
Data
•
Tools
•
Project ideas
2SSIIM, 2017/10/12
16. Where are we?
●
Complex networks
●
Actors influencing and being influenced by
other actors
●
But humans are not software agents
●
Difficult to establish consensus
●
Intelligence highly needed
●
Maybe biology could inspire us...
SSIIM, 2017/10/12 16
20. Basics of graphs and networks
•
G = (V, E)
•
O(G) = |V| order
•
S(G) = |E| size
•
A adjacency matrix
• Ki
degree of vertex i
•
Directed/undirected
SSIIM, 2017/10/12 20
21. Representation of networks
•
Matrixes, graphs, edge lists, etc
A B C D E
A 0 1 1 1 0
B 1 0 1 0 1
C 0 0 0 1 0
D 0 1 1 0 0
E 1 1 0 0 0
A B
A C
A D
B A
B C
B E
C D
D B
D C
E A
E B
SSIIM, 2017/10/12 21
22. •
Equivalence relations
– Reflexive, symmetric, transitive
– Equivalence classes
•
Order relations (partial, total or linear)
– reflexive, anti-symmetrical, transitive
– Hasse diagrams
– x,y xRy yRx (total)
SSIIM, 2017/10/12 22
a b
x taller than y
Be born in the same year
Live in the same street
Binary relations
25. •
Usually not transitive (a likes b and b likes c but ...)
•
“Equivalence” relations
– No equivalence classes
– But communities, clusters, etc
•
“Order” relations (partial, total)
– No Hasse diagrams
– Rankings, proeminence indexes, etc
SSIIM, 2017/10/12 25
Real life relations
26. Global metrics
•
Number of vertexes 5
•
Number of edges 11
•
Number of components 1
•
Diameter 2
•
Density 0.55
SSIIM, 2017/10/12 26
27. Centrality Measures
•
Degree centrality
– Edges per node (the more, the more important the node)
•
Closeness centrality
– How close the node is to every other node
•
Betweenness centrality
– How many shortest paths go through the edge node
•
Bibliometric + Internet style (quality of edges)
– PageRank, eigenvector
27SSIIM, 2017/10/12
30. Community detection
•
Communities and clusters are different
•
Network data is related to graph properties
•
Real world data is big
SSIIM, 2017/10/12 30
31. Modularity
•
Compares number of edges with number of
edges of a random network
•
Maximize Q is NP-hard
SSIIM, 2017/10/12 31
jC,iCδ
ij
ijPijA
m2
1
Q
m2
jkik
ijP
32. Dynamics
•
Networks have a temporal dimension
•
Interactions – follow, like, share, mention,
retweet, hashtag, etc – occur in sequence
•
Network properties evolve in time
SSIIM, 2017/10/12 32