Related papers: On approximation by random L\"uroth expansions
The culmination of the papers (arXiv:0905.0518, arXiv:0910.0909) was a proof of the norm convergence in $L^2(\mu)$ of the quadratic nonconventional ergodic averages \frac{1}{N}\sum_{n=1}^N(f_1\circ T_1^{n^2})(f_2\circ…
We construct 2-query, quasi-linear size probabilistically checkable proofs (PCPs) with arbitrarily small constant soundness, improving upon Dinur's 2-query quasi-linear size PCPs with soundness $1-\Omega(1)$. As an immediate corollary, we…
Let $\{H_{\lambda}\}$ be a continuous family of H\'{e}non maps parametrized by $\lambda\in M$, where $M\subset\mathbb C^k$ is compact. The purpose of this paper is to understand some aspects of the random dynamical system obtained by…
We build a general framework which establishes a one-to-one correspondence between species abundance distribution (SAD) and species accumulation curve (SAC). The appearance rates of the species and the appearance times of individuals of…
In this paper, we investigate super robust estimation approaches, which generate a reliable estimation even when the noise observations are more than half in an experiment. The following preliminary research results on super robustness are…
We study the $L_p$-discrepancy of random point sets in high dimensions, with emphasis on small values of $p$. Although the classical $L_p$-discrepancy suffers from the curse of dimensionality for all $p \in (1,\infty)$, the gap between…
We obtain results concerning the so-called factorization for the convergence of random variables almost everywhere (almost surely or with probability one), belonging to the classical Lebesgue-Riesz spaces and we extend these results to the…
We consider the minimization of a sum of an expectation-valued coordinate-wise $L_i$-smooth nonconvex function and a nonsmooth block-separable convex regularizer. We propose an asynchronous variance-reduced algorithm, where in each…
We study skew-products of the form (x,\omega)\mapsto (Tx, \omega+\phi(x)) where T is a nonuniformly expanding map on a space X, preserving a (possibly singular) probability measure \tilde\mu, and \phi:X\to S^1 is a C^1 function. Under mild…
The classical work of (Arora et al., 1999) provides a scheme that gives, for any $\epsilon>0$, a polynomial time $1-\epsilon$ approximation algorithm for dense instances of a family of $\mathcal{NP}$-hard problems, such as Max-CUT and…
In this paper we consider uniformly random lozenge tilings of arbitrary domains approximating (after suitable normalization) a closed, simply-connected subset of $\mathbb{R}^2$ with piecewise smooth, simple boundary. We show that the local…
Stack-triangulations appear as natural objects when one wants to define some increasing families of triangulations by successive additions of faces. We investigate the asymptotic behavior of rooted stack-triangulations with $2n$ faces under…
Generalized Polynomial Chaos (gPC) expansions are well established for forward uncertainty propagation in many application areas. Although the associated computational effort may be reduced in comparison to Monte Carlo techniques, for…
This paper develops several average-case reduction techniques to show new hardness results for three central high-dimensional statistics problems, implying a statistical-computational gap induced by robustness, a detection-recovery gap and…
We investigate the asymptotic properties of permutations drawn from the Luce model, a natural probabilistic framework in which permutations are generated sequentially by sampling without replacement, with selection probabilities…
We construct a new family of explicit codes that are list decodable to capacity and achieve an optimal list size of $O(\frac{1}{\epsilon})$. In contrast to existing explicit constructions of codes achieving list decoding capacity, our…
This thesis studies high-dimensional, continuous-valued pairwise Markov Random Fields. We are particularly interested in approximating pairwise densities whose logarithm belongs to a Sobolev space. For this problem we propose the method of…
Random projections are random linear maps, sampled from appropriate distributions, that approx- imately preserve certain geometrical invariants so that the approximation improves as the dimension of the space grows. The well-known…
In this paper we provide several \emph{metric universality} results. We exhibit for certain classes $\cC$ of metric spaces, families of metric spaces $(M_i, d_i)_{i\in I}$ which have the property that a metric space $(X,d_X)$ in $\cC$ is…
We are given a uniformly elliptic coefficient field that we regard as a realization of a stationary and finite-range (say, range unity) ensemble of coefficient fields. Given a (deterministic) right-hand-side supported in a ball of size…