# Graph topology

**Journal Paper**

IET Software 6(3) p. 470--479

This paper creates software models of how P2P network topologies could wire up. It considers the possible strategies such as connecting to close nodes, connecting to random links and so on. Resilience and delay are considered.

**Workshop paper**

Proceedings of IEEE INFOCOM Workshop NetSciCom p.272--277

This paper is the first to describe FETA a process for analysing stochastic models for graph evolution.

**Workshop paper**

SIMPLEX Workshop at NetSci

This paper describes FETA a method for analysing the likelihood of a particular network topology growing from a given statistical model.

This presentation is very like the presentation at Southampton a few months previously. It describes the current incarnation of the Framework for Evolving Topology Analysis.