Georgia Institute of Technology College of Sciences

We study the classic matrix cross approximation based on the maximal volume submatrices. Our main results consist of an improvement of the classic estimate for matrix cross approximation and a greedy approach for finding the maximal volume submatrices. More precisely, we present a new proof of the classic estimate of the inequality with an improved constant. Also, we present a family of greedy maximal volume algorithms to improve the computational efficiency of matrix cross approximation. The proposed algorithms are shown to have theoretical guarantees of convergence. Finally, we present two applications: image compression and the least squares approximation of continuous functions. Our numerical results demonstrate the effective performance of our approach.

Three fifteen-minute talks by local speakers.

Motifs (patterns of subgraphs), such as edges and triangles, encode important structural information about the geometry of a network. Consequently, counting motifs in a large network is an important statistical and computational problem. In this talk we will consider the problem of estimating motif densities and fluctuations of subgraph counts in an inhomogeneous random graph sampled from a graphon. We will show that the limiting distributions of subgraph counts can be Gaussian or non-Gaussian, depending on a notion of regularity of subgraphs with respect to the graphon. Using these results and a novel multiplier bootstrap for graphons, we will construct joint confidence sets for the motif densities. Finally, we will discuss various structure theorems and open questions about degeneracies of the limiting distribution and connections to quasirandom graphs.

Joint work with Anirban Chatterjee, Soham Dan, and Svante Janson

In 1976, Thurston decidedly showed that symplectic geometry and Kähler geometry were strictly distinct by providing the first example of a compact symplectic manifold which is not symplectomorphic to any Kähler manifold. Since this example, first studied by Kodaira, much work has been done in explicating the difference between algebraic manifolds such as affine and projective varieties, complex manifolds such as Stein and Kähler manifolds, and general symplectic manifolds. By building on work first outlined by Seidel, McLean has produced numerous examples of non-affine symplectic manifolds, symplectic manifolds which are not symplectomorphic to any affine variety. McLean approached this problem via analysis of the growth rate of symplectic homology for affine varieties. Every affine variety admits a compactification to a projective variety by a normal crossing divisor. Using this fact, McLean is able to show that the symplectic homology of any affine variety must have a well-controlled growth rate.

We add a bit of subtlety to this already mysterious relationship by providing a particularly interesting example of a non-affine symplectic 4-manifold which admits many normal crossing divisor compactifications. Because of the existence of these nice compactifications, one cannot use growth rate techniques to obstruct our example from being affine and thus cannot apply the work of McLean and Seidel. Our approach to proving this results goes by considering the collection of all symplectic normal crossing divisor compactifications of a particular Liouville manifold  given as a submanifold of the Kodaira-Thurston example . By studying the local geometry of a large collection of symplectic normal crossing divisors, we are able to make several topological conclusions about this collection for  as well as for more general Liouville manifolds  which admit similar compactifications. Our results suggest that a more subtle obstruction must exist for non-affine manifolds. If time permits, we will discuss several structural conclusions one may reach about the collection of divisor compactifications for a more general class of Liouville 4-manifolds.