Stochastic Processes on Random Graphs

Project description

Given a random graph G = (V, E), we begin by endowing each vertex v in V with a colour from a set S. As time progresses, the vertices change their colours as they interact with their neighbours. The goal of this project is to understand the large graph limiting behaviour of the system, as the number of vertices of the graph grows arbitrarily large.

This is a theoretical project and will require a solid foundation in analysis (both real and functional), probability theory in general and stochastic processes in particular.