Georgia Institute of Technology College of Sciences

We investigate the long-time behavior of weak solutions to the thin-film type equation $$v_t =(xv - vv_{xxx})_x\ ,$$ which arises in the Hele-Shaw problem. We estimate the rate of convergence of solutions to the Smyth-Hill equilibrium solution, which has the form $\frac{1}{24}(C^2-x^2)^2_+$, in the norm $$|| f ||_{m,1}^2 = \int_{\R}(1+ |x|^{2m})|f(x)|^2\dd x + \int_{\R}|f_x(x)|^2\dd x\ .$$ We obtain exponential convergence in the $|\!|\!| \cdot |\!|\!|_{m,1}$ norm for all $m$ with $1\leq m< 2$, thus obtaining rates of convergence in norms measuring both smoothness and localization. The localization is the main novelty, and in fact, we show that there is a close connection between the localization bounds and the smoothness bounds: Convergence of second moments implies convergence in the $H^1$ Sobolev norm. We then use methods of optimal mass transportation to obtain the convergence of the required moments. We also use such methods to construct an appropriate class of weak solutions for which all of the estimates on which our convergence analysis depends may be rigorously derived. Though our main results on convergence can be stated without reference to optimal mass transportation, essential use of this theory is made throughout our analysis.This is a joint work with Eric A. Carlen.

A multivariate real polynomial $p$ is nonnegative if $p(x) \geq 0$ for all $x \in R^n$. I will review the history and motivation behind the problem of representing nonnegative polynomials as sums of squares. Such representations are of interest for both theoretical and practical computational reasons. I will present two approaches to studying the differences between nonnegative polynomials and sums of squares. Using techniques from convex geometry we can conclude that if the degree is fixed and the number of variables grows, then asymptotically there are significantly more nonnegative polynomials than sums of squares. For the smallest cases where there exist nonnegative polynomials that are not sums of squares, I will present a complete classification of the differences between these sets based on algebraic geometry techniques.

Judicious partitioning problems on graphs and hypergraphs ask for partitions that optimize several quantities simultaneously. In this talk we first review the history of such problems. We will then focus on a conjecture of Bollobas and Thomason that the vertices of any r-uniform hypergraphs with m edges can be partitioned into r sets so that each set meets at least rm/(2r-1) edges. We will show that for r=3 and m large we can get an even better bound than what the conjecture suggests.

High throughput genetic sequencing arrays with thousands of measurements per sample and a great amount of related censored clinical data have increased demanding need for better measurement specific model selection. In this paper we establish strong oracle properties of non-concave penalized methods for non-polynomial (NP) dimensional data with censoring in the framework of Cox's proportional hazards model. A class of folded-concave penalties are employed and both LASSO and SCAD are discussed specifically. We unveil the question under which dimensionality and correlation restrictions can an oracle estimator be constructed and grasped. It is demonstrated that non-concave penalties lead to significant reduction of the "irrepresentable condition" needed for LASSO model selection consistency. The large deviation result for martingales, bearing interests of its own, is developed for characterizing the strong oracle property. Moreover, the non-concave regularized estimator, is shown to achieve asymptotically the information bound of the oracle estimator. A coordinate-wise algorithm is developed for finding the grid of solution paths for penalized hazard regression problems, and its performance is evaluated on simulated and gene association study examples.