Related papers: Sharp results on sampling with derivatives in band…

Let $a(x,\xi)$ be a real H\"ormander symbol of the type $S_{0,0}^0(\mathbb{R}^{d}\times \mathbb{R}^d)$, let $F$ be a smooth function with all its derivatives globally bounded, and let $K_\delta$ be the self-adjoint Weyl quantization of the…

We revisit the classical broken sample problem: Two samples of i.i.d. data points $\mathbf{X}=\{X_1,\cdots, X_n\}$ and $\mathbf{Y}=\{Y_1,\cdots,Y_m\}$ are observed without correspondence with $m\leq n$. Under the null hypothesis,…

The bandwidth of a graph G is the minimum of the maximum difference between adjacent labels when the vertices have distinct integer labels. We provide a polynomial algorithm to produce an optimal bandwidth labeling for graphs in a special…

Let $M(x)$ be the length of the largest subinterval of $[1,x]$ which does not contain any sums of two squareful numbers. We prove a lower bound \[ M(x)\gg \frac{\ln x}{(\ln\ln x)^2} \] for all $x\geq 3$. The proof relies on properties of…

A unified framework to derive optimized compact schemes for a uniform grid is presented. The optimal scheme coefficients are determined analytically by solving an optimization problem to minimize the spectral error subject to equality…

We study the problem of efficiently computing on encoded data. More specifically, we study the question of low-bandwidth computation of functions $F:\mathbb{F}^k \to \mathbb{F}$ of some data $x \in \mathbb{F}^k$, given access to an encoding…

We give a new, very general, formulation of the compressed sensing problem in terms of coordinate projections of an analytic variety, and derive sufficient sampling rates for signal reconstruction. Our bounds are linear in the coherence of…

The bandwidth theorem [Mathematische Annalen, 343(1):175--205, 2009] states that any $n$-vertex graph $G$ with minimum degree $\big(\tfrac{k-1}{k}+o(1)\big)n$ contains all $n$-vertex $k$-colourable graphs $H$ with bounded maximum degree and…

In this paper we generalize to arbitrary dimensions a one-dimensional equicoerciveness and $\Gamma$-convergence result for a second derivative perturbation of Perona-Malik type functionals. Our proof relies on a new density result in the…

Let $n,k,b$ be integers with $1 \le k-1 \le b \le n$ and let $G_{n,k,b}$ be the graph whose vertices are the $k$-element subsets $X$ of $\{0,\dots,n\}$ with $\max(X)-\min(X) \le b$ and where two such vertices $X,Y$ are joined by an edge if…

Linear regression without correspondences concerns the recovery of a signal in the linear regression setting, where the correspondences between the observations and the linear functionals are unknown. The associated maximum likelihood…

Sampling and reconstruction of functions is a central tool in science. A key result is given by the sampling theorem for bandlimited functions attributed to Whittaker, Shannon, Nyquist, and Kotelnikov. We develop an analogous sampling…

In this article, we close a gap in the literature by proving existence of invariant measures for reflected SPDEs with only one reflecting barrier. This is done by arguing that the sequence (u(t, .)) is tight in the space of probability…

The fundamental gap is the difference between the first two Dirichlet eigenvalues of a Schr\"odinger operator (and the Laplacian, in particular). For horoconvex domains in hyperbolic space, Nguyen, Stancu and Wei conjectured that it is…

We present algorithms for nonparametric regression in settings where the data are obtained sequentially. While traditional estimators select bandwidths that depend upon the sample size, for sequential data the effective sample size is…

The recovery of bandlimited signals with high dynamic range is a hot issue in sampling research. The unlimited sampling theory expands the recordable range of traditional analog-to-digital converters (ADCs) arbitrarily, and the signal is…

We study two log-concave sampling problems: constrained sampling and composite sampling. First, we consider sampling from a target distribution with density proportional to $\exp(-f(x))$ supported on a convex set $K \subset \mathbb{R}^d$,…

Uniform sampling of simple graphs having a given degree sequence is a known problem with exponential complexity in the square of the mean degree. For undirected graphs, randomised approximation algorithms have nonetheless been shown to…

Finite differences have been widely used in mathematical theory as well as in scientific and engineering computations. These concepts are constantly mentioned in calculus. Most frequently-used difference formulas provide excellent…

In the first part of this paper we establish, in terms of so called k-tangential sets, a kind of optimal estimate for the size and structure of the set of non-differentiability of Lipshitz functions with one-sided directional derivatives.…