相关论文: On the Weak Convergence and Central Limit Theorem …

Statistical inference for non-stationary data is hindered by the failure of classical central limit theorems (CLTs), not least because there is no fixed Gaussian limit to converge to. To resolve this, we introduce relative weak convergence,…

In this paper, we derive a central limit theorem for collections of weakly correlated random variables indexed by discrete metric spaces, where the correlation decays in the distance of the indices. The correlation structure we study…

The mean-shift algorithm is a popular algorithm in computer vision and image processing. It can also be cast as a minimum gamma-divergence estimation. In this paper we focus on the "blurring" mean shift algorithm, which is one version of…

In the past decades, weak convergence theory for stochastic processes has become a standard tool for analyzing the asymptotic properties of various statistics. Routinely, weak convergence is considered in the space of bounded functions…

We establish limit theorems involving weak convergence of multiple generations of critical and supercritical branching processes. These results arise naturally when dealing with the joint asymptotic behavior of functionals defined in terms…

We introduce a new extragradient iterative process, motivated and inspired by [S. H. Khan, A Picard-Mann Hybrid Iterative Process, Fixed Point Theory and Applications, doi:10.1186/1687-1812-2013-69], for finding a common element of the set…

Fixed point iterations are a fundamental tool in numerical analysis and scientific computing for the approximation of solutions to nonlinear problems. Their convergence is often established via the Banach fixed point theorem, provided that…

Blurring mean shift (BMS) algorithm, a variant of the mean shift algorithm, is a kernel-based iterative method for data clustering, where data points are clustered according to their convergent points via iterative blurring. In this paper,…

We study the convergence of the weak solution of the porous medium equation with a type of Robin boundary conditions, by tuning a parameter either to zero or to infinity. The convergence is in the strong sense, with respect to the…

This work provides some general theorems about unconditional and conditional weak convergence of empirical processes in the case of Poisson sampling designs. The theorems presented in this work are stronger than previously published…

Motivated by the Central Limit Theorem, in this paper, we study both universal and non-universal simulations of random variables with an arbitrary target distribution $Q_{Y}$ by general mappings, not limited to linear ones (as in the…

Using Fourier analysis, we study local limit theorems in weak-convergence problems. Among many applications, we discuss random matrix theory, some probabilistic models in number theory, the winding number of complex brownian motion and the…

The weak-to-strong generalization phenomenon is the driver for important machine learning applications including highly data-efficient learning and, most recently, performing superalignment. While decades of research have resulted in…

This paper provides refined versions of some known functional central limit theorems for conditional Poisson sampling which are more suitable for applications. The theorems presented in this paper are generalizations of some results that…

In this paper we introduce a notion of tightness for a family of nonlinear expectations and show that the tightness can be applied to obtain weak compactness in a framework of nonlinear expectation space. This criterion is very useful for…

We investigate the effect of weak gravitational lensing in the limit of small angular scales where projected galaxy clustering is strongly nonlinear. This is the regime likely to be probed by future weak lensing surveys. We use…

Many computer vision and image processing applications rely on local features. It is well-known that motion blur decreases the performance of traditional feature detectors and descriptors. We propose an inertial-based deblurring method for…

The main result of this paper is a general central limit theorem for distributions defined by certain renewal type equations. We apply this to weakly self-avoiding random walks. We give good error estimates and Gaussian tail estimates which…

In the vicinity of a solution of a nonlinear programming problem at which both strict complementarity and linear independence of the active constraints may fail to hold, we describe a technique for distinguishing weakly active from strongly…

A central limit theorem is proved for some strictly stationary sequences of random variables that satisfy certain mixing conditions and are subjected to the "shrinking operators" $U_r(x):=[\max\{|x|-r,0\}]\cdot x/|x|,\ r \ge 0$. For…