EPSRC Funded Studentship: Efficient and scalable calculation of graph metrics for large-scale dynamic networks (2018)

What you get

You will get:

• Home/EU PhD fees
• a tax-free living expenses at Research Council UK rates (£14,777 per year for 2018/19)
• research/training expenses for 3 and a half years.

Type of award

PhD

PhD project

Graph processing is a key aspect of big data processing. An extremely wide range of physical and non-physical constructs can be modelled as graphs and therefore efficient graph processing and calculation of local and global metrics is crucial for a large and diverse set of applications.

Computer, social, neuron and transportation networks are just a few representative examples of such constructs.

Although increasingly sophisticated metrics are being developed to characterise networks, their applicability in the real world is severely limited by:

• the ever-increasing scale of the networks considered -- to the point that no single machine is capable of extracting basic graph metrics
• the fact that most networks are dynamic, i.e., either or both of the nodes and edges change over time, and these changes can happen at timescales that can be as fast as the timescale of metric calculation.

To deal with the scalability challenge in static graph processing, a number of distributed graph processing systems have been proposed. These systems typically offer a generic, one-size-fits-all abstraction for operating on top of graphs that are partitioned across a cluster of servers.

However, such approach does not cater to the fact that different domains involve networks with potentially very distinct structure and temporal dynamics.

The aim of this PhD project is to develop new tools and methodologies for efficient and scalable calculation of key graph metrics for large-scale dynamic networks, via a two-pronged approach:

• (a) designing, implementing and evaluating distributed graph processing algorithms for calculating graph metrics in an efficient and scalable way
• (b) developing and implementing problem-specific graph metric approximations to tackle the challenge of fast-changing networks.

This would be a key step towards network research having a more tangible impact in today's Big Data.

Eligibility

To be eligible, you need to have:

• an excellent academic record and should have received or be expected to receive a relevant first or upper-second class honours degree
• good programming skills in at least one of Java, Python, Scala, C/C++ (essential)
• ability to work independently and be self-motivated (essential).

Experience with one of a number of distributed processing systems (e.g., Spark) and/or distributed graph processing systems (e.g., GraphX) is desirable.

The full award is available to UK and to EU students who have been ordinarily resident in the UK for the previous 3 years. EU candidates who do not meet this criteria will be eligible for a fee waiver only.

If you are an overseas (non EU) student, you are not eligible to apply.

Deadline

2 March 2018 0:00

How to apply

You need to apply for a PhD in Informatics through the University of Sussex postgraduate application system.

When you apply, include a brief statement of your scientific interests and skills/experience for the mandatory "research proposal" section, including how they relate to this project (maximum two pages).

Indicate Dr Luc Berthouze as your preferred advisor and clearly state the title of the studentship in the finance section.

Contact us

Email Dr Luc Berthouze at L.Berthouze@sussex.ac.uk

Timetable

The deadline is 02/03/2018.