Hints and tips:
  • You may need to look up some unfamiliar terms in the title or description to get more of a sense of what is involved.
  • If the project has "No" in the "Current Availability:" field, it is already taken or not being offered this academic year but may be available again in future years.
  • The supervisor name links to a contact details webpage so, if you are interested, you can arrange to discuss this project or even propose a related topic of your own.
Level: BSc, MSci
Title: Exponential random graphs
Supervisor:
Research Area: Complex Systems and Networks
Description:

In order to describe mathematically complex networks such as the Internet, social online networks, or biological networks in the cell, one possibility is to introduce Exponential Random Graphs. These graphs can be defined using the tools of information theory and statistical physics and are maximally random graphs that satisfy a certain set of constraints such as different degree of the nodes or different community structure. In this project the student will analytically investigate how it is possible to model a given network with an Exponential Random Graph.

Further Reading:
  • M. E. J. Newman, The structure and function of complex networks, SIAM Review 45 2 (2003) 167256.
  • J. Park, M. E. J. Newman, The statistical mechanics of networks, Phys. Rev. E 70 (2004) 066117.
  • K. Anand, G. Bianconi, Entropy measures for networks: Toward an information theory for complex topologies, Phys. Rev. E 80 (2009) 045102.
Key Modules:
Other Information:

Knowledge of probability and complex networks is a prerequisite.

Current Availability: Yes