Randomized Algorithms for Linear Algebraic Computations and Applications to Network Analysis

Petros Drineas
Rensselaer Polytechnic Institute
Computer Science

The introduction of randomization in the design and analysis of algorithms for matrix computations (such as Principal Components Analysis and the related Singular Value Decomposition (SVD)) over the last decade made them feasible for matrices that arise in the context of the large networks. In this talk we will discuss these developments, their extensions, and their applications to network analysis.

Presentation (PowerPoint File)

Back to Workshops IV: New Mathematical Frontiers in Network Multi-Resolution Analysis