An important characteristic of complex networks is that there are usually broad categories of models that exhibit the same structure on a large scale regardless of the specific details of local interactions. This phenomenon is known as universality. Almost-2-regular random graphs, networks in which most vertices have exactly 2 connections, are an interesting example where this does not occur. Their large-scale structure is very different from other well-known models and is extremely sensitive to the properties of a small number of vertices.

Read the full paper HERE

By Lorenzo Federico - the research was also conducted at the University of Warwick.