1. | ![]() |
Lecture 1 | 1. Objectives 2. Complex architecture 3. Social Networks 4. Introduction of Mobility Aware Reconstruction in Wireless Sensor Networks |
![]() |
2. | ![]() |
Lecture 1 | 1. Ant navigaion paths in the search of food | ![]() |
3. | ![]() |
Lecture 1 | 1. Exercises and Solutions | ![]() |
4. | ![]() |
Lecture 3 | 1. Connectivity Matrix 2. Rings |
![]() |
5. | ![]() |
Lecture 4 | 1. Random Graphs | ![]() |
6. | ![]() |
Lecture 6 | 1. Scaling behavior 2. Small World 3. Transition to random graphs 4. Linear graphs |
![]() |
7. | ![]() |
Lecture 1 | 1. Not realistic : intersections are allowed 2. More realistic model |
![]() |
8. | ![]() |
Lecture 9 | 1. Linear graphs and natural proteins 2. Examples 3. Mean node degree |
![]() |
9. | ![]() |
Lecture 11 | 1. Mean node degree 2. Sequence design |
![]() |
10. | ![]() |
Lecture 12 | 1. Eulers Relationship 2. Average node degree |
![]() |
11. | ![]() |
Lecture 12 | 1. Trees 2, Random tree 3. River basins |
![]() |
12. | ![]() |
Lecture 16 | 1. Minimal Spanning Tree | ![]() |
13. | ![]() |
Lecture 16Lecture 17 | 1. Self-similar network | ![]() |
14. | ![]() |
Lecture 18 | 1. Scale-free Networks 2. Nodes distribution on the plane |
![]() |