|
1 Theoretical Concepts of Network Analysis |
|
|
1 | (32) |
|
1.1 Sociological Meaning of Network Relations |
|
|
1 | (2) |
|
|
3 | (6) |
|
|
3 | (1) |
|
|
4 | (1) |
|
|
4 | (2) |
|
|
6 | (1) |
|
1.2.5 Dyads and Mutuality |
|
|
7 | (1) |
|
|
7 | (2) |
|
|
9 | (1) |
|
|
9 | (9) |
|
1.3.1 Distance Between Two Nodes |
|
|
9 | (1) |
|
|
10 | (1) |
|
1.3.3 Closeness Centrality |
|
|
11 | (1) |
|
1.3.4 Betweenness Centrality |
|
|
12 | (2) |
|
1.3.5 Eigenvector Centrality |
|
|
14 | (1) |
|
|
15 | (1) |
|
1.3.7 Geodesic Distance and Shortest Path |
|
|
16 | (1) |
|
|
16 | (1) |
|
|
17 | (1) |
|
|
18 | (6) |
|
|
19 | (1) |
|
|
19 | (1) |
|
|
20 | (1) |
|
1.4.4 Clustering Coefficient |
|
|
20 | (2) |
|
|
22 | (1) |
|
|
23 | (1) |
|
1.4.7 Hierarchical Clustering |
|
|
23 | (1) |
|
1.5 Recent Developments in Network Analysis |
|
|
24 | (5) |
|
1.5.1 Community Detection |
|
|
24 | (2) |
|
|
26 | (1) |
|
|
27 | (1) |
|
1.5.4 Protein-Protein Interaction Networks |
|
|
28 | (1) |
|
1.5.5 Recommendation Systems |
|
|
28 | (1) |
|
|
29 | (4) |
|
|
33 | (16) |
|
|
33 | (1) |
|
|
33 | (1) |
|
2.3 Properties of Networks |
|
|
34 | (1) |
|
|
35 | (1) |
|
|
36 | (1) |
|
|
37 | (3) |
|
|
40 | (1) |
|
2.8 Types of Matrices in Social Networks |
|
|
41 | (5) |
|
|
41 | (1) |
|
|
42 | (2) |
|
|
44 | (2) |
|
|
46 | (1) |
|
|
46 | (1) |
|
2.9 Basic Matrix Operations |
|
|
46 | (1) |
|
|
47 | (2) |
|
|
49 | (16) |
|
3.1 Origins of Graph Theory |
|
|
49 | (2) |
|
|
51 | (1) |
|
|
52 | (1) |
|
|
53 | (3) |
|
|
56 | (8) |
|
3.5.1 Depth-First Traversal (DFS) |
|
|
57 | (2) |
|
3.5.2 Breadth-First Traversal (BFS) |
|
|
59 | (2) |
|
3.5.3 Dijkstra's Algorithm |
|
|
61 | (3) |
|
|
64 | (1) |
|
|
64 | (1) |
|
|
65 | (14) |
|
|
65 | (1) |
|
4.2 Properties of a Social Network |
|
|
66 | (3) |
|
4.2.1 Scale-Free Networks |
|
|
66 | (1) |
|
4.2.2 Small-World Networks |
|
|
67 | (2) |
|
|
69 | (1) |
|
|
69 | (1) |
|
4.3 Data Collection in Social Networks |
|
|
69 | (1) |
|
4.4 Six Degrees of Separation |
|
|
70 | (1) |
|
4.5 Online Social Networks |
|
|
71 | (1) |
|
4.6 Online Social Data Collection |
|
|
71 | (1) |
|
|
72 | (2) |
|
4.8 Social Network Analysis |
|
|
74 | (1) |
|
4.9 Social Network Analysis vs. Link Analysis |
|
|
75 | (1) |
|
4.10 Historical Development |
|
|
75 | (2) |
|
4.11 Importance of Social Network Analysis |
|
|
77 | (1) |
|
4.12 Social Network Analysis Modeling Tools |
|
|
77 | (2) |
|
|
78 | (1) |
|
|
79 | (34) |
|
|
79 | (13) |
|
5.2 Identifying Influential Individuals in the Network |
|
|
92 | (11) |
|
|
92 | (5) |
|
5.2.2 Closeness Centrality |
|
|
97 | (2) |
|
5.2.3 Betweenness Centrality |
|
|
99 | (2) |
|
5.2.4 Eigenvector Centrality |
|
|
101 | (2) |
|
|
103 | (6) |
|
|
109 | (1) |
|
|
110 | (1) |
|
5.6 Which Centrality Algorithm to Use? |
|
|
110 | (3) |
|
|
113 | (34) |
|
|
113 | (1) |
|
|
114 | (3) |
|
6.3 Clustering Coefficient |
|
|
117 | (2) |
|
|
119 | (3) |
|
|
122 | (1) |
|
|
122 | (3) |
|
|
125 | (4) |
|
|
129 | (1) |
|
6.9 Overlapping Communities |
|
|
129 | (1) |
|
6.10 Dynamic Community Finding |
|
|
130 | (1) |
|
|
131 | (1) |
|
|
131 | (1) |
|
|
131 | (8) |
|
6.13.1 Graph Partitioning |
|
|
132 | (1) |
|
6.13.2 Hierarchical Clustering |
|
|
132 | (7) |
|
|
139 | (7) |
|
6.14.1 Modularity Optimization |
|
|
145 | (1) |
|
|
146 | (1) |
|
|
146 | (1) |
|
|
147 | (18) |
|
|
147 | (1) |
|
|
147 | (1) |
|
|
148 | (1) |
|
|
149 | (1) |
|
|
150 | (1) |
|
|
151 | (1) |
|
|
152 | (2) |
|
|
154 | (11) |
|
8 Information Diffusion in Social Networks |
|
|
165 | (20) |
|
|
165 | (1) |
|
|
166 | (1) |
|
8.3 Diffusion of Innovation |
|
|
167 | (1) |
|
8.4 Adoption of Innovations |
|
|
168 | (1) |
|
8.5 Diffusion of Innovation Models |
|
|
168 | (1) |
|
|
169 | (1) |
|
|
170 | (1) |
|
|
171 | (1) |
|
8.9 Adoption Categories and Thresholds |
|
|
171 | (1) |
|
|
171 | (2) |
|
8.11 Adopters and Adoption |
|
|
173 | (2) |
|
|
175 | (2) |
|
|
177 | (1) |
|
|
178 | (1) |
|
8.15 Deterministic Compartmental Models |
|
|
178 | (1) |
|
|
178 | (2) |
|
8.17 Properties of the SIR Model |
|
|
180 | (5) |
|
|
185 | (16) |
|
Appendix A Python 3.x Quick Syntax Guide |
|
|
185 | (6) |
|
|
186 | (1) |
|
|
186 | (1) |
|
|
187 | (1) |
|
|
187 | (1) |
|
|
187 | (1) |
|
|
188 | (1) |
|
|
188 | (1) |
|
|
189 | (1) |
|
|
189 | (1) |
|
|
189 | (1) |
|
|
190 | (1) |
|
|
191 | (1) |
|
|
191 | (1) |
|
|
191 | (1) |
|
Appendix B NetworkX Tutorial |
|
|
191 | (10) |
|
|
193 | (1) |
|
|
193 | (1) |
|
|
194 | (1) |
|
|
195 | (1) |
|
|
195 | (1) |
|
|
196 | (1) |
|
|
196 | (1) |
|
|
196 | (1) |
|
|
197 | (1) |
|
|
198 | (1) |
|
|
199 | (1) |
|
|
199 | (1) |
|
Algorithms Package (NetworkX Algorithms) |
|
|
199 | (1) |
|
|
200 | (1) |
References |
|
201 | |