Subject
Introduction to Network Science
| 1. | Course Title |
Introduction to Network Science Introduction to network science |
||||||||||||
| 2. | Code | F18L3S087 | ||||||||||||
| 3. | Study Programme | — | ||||||||||||
| 4. | Organizer of the study programme (unit, institute, department or division) | Faculty of Computer Science and Engineering | ||||||||||||
| 5. | Degree level (first, second, third cycle) | First Cycle | ||||||||||||
| 6. | Academic year / semester | 6 / Summer | ||||||||||||
| 7. | Number of ECTS credits | 6 | ||||||||||||
| 8. | Teacher | — | ||||||||||||
| 9. | Prerequisites for enrolling in the course | Probability and Statistics or Fundamentals of Information Theory | ||||||||||||
| 10. | Objectives of the course programme (competences) | Introduction to the fundamental concepts of network science using real data. Equipping students to analyze the properties and dynamic processes in real complex networks and to model and visualize them. Study of fundamental methods for community detection, robustness assessment, optimization, data mining, and prediction in complex networks. | ||||||||||||
| 11. | Course content | Introduction to network science. Properties of complex and real networks: small-world effect, node transitivity, preferential attachment. Models of real networks. Social, information, biological, and techno-technological networks. Community detection and graphlets in complex networks. Robustness of complex networks through link and node analysis. Use of centrality measures and ranking algorithms. Paradoxes in social networks: status homophily, value homophily, social influence, external influences. Dynamic processes in complex networks: diffusion of influence, information, and contagion; consensus and synchronization. Game theory in social networks: monetization in social networks, social network formation, auctions, and target set selection. Multi-layered and time-varying complex networks: models, algorithms, and dynamic processes. Optimization of flow, transport, resource allocation, packaging, and routing in real networks. Data mining and prediction in large networks. Prediction of links, topology and attribute evolution. Prediction of outcomes of dynamic processes and traversal of complex networks. | ||||||||||||
| 12. | Learning methods | Lectures supported by slide presentations, interactive lectures, practical classes (using equipment and software packages), teamwork, case studies, guest lecturers, independent preparation and defence of a project assignment and seminar paper, and learning in an electronic environment (forums and consultations). | ||||||||||||
| 13. | Total available time | 6 ECTS x 30 hours = 180 hours | ||||||||||||
| 14. | Distribution of available time | 30 + 45 + 15 + 15 + 75 = 180 hours | ||||||||||||
| 15. | Forms of teaching activities |
|
||||||||||||
| 16. | Other forms of activities |
|
||||||||||||
| 17. | Assessment method |
|
||||||||||||
| 18. | Grading criteria (points / grade) |
|
||||||||||||
| 19. | Requirement for obtaining a signature and taking the final exam | Activities 15.1 and 15.2 completed | ||||||||||||
| 20. | Language of instruction | Macedonian and English | ||||||||||||
| 21. | Method for monitoring the quality of teaching | internal evaluation and survey mechanism | ||||||||||||
| 22. | Literature |
|