IMI Interdisciplinary Mathematics InstituteCollege of Arts and Sciences

Summer School on Network Science

Ilya Safro
Clemson University

Multiscale Methods for Networks

  • May 22, 2013
  • 2 p.m.
  • Sumwalt 102

In many real-world problems, a big scale gap can be observed between micro- and macroscopic scales of the problem because of the difference in mathematical (engineering, social, biological, physical, etc.) models and/or laws at different scales. The main objective of multiscale algorithms is to create a hierarchy of problems, each representing the original problem at different coarse scales with fewer degrees of freedom. We will discuss different strategies of creating these hierarchies for large-scale discrete optimization problems related to network analysis. These strategies are inspired by the classical multigrid frameworks such as geometric multigrid, algebraic multigrid and full approximation scheme. We will present in details framework for partitioning, clustering, compression, generation and epidemics response problems on networks.

© Interdisciplinary Mathematics Institute | The University of South Carolina Board of Trustees | Webmaster