| 1. | Course Title | Complex Networks | |||||||||||
| 2. | Code | 4ФЕИТ08007 | |||||||||||
| 3. | Study program | 6-ARSI, 8-KM-INN,13-PMA | |||||||||||
| 4. | Organizer of the study program (unit, institute, department) | Faculty of Electrical Engineering and Information Technologies | |||||||||||
| 5. | Degree (first, second, third cycle) | Second cycle | |||||||||||
| 6. | Academic year/semester | I/1 | 7. | Number of ECTS credits | 6.00 | ||||||||
| 8. | Lecturer | Dr Vesna Andova | |||||||||||
| 9. | Course Prerequisites | ||||||||||||
| 10. | Course Goals (acquired competencies):
The ability to define, understand and solve creative professional challenges in the area of networks and transportation. The ability of professional communication in the native language as well as in English. Most of the course is devoted to large graphs and random graphs. In part, the course covers modern real-life networks. |
||||||||||||
| 11. | Course Syllabus:
Introduction to Graph Theory. Different random graph models: Erdos-Reny model, Watz-Strogatz model, Barabasi model, etc. Threshold function. Flow. Complex networks: small world, scale-free networks, selfsimilar networks. Centrality measures, vulnerability of networks, degree distribution and correlation, clustering coefficient, and other measures. Dynamic of networks. Analysis of different real networks such as biological networks, transporting networks, fullerenes, and nanotubes as graph structures, etc. |
||||||||||||
| 12. | Learning methods:
Lectures, exercises, individual work, and homework assignments. |
||||||||||||
| 13. | Total number of course hours | 180 | |||||||||||
| 14. | Distribution of course hours | 3 + 3 | |||||||||||
| 15. | Forms of teaching | 15.1 | Lectures-theoretical teaching | 45 hours | |||||||||
| 15.2 | Exercises (laboratory, practice classes), seminars, teamwork | 45 hours | |||||||||||
| 16. | Other course activities | 16.1 | Projects, seminar papers | 30 hours | |||||||||
| 16.2 | Individual tasks | 30 hours | |||||||||||
| 16.3 | Homework and self-learning | 30 hours | |||||||||||
| 17. | Grading | ||||||||||||
| 17.1 | Exams | 30 points | |||||||||||
| 17.2 | Seminar work/project (presentation: written and oral) | 30 points | |||||||||||
| 17.3. | Activity and participation | points | |||||||||||
| 17.4. | Final exam | 40 points | |||||||||||
| 18. | Grading criteria (points) | up to 50 points | 5 (five) (F) | ||||||||||
| from 51 to 60 points | 6 (six) (E) | ||||||||||||
| from 61 to 70 points | 7 (seven) (D) | ||||||||||||
| from 71 to 80 points | 8 (eight) (C) | ||||||||||||
| from 81 to 90 points | 9 (nine) (B) | ||||||||||||
| from 91 to 100 points | 10 (ten) (A) | ||||||||||||
| 19. | Conditions for acquiring teacher’s signature and for taking final exam | Regular attendance of classes/consultations | |||||||||||
| 20. | Forms of assessment |
The assessment will be done continuously by midterm exams, homework/project and final exam. If a student does not take the midterm exams, he/she has to take written problem exam. |
|||||||||||
| 21. | Language | Macedonian and English | |||||||||||
| 22. | Method of monitoring of teaching quality | Self-evaluation | |||||||||||
| 23. | Literature | ||||||||||||
| 23.1. | Required Literature | ||||||||||||
| No. | Author | Title | Publisher | Year | |||||||||
| 1. | A.Byondy, U.S.Murty | Graph Theory | Springer | 2008 | |||||||||
| 2. | M. Newmann | Networks: An Introduction | Oxford University Press | 2010 | |||||||||
| 3. | E.Estrada | The Structure of Complex Networks | Oxford University Press | 2012 | |||||||||
