Random graphs and networks: limits, approximations, and applications
Lead Research Organisation:
Heriot-Watt University
Department Name: S of Mathematical and Computer Sciences
Abstract
We will consider some models for random graphs where some nodes may form more connections than others. Such models include non-homogeneous graphs and configuration models. We aim to study various measures of connectedness of such graphs, for instance the probabilities of randomly chosen nodes forming cliques or other subgraphs. We aim to find asymptotics as well as approximations for these measures of connectedness as the size of the graph is going to infinity. Techniques which could be applied here include Stein's method for probability approximations. Extensions of this work include analogous results for dynamic random graphs evolving in time and for stochastic processes on random graphs.
Organisations
People |
ORCID iD |
Vsevolod Shneer (Primary Supervisor) | |
Alastair Haig (Student) |
Studentship Projects
Project Reference | Relationship | Related To | Start | End | Student Name |
---|---|---|---|---|---|
EP/R513040/1 | 30/09/2018 | 29/09/2023 | |||
2273649 | Studentship | EP/R513040/1 | 30/09/2019 | 30/03/2023 | Alastair Haig |