## Seminars and Colloquia by Series

Thursday, March 2, 2017 - 15:05 , Location: Skiles 006 , Vu-Lan Nguyen , Harvard University , Organizer: Christian Houdre
As a general fact, directed polymers in random environment are localized in the so called strong disorder phase. In this talk, based on a joint with Francis Comets, we will consider the exactly solvable model with log gamma environment,introduced recently by Seppalainen. For the stationary model and the point to line version, the localization can be expressed as the trapping of the endpoint in a potential given by an independent random walk.
Thursday, February 23, 2017 - 15:05 , Location: Skiles 006 , , Ohio State University , , Organizer: Michael Damron
Excitable media are characterized by a local tendency towards synchronization, which can lead to waves of excitement through the system. Two classical discrete, deterministic models of excitable media are the cyclic cellular automaton and Greenberg-Hastings models, which have been extensively studied on lattices, Z^d. One is typically interested in whether or not sites are excited (change states) infinitely often (fluctuation vs fixation), and if so, whether the density of domain walls between disagreeing sites tends to 0 (clustering). We introduce a new comparison process for the 3-color variants of these models, which allows us to study the asymptotic rate at which a site gets excited. In particular, for a class of infinite trees we can determine whether the rate is 0 or positive. Using this comparison process, we also analyze a new model for pulse-coupled oscillators in one dimension, introduced recently by Lyu, called the firefly cellular automaton (FCA). Based on joint works with Lyu and Gravner.
Wednesday, February 22, 2017 - 14:05 , Location: Skiles 005 , , Texas A&M , , Organizer: Galyna Livshyts

Please note the special time! This is Stochastic & Analysis seminars joint.

