相关论文: Sharp polynomial estimates for the decay of correl…
We conduct an asymptotic risk analysis of the nonlocal means image denoising algorithm for the Horizon class of images that are piecewise constant with a sharp edge discontinuity. We prove that the mean square risk of an optimally tuned…
A new score function is proposed for stack decoding of polar codes, which enables one to accurately compare paths of different lengths. The proposed score function includes bias, which reflects the average behaviour of the correct path.…
The Sinc approximation has shown high efficiency for numerical methods in many fields. Conformal maps play an important role in the success, i.e., appropriate conformal map must be employed to elicit high performance of the Sinc…
A central limit theorem for arrays of symmetric row-wise exchangeable random variables is presented. The result is valid for finite and infinite extendable and non-extendable sequences. Unlike most reported versions of the central limit…
In this paper, we develop a new method to estimate the parameters of a deteriorating system under perfect condition-based maintenance. This method is based on the asymptotical behavior of the system, which is studied by using the renewal…
For non-uniformly expanding maps inducing with a general return time to Gibbs Markov maps, we provide sufficient conditions for obtaining higher order asymptotics for the correlation function in the infinite measure setting. Along the way,…
We study correlation decay for the maximum weight matching problem on sparse graphs with i.i.d. edge weights. We show exponential decay of correlations when the underlying graphs are locally tree-like with uniformly bounded degree and the…
The regularity of integration kernels forces decay rates of singular values of associated integral operators. This is well-known for symmetric operators with kernels defined on $(a,b) \times (a,b)$, where $(a,b)$ is an interval. Over time,…
Recently, there was a substantial progress in the problem of sampling recovery on function classes with mixed smoothness. Mostly, it has been done by proving new and sometimes optimal upper bounds for both linear sampling recovery and for…
We consider the massive scalar field equation $\Box_{g_{RN}} \phi = m^2 \phi$ on any subextremal Reissner--Nordstr\"{o}m exterior metric $g_{RN}$. We prove that solutions with localized initial data decay pointwise-in-time at the polynomial…
In this paper, we investigate the functional central limit theorem for stochastic processes associated to partial sums of additive functionals of reversible Markov chains with general spate space, under the normalization standard deviation…
We consider deterministic random walks on the real line driven by irrational rotations, or equivalently, skew product extensions of a rotation by $\alpha$ where the skewing cocycle is a piecewise constant mean zero function with a jump by…
Selberg's central limit theorem states that the values of $\log|\zeta(1/2+i \tau)|$, where $\tau$ is a uniform random variable on $[T,2T]$, is distributed like a Gaussian random variable of mean $0$ and standard deviation…
This paper establishes quantitative correlation inequalities between monotone events and structured threshold objects in both the discrete cube and Gaussian space. We prove that for any increasing balanced family, there exists a linear…
The paper investigates the problem of performing correlation analysis when the number of observations is very large. In such a case, it is often necessary to combine the random observations to achieve dimensionality reduction of the…
We give a generalization of the ergodic theorem for semi-Markov linear-type processes. This generalization is proved for the case when a common support of distributions defining this process is not arithmetic. Also we give an uniform…
This work is concerned with approximating matrix functions for banded matrices, hierarchically semiseparable matrices, and related structures. We develop a new divide-and-conquer method based on (rational) Krylov subspace methods for…
We study the arithmetic (real) function f=g*1, with g "essentially bounded" and supported over the integers of [1,Q]. In particular, we obtain non-trivial bounds, through f "correlations", for the "Selberg integral" and the "symmetry…
We establish non-asymptotic efficiency guarantees for tensor decomposition-based inference in count data models. Under a Poisson framework, we consider two related goals: (i) parametric inference, the estimation of the full distributional…
We prove a sharp analog of Young's inequality on $S^N$, and deduce from it certain sharp entropy inequalities. The proof turns on constructing a nonlinear heat flow that drives trial functions to optimizers in a monotonic manner. This…