**Speaker: **Justin Coon, University of Oxford

**Time:** WED, 4th October, 1.00 – 2.00 PM

**Venue:** A17, School of Mathematical Sciences, University of Nottingham

**Title: **On the Entropy of Network Ensembles

**Abstract: **The mathematical formalism of graph entropy is a powerful tool that can be used to study network structure and complexity. In this talk, we will explore a number of key results that relate to the entropy of ensembles of networks, that is, sets of networks associated with a probability measure. We will treat both non-spatial and spatial network models. For the latter case, we will discuss some complications that arise due to geometry, present methods of controlling network complexity in the limit of a large number of nodes, and provide some practical applications where these tools can yield insight into engineered system behaviors.