Motivated by the investigation on the dependence on epsilon" in the Dvoretzky's theorem, I will show some refinements of the classical  concentration of measure for convex functions. Applications to convexity will be presented if time permits. The talk will be based on joint works with Peter Pivovarov and Petros Valettas.
Thursday, February 9, 2017 - 15:05 , Location: Skiles 006 , , University of Washington , , Organizer: Michael Damron
First-passage percolation is a classical random growth model which comes from statistical physics. We will discuss recent results about the relationship between the limiting shape in first passage percolation and the structure of the infinite geodesics. This incudes a solution to the midpoint problem of Benjamini, Kalai and Schramm. This is joint work with Gerandy Brito and Daniel Ahlberg.
Thursday, February 2, 2017 - 15:05 , Location: Skiles 006 , , ECE, GaTech , , Organizer: Christian Houdre
We propose a new convex relaxation for the problem of solving (random) quadratic equations known as phase retrieval. The main advantage of the proposed method is that it operates in the natural domain of the signal. Therefore, it has significantly lower computational cost than the existing convex methods that rely on semidefinite programming and competes with the recent non-convex methods. In the proposed formulation the quadratic equations are relaxed to inequalities describing a "complex polytope". Then, using an *anchor vector* that itself can be constructed from the observations, a simple convex program estimates the ground truth as an (approximate) extreme point of the polytope. We show, using classic results in statistical learning theory, that with random measurements this convex program produces accurate estimates. I will also discuss some preliminary results on a more general class of regression problems where we construct accurate and computationally efficient estimators using anchor vectors.
Thursday, January 26, 2017 - 15:05 , Location: Skiles006 , Vladimir Koltchinskii , Georgia Tech , Organizer: Christian Houdre
We study the problem of estimation of a linear functional of the eigenvector of covariance operator that corresponds to its largest eigenvalue (the first principal component) based on i.i.d. sample of centered Gaussian observations with this covariance. The problem is studied in a dimension-free framework with its complexity being characterized by so called "effective rank" of the true covariance. In this framework, we establish a minimax lower bound on the mean squared error of estimation of linear functional and construct an asymptotically normal estimator for which the bound is attained. The standard "naive" estimator (the linear functional of the empirical principal component) is suboptimal in this problem. The talk is based on a joint work with Richard Nickl.
Thursday, January 19, 2017 - 15:05 , Location: Skiles 006 , Dave Goldberg , ISyE, GaTech , Organizer: Christian Houdre
Demand forecasting plays an important role in many inventory control problems. To mitigate the potential harms of model misspecification, various forms of distributionally robust optimization have been applied. Although many of these methodologies suffer from the problem of time-inconsistency, the work of Klabjan et al. established a general time-consistent framework for such problems by connecting to the literature on robust Markov decision processes. Motivated by the fact that many forecasting models exhibit very special structure, as well as a desire to understand the impact of positing different dependency structures, in this talk we formulate and solve a time-consistent distributionally robust multi-stage newsvendor model which naturally unifies and robustifies several inventory models with demand forecasting. In particular, many simple models of demand forecasting have the feature that demand evolves as a martingale (i.e. expected demand tomorrow equals realized demand today). We consider a robust variant of such models, in which the sequence of future demands may be any martingale with given mean and support. Under such a model, past realizations of demand are naturally incorporated into the structure of the uncertainty set going forwards. We explicitly compute the minimax optimal policy (and worst-case distribution) in closed form, by combining ideas from convex analysis, probability, and dynamic programming. We prove that at optimality the worst-case demand distribution corresponds to the setting in which inventory may become obsolete at a random time, a scenario of practical interest. To gain further insight, we prove weak convergence (as the time horizon grows large) to a simple and intuitive process. We also compare to the analogous setting in which demand is independent across periods (analyzed previously by Shapiro), and identify interesting differences between these models, in the spirit of the price of correlations studied by Agrawal et al. This is joint work with Linwei Xin, and the paper is available on arxiv at https://arxiv.org/abs/1511.09437v1
Monday, January 9, 2017 - 15:05 , Location: Skiles 006 , Franck Maunoury , Université Pierre et Marie Curie , Organizer: Christian Houdre
We consider permanental and multivariate negative binomial distributions. We give sim- ple necessary and sufficient conditions on their kernel for infinite divisibility, without symmetry hypothesis. For existence of permanental distributions, conditions had been given by Kogan and Marcus in the case of a 3 × 3 matrix kernel: they had showed that such distributions exist only for two types of kernels (up to diagonal similarity): symmet- ric positive-definite matrices and inverse M-matrices. They asked whether there existed other classes of kernels in dimensions higher than 3.  We give an affirmative answer to this question, by exhibiting (in any finite dimension higher than 3) a family of matrices which are kernels of permanental distributions but are neither symmetric, nor inverse M-matrices (up to diagonal similarity). Analog properties (by replacing inverse M-matrices by entrywise non-negative matrices) are given for multivariate negative binomial distribu- tions. These notions are also linked with the study of inverse power series of determinant. This is a joint work with N. Eisenbaum.
Thursday, November 3, 2016 - 15:05 , Location: Skiles 006 , , University of Pennsylvania, Department of Statistics, The Wharton School , Organizer: Mayya Zhilova
Exact oracle inequalities for regression have been extensively studied in statistics and learning theory over the past decade. In the case of a misspecified model, the focus has been on either parametric or convex classes. We present a new estimator that steps outside of the model in the non-convex case and reduces to least squares in the convex case. To analyze the estimator for general non-parametric classes, we prove a generalized Pythagorean theorem and study the supremum of a negative-mean stochastic process (which we term the offset Rademacher complexity) via the chaining technique.(joint work with T. Liang and K. Sridharan)
Thursday, October 27, 2016 - 15:05 , Location: Skiles 006 , R. Gong , Illinois Institute of Technology , Organizer: Christian Houdre
In this talk, we consider the small-time asymptotics of options on a Leveraged Exchange-Traded Fund (LETF) when the underlying Exchange Traded Fund (ETF) exhibits both local volatility and jumps of either finite or infinite activity. Our main results are closed-form expressions for the leading order terms of off-the-money European call and put LETF option prices, near expiration, with explicit error bounds. We show that the price of an out-of-the-money European call on a LETF with positive (negative) leverage is asymptotically equivalent, in short-time, to the price of an out-of-the-money European call (put) on the underlying ETF, but with modified spot and strike prices. Similar relationships hold for other off-the-money European options. In particular, our results suggest a method to hedge off-the-money LETF options near expiration using options on the underlying ETF. Finally, a second order expansion for the corresponding implied volatilities is also derived and illustrated numerically. This is the joint work with J. E. Figueroa-Lopez and M. Lorig.