Linear Algebraic Techniques in Algorithmic Graph Theory

点击翻译按钮获取中文摘要

Algorithms for fundamental graph problems are important tools in computer science and engineering.  Extensive research has been done in the past decades to develop efficient algorithms, most of them based on combinatorial techniques.  In recent years, new linear algebraic techniques have been developed to make surprising and significant progress in these fundamental problems.  My previous research develops linear algebraic techniques to design both better approximation algorithms and faster exact algorithms for graph problems.  I plan to continue this line of ongoing research and have identified three promising directions to investigate.****Spectral graph theory: The application of spectral techniques to study combinatorial graph properties has a long history.  The classical result relates the second eigenvalue to the edge expansion of the graph, and it has been used to develop efficient algorithms for graph partitioning problems and to analyze the mixing time of random walks.  Recently, there have been exciting new results relating other eigenvalues to combinatorial graph properties.  This new connection opens up ways to do better analysis of existing algorithms, to design better approximation algorithms and to design faster algorithms for various graph problems.  I believe that this approach will bring new insights into some outstanding open problems including the small-set expansion conjecture, the bipartite matching problem, and the log-rank conjecture.****Random walks: Random walks are simple stochastic processes on graphs that have a wide range of algorithmic applications.  One classical application of random walks is in designing random sampling algorithms.  Recently, random walks have been used to design sublinear time graph algorithms.  I plan to do a systematic study of the random walks method, to design exact and approximation algorithms and to prove hardness of approximation results.  Also, with our new knowledge about random walks and graph expansion, I would like to revisit the outstanding open problems in random sampling, including the matroid expansion conjecture and the mixing time of the Glauber dynamics for graph coloring.***Linear algebraic algorithms: Recently, there has been significant progress in designing fast algorithms for fundamental graph problems using linear algebraic algorithms.  A major open problem in this area is to design fast algebraic algorithms for weighted problems.  I also plan to develop this approach to solve additional graph problems and linear algebraic problems, and to study the interplay between graph theory and linear algebra.***I believe that achieving the goals in this proposal would have major impacts in the theory of computing, as well as in other areas such as machine learning, applied probability, and symbolic computation.  I also expect to have significant contributions to the training of HQPs by acquiring these emerging techniques with my students. **