Exploring complex networks via topological embedding on surfaces

We demonstrate that graphs embedded on surfaces are a powerful and practical tool to generate, characterize and simulate networks with a broad range of properties. Remarkably, the study of topologically embedded graphs is non-restrictive because any network can be embedded on a surface with sufficiently high genus. The local properties of the network are affected by the surface genus which, for example, produces significant changes in the degree distribution and in the clustering coefficient. The global properties of the graph are also strongly affected by the surface genus which is constraining the degree of interwoveness, changing the scaling properties from large-world-kind (small genus) to small- and ultra-small-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. Within such a framework, we study the properties of topologically-embedded graphs at high and low `temperatures' observing the formation of increasingly regular structures by cooling the system. We show that the cooling dynamics is strongly affected by the surface genus with the manifestation of a glassy-like freezing transitions occurring when the amount of topological disorder is low.Comment: 18 pages, 7 figure

Algorithms for Visualizing Phylogenetic Networks

We study the problem of visualizing phylogenetic networks, which are extensions of the Tree of Life in biology. We use a space filling visualization method, called DAGmaps, in order to obtain clear visualizations using limited space. In this paper, we restrict our attention to galled trees and galled networks and present linear time algorithms for visualizing them as DAGmaps.Comment: Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016

INDEPENDENT DISCOVERIES IN GRAPH THEORY *

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/72829/1/j.1749-6632.1979.tb17761.x.pd

Existence theorems for multidimensional Lagrange problems

Existence theorems are proved for multidimensional Lagrange problems of the calculus of variations and optimal control. The unknowns are functions of several independent variables in a fixed bounded domain, the cost functional is a multiple integral, and the side conditions are partial differential equations, not necessarily linear, with assigned boundary conditions. Also, unilateral constraints may be prescribed both on the space and the control variables. These constraints are expressed by requiring that space and control variables take their values in certain fixed or variable sets wich are assumed to be closed but not necessarily compact.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/45188/1/10957_2004_Article_BF00936648.pd

Self-Similar Random Processes and Infinite-Dimensional Configuration Spaces

We discuss various infinite-dimensional configuration spaces that carry measures quasiinvariant under compactly-supported diffeomorphisms of a manifold M corresponding to a physical space. Such measures allow the construction of unitary representations of the diffeomorphism group, which are important to nonrelativistic quantum statistical physics and to the quantum theory of extended objects in d-dimensional Euclidean space. Special attention is given to measurable structure and topology underlying measures on generalized configuration spaces obtained from self-similar random processes (both for d = 1 and d > 1), which describe infinite point configurations having accumulation points