Postgraduate Course: Methods for the Analysis of Networks (INFR11083)
||School of Informatics
||College of Science and Engineering
||Available to all students
|Credit level (Normal year taken)
||SCQF Level 11 (Postgraduate)
|Home subject area
||Other subject area
||Taught in Gaelic?
||This course studies methods for analysing the emergent properties of naturally-occurring networks. The past decade has brought overabundant quantitative information on various complex distributed systems, which one can often embed into a network presentation. Examples include: social networks, food webs, the world wide web, (natural) neural networks, metabolic and signalling networks. There is now a growing corpus of network-based methods and algorithms that can help build a bigger picture and approach questions about the design and global properties of such systems. One can in particular ask questions such as: how resilient is a network, how well does it propagate information (or diseases), how modular is it, what is a likely growth scenario, etc. These methods are sometimes given the catch phrase "network science" to stress their relative independence from the particulars of the network of interest --- which in itself is a remarkable fact.
|| For Informatics PG and final year MInf students only, or by special permission of the School. Students will need some familiarity with graph theory, algorithmics, elementary probability and elementary calculus.
Information for Visiting Students
|Displayed in Visiting Students Prospectus?
Course Delivery Information
|Not being delivered|
Summary of Intended Learning Outcomes
|1 - Recognise situations where data can be represented as a graph (directed, weighted or not, as appropriate).
2 - Explain how to compute the usual local or global metrics on large graphs.
3 - Given a large graph, identify the classes of random graphs of which it is likely to be a member.
4 - Given an existing network, identify possible associated growth scenarios.
5 - Describe the dynamics one can endow upon a graph and their asymptotic properties.
|Written Examination 70
Assessed Assignments 30
Oral Presentations 0
There is a single written exam, which accounts for 75% of the final grade. In addition there are two pieces of coursework which together account for the remaining 25%. In one of these students will be required to look for data of their own and to conduct an analysis employing appropriate techniques as introduced in the course. The other will involve giving a short presentation of a current research paper. Students will have sufficient choice to use this, if they wish, to reinforce their MSc specialism, such as Computational Neuroscience.
If delivered in semester 1, this course will have an option for semester 1 only visiting undergraduate students, providing assessment prior to the end of the calendar year.
||+ Various types of data and networks. - Typology of random graph models: Erdős-Rényi, scale-free, hierarchical. - Local properties: edge density, degree distribution, clustering coefficient, assortativity, motifs. - Global properties: path lengths, centrality, modularity/community. - Algorithms: clustering methods, power-law fitting, hierarchy reconstruction. - Examples of networks. One or more sample domain of application, taken from areas such as the following:
+ Protein networks: modular structures, propagation of copy number perturbations, phase transitions in structural protein networks.
+ Neural networks: spatial growth models, hierarchical structure, propagation of excitation, scaling across different species.
+ Social networks: propagation of innovation, citation, epidemics.
Relevant QAA Computing Curriculum Sections: Not yet available
Timetabled Laboratories 0
Non-timetabled assessed assignments 20
Private Study/Other 60
||Dr Michael Rovatsos
Tel: (0131 6)51 3263
||Miss Kate Weston
Tel: (0131 6)50 2701