|
Network Science
|
|
01. 2010_09_15 (W7) (W8)
W7:
Introduction, Math_of_Networks_PartI (P1~P4)
W8:
Math_of_Networks_PartI
(P5~P19)
|
02. 2010_09_20 (M9)
M9:
Math_of_Networks_PartI (P4~P33)
|
03. 2010_09_27 (M9)
M9:
Math_of_Networks_PartI (P29~P41)
Maximum Flow and Network Coding (P1~P8)
|
|
04. 2010_09_29 (W7) (W8)
W7: Maximum Flow and Network Coding (P1~P33)
W8: Maximum Flow and Network Coding (P33~P38)
Diffusion and
Random Walk (P1~P4)
|
05. 2010_10_04 (M9)
M9: Network Coding
Example Illustration
Diffusion and
Random Walk (P1~P7)
|
06. 2010_10_06 (W7)(W8)
W7: Diffusion and
Random Walk (P4~P16)
W8: Distributed Averaging Concensus (P1~P16)
|
|
07. 2010_10_11 (M9)
M9: Distributed
Averaging Concensus (P4~P26)
Random Gossip
Algorithms (P1~P3)
|
08. 2010_10_13 (W7)(W8)
W7: Random Gossip
Algorithms (P1~P12)
W8: Random Gossip
Algorithms (P12~P15)
Chapter7PartI-Centralities (P1~P12)
|
09.
2010_10_18 (M9)
M9: Chapter7PartI-Centralities (P2~P25)
Chapter7PartII-Similarity (P1~P4)
|
|
10.
2010_10_20 (W7)(W8)
W7: Chapter7PartII-Simiarity (P2~P20)
W8: Chapter7PartII-Simiarity (P21~P33)
Chapter7PartIII-Homophily (P1~P6)
|
11.
2010_10_27 (W7)(W8)
W7: Chapter7PartIII-Homophily (P2~P14)
Chapter8 The Large-scale Structure of Networks (P1~P12)
W8: Chapter8 The large-scale Structure of Networks (P12~P42)
|
12.
2010_11_01 (M9)
M9: Chapter8 The large-scale Structure of Networks (P24~P62)
Chapter9 Basic Concepts of Algorithms (P1~P25)
|
|
13. 2010_11_03 (W7)(W8)
W7: Chapter9 Basic Concepts of Algorithms (P22~P33)
Chapter11 Matrix Algorithms and Graph Partitioning (P1~P19)
W8: Chapter11 Matrix Algorithms and Graph Partitioning (P20~P48)
|
14. 2010_11_08 (M9)
M9: Chapter12 Random Graphs (P1~P18)
|
15.
2010_11_10 (W7)(W8)
W7: Chapter12 Random Graphs (P10~P35)
W8: Cauchy Integral (Ching-Min Lien)
Chapter12 Random Graphs (P35~P44)
Chapter13 PartI-Configuration Model (P1~P9)
|
|
16.
2010_11_15 (M9)
M9: Chapter13 PartI-Configuration Model (P10~P22)
Ch13 Random Graphs with Given Expected Degree
Excess Degree Distribution
|
17. 2010_11_24 (W7)(W8)
|
18. 2010_11_29 (M9)
|
|
19.
2010_12_01 (W7)(W8)
W7: Answers for the midterm
W8: Size Distribution for Samll Componenets
Average Size of a Small Component
Complete Distribution of Small Component Sizes
|
20.
2010_12_06 (M9)
M9: Complete Distribution of Small Component Sizes
Power-law Degree Distribution
Ch14. Preferential Attachment
|
21. 2010_12_08
(W7) (W8)
W7: Ch14. Preferential Attachment Price's Model, Master Equation
W8: Beta and Gamma Functions,
Computer Simulation
|
|
22.
2010_12_13 (M9)
M9:The Model of Barabasi and Albert
Degree Distribution as a Function of Time of Creation
|
23.
2010_12_15 (W7)(W8)
W7: Size of In-componenets
Addition of Extra Edges
W8: Removal of Edges
Non-linear Preferential Attachment
|
24.
2010_12_20 (M9)
M9: Vertices of Varying Quality or Attractiveness
Vertex Copying Models
|
|
25.
2010_12_22 (W7)(W8)
W7: Chapter15 Small World (P1~P22)
15.2 Exponential Random Graphs
W8:
15.2 Exponential Random Graphs
|
26.
2010_12_27 (M9)
M9: 15.2 Exponential Random Graphs
Simple Examples
Reciprocity Model
|
27.
2010_12_29 (W7)(W81,
W82)
W7: Two-star Model
W8: Igraph Project
16.1 Percolation
16.2Uniform Random Removal of Vertices
|
|
28.
2011_01_03 (M9)
M9: 16.2 Uniform Random Removal of Vertices
16.3 Non-Uniform Random Removal of
Vertices
17 Epidemics on Neworks SI model
|
29.
2011_01_05 (W7)(W8)
W7: 17 Epidemics on
Networks
SIR model, SIS model, SIRS model,
W8: 17.7
Late-time Property
SIR Model and the Configuration model
17.9 Time-dependent Properties
|
30.
|