464749 Dimensionality Reduction of Dynamic Networks

Monday, November 14, 2016: 9:40 AM
Monterey I (Hotel Nikko San Francisco)
Alexander Holiday, Chemical and Biological Engineering, Princeton University, Princeton, NJ, Assimakis Kattis, Computer Science, University of Toronto, Toronto, ON, Canada, Balázs Ráth, Math, Budapest University of Technology, Budapest, Hungary and I.G. Kevrekidis, Princeton University, Princeton, NJ

A canonical problem in the field of dimensionality reduction is to efficiently capture, in some mathematical sense, the important information contained within a collection of high-dimensional vectors. This leads to a simplified description of the vectors that lends itself to faster computation and easier interpretability. Given the ongoing research into complex networks, we present techniques to extend these dimensionality reduction methods, in particular Diffusion Maps, to operate on a collection of graphs. This allows the researcher to obtain a reduced description of the network using only simulation data, and without analyzing the analytical equations that constitute the model. We illustrate Diffusion Maps' effectiveness in the context of both an epidemiological network model and a dynamic multigraph system. Computational challenges and promising future directions will also be discussed.

Extended Abstract: File Not Uploaded