Related papers: Sparse equidistribution problems, period bounds, a…
We prove new explicit upper bounds on the leverage scores of Fourier sparse functions under both the Gaussian and Laplace measures. In particular, we study $s$-sparse functions of the form $f(x) = \sum_{j=1}^s a_j e^{i \lambda_j x}$ for…
We consider locally stabilized, conforming finite element schemes on completely unstructured simplicial space-time meshes for the numerical solution of parabolic initial-boundary value problems with variable, possibly discontinuous in space…
Consider the ensemble of Real Symmetric Toeplitz Matrices, each entry iidrv from a fixed probability distribution p of mean 0, variance 1, and finite higher moments. The limiting spectral measure (the density of normalized eigenvalues)…
We describe a new method to estimate the trilinear period on automorphic representations of PGL(2,R). Such a period gives rise to a special value of the triple L-function. We prove a bound for the triple period which amounts to a…
We study properties of "hyperbolic directions" in groups acting cocompactly on properly convex domains in real projective space, from three different perspectives simultaneously: the (coarse) metric geometry of the Hilbert metric, the…
We propose models and algorithms for learning about random directions in simplex-valued data. The models are applied to the study of income level proportions and their changes over time in a geostatistical area. There are several notable…
The statistics of gap ratios between consecutive energy levels is a widely used tool, in particular in the context of many-body physics, to distinguish between chaotic and integrable systems, described respectively by Gaussian ensembles of…
The Canny-Emiris formula gives the sparse resultant as the ratio of the determinant of a Sylvester-type matrix over a minor of it, both obtained via a mixed subdivision algorithm. The same authors gave an explicit class of mixed…
We study two closely related problems stemming from the random wave conjecture for Maass forms. The first problem is bounding the $L^4$-norm of a Maass form in the large eigenvalue limit; we complete the work of Spinu to show that the…
As a simplified model for subsurface flows elliptic equations may be utilized. Insufficient measurements or uncertainty in those are commonly modeled by a random coefficient, which then accounts for the uncertain permeability of a given…
A new approach is presented to compute the seismic normal modes of a fully heterogeneous, rotating planet. Special care is taken to separate out the essential spectrum in the presence of a fluid outer core. The relevant…
In this paper, we develop the constraint energy minimization generalized multiscale finite element method (CEM-GMsFEM) in mixed formulation applied to parabolic equations with heterogeneous diffusion coefficients. The construction of the…
Iterative methods for fitting a Gaussian Random Field (GRF) model via maximum likelihood (ML) estimation requires solving a nonconvex optimization problem. The problem is aggravated for anisotropic GRFs where the number of covariance…
Based on the Fourier extension, we propose an oversampling collocation method for solving the elliptic partial differential equations with variable coefficients over arbitrary irregular domains. This method only uses the function values on…
We consider the problem of learning a Gaussian variational approximation to the posterior distribution for a high-dimensional parameter, where we impose sparsity in the precision matrix to reflect appropriate conditional independence…
For a bar-joint framework $(G,p)$, a subgroup $\Gamma$ of the automorphism group of $G$, and a subgroup of the orthogonal group isomorphic to $\Gamma$, we introduce a symmetric averaging map which produces a bar-joint framework on $G$ with…
An adaptive method for parabolic partial differential equations that combines sparse wavelet expansions in time with adaptive low-rank approximations in the spatial variables is constructed and analyzed. The method is shown to converge and…
In an effort to develop an alternative approach to traditional sparse reformulations, we will provide a new type of convex reformulation of a large class of stochastic quadratically constrained quadratic optimization problems that is…
The techniques and analysis presented in this thesis provide new methods to solve optimization problems posed on Riemannian manifolds. These methods are applied to the subspace tracking problem found in adaptive signal processing and…
Many problems of interest in computer science and information theory can be phrased in terms of a probability distribution over discrete variables associated to the vertices of a large (but finite) sparse graph. In recent years,…