title: Exploring complex networks via topological embedding on surfaces.
abstract: We demonstrate that graphs embedded on surfaces are a powerful and practical tool to generate, to characterize, and to simulate networks with a broad range of properties. Any network can be embedded on a surface with sufficiently high genus and therefore the study of topologically embedded graphs is non-restrictive. We show that the local properties of the network are affected by the surface genus which determines the average degree, which influences the degree distribution, and which controls the clustering coefficient. The global properties of the graph are also strongly affected by the surface genus which is constraining the degree of interwovenness, changing the scaling properties of the network from large-world kind (small genus) to small- and ultrasmall-world kind (large genus). Two elementary moves allow the exploration of all networks embeddable on a given surface and naturally introduce a tool to develop a statistical mechanics description for these networks. Within such a framework, we study the properties of topologically embedded graphs which dynamically tend to lower their energy towards a ground state with a given reference degree distribution. We show that the cooling dynamics between high and low "temperatures" is strongly affected by the surface genus with the manifestation of a glass-like transition occurring when the distance from the reference distribution is low. We prove, with examples, that topologically embedded graphs can be built in a way to contain arbitrary complex networks as subgraphs. This method opens a new avenue to build geometrically embedded networks on hyperbolic manifolds.
authors.affiliation: School of Physical Sciences, University of Kent, CT2 7NZ, United Kingdom. t.aste@ucl.ac.uk
authors.forename: Tomaso
authors.initials: T
authors.lastname: Aste
authors.forename: Ruggero
authors.initials: R
authors.lastname: Gramatica
authors.forename: T
authors.initials: T
authors.lastname: Di Matteo
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D008962:Models, Theoretical