Project level: Honours, Summer

The properties of complex networks are difficult to study without the aid of simulation, and so efficient and reliable simulation techniques for random networks are of great interest.  Two such methods are degree distributions and graph motifs. In this project, you will investigate properties of these simulation algorithms (simulation efficiency as well as empirical study of large-network properties), with a view to developing novel simulation methods.  Some experience with simulation or programming is essential, and background in stochastic processes and graph theory is ideal but not required. 

Project members

Dr Thomas Taimre

Senior Lecturer in Statistics
School of Mathematics and Physics