English
Related papers

Related papers: Whittaker-Kotel'nikov-Shannon approximation of $\v…

200 papers

A weighted Gaussian approximation to tail product-limit process for Pareto-like distributions of randomly right-truncated data is provided and a new consistent and asymptotically normal estimator of the extreme value index is derived. A…

Statistics Theory · Mathematics 2015-07-07 Souad Benchaira , Djamel Meraghni , Abdelhakim Necir

Let $X, X_1, X_2,...$ be a sequence of non-degenerate i.i.d. random variables with mean zero. The best possible weighted approximations are investigated in $D[0, 1]$ for the partial sum processes $\{S_{[nt]}, 0\le t\le 1\}$, where…

Probability · Mathematics 2007-11-12 Miklós Csörgő , Barbara Szyszkowicz , Qiying Wang

We present a systematic short time expansion for the generating function of the one point height probability distribution for the KPZ equation with droplet initial condition, which goes much beyond previous studies. The expansion is checked…

Statistical Mechanics · Physics 2018-11-21 Alexandre Krajenbrink , Pierre Le Doussal , Sylvain Prolhac

Gaussian boson sampling (GBS) is considered a candidate problem for demonstrating quantum advantage. We propose an algorithm for approximate classical simulation of a lossy GBS instance. The algorithm relies on the Taylor series expansion,…

Quantum Physics · Physics 2024-04-02 M. V. Umanskii , A. N. Rubtsov

Gaussian processes are a powerful framework for quantifying uncertainty and for sequential decision-making but are limited by the requirement of solving linear systems. In general, this has a cubic cost in dataset size and is sensitive to…

We consider the problem of Gaussian multiplier bootstrap procedures for the $k$th largest statistics and functions of the top $k$ order statistics, which are commonly encountered in high-dimensional statistical inference. Such a problem has…

Statistics Theory · Mathematics 2026-03-04 Yixi Ding , Qizhai Li , Yuke Shi , Liuquan Sun , Luobin Zhang

We propose and analyze a generalized splitting method to sample approximately from a distribution conditional on the occurrence of a rare event. This has important applications in a variety of contexts in operations research, engineering,…

Methodology · Statistics 2019-09-10 Zdravko I. Botev , Pierre L'Ecuyer

We explore two aspects of geometric approximation via a coupling approach to Stein's method. Firstly, we refine precision and increase scope for applications by convoluting the approximating geometric distribution with a simple translation…

Probability · Mathematics 2024-12-11 Fraser Daly , Claude Lefèvre

We consider upper bounds for the approximation error E|g(X)-g(\hat X)|^p, where X and \hat X are random variables such that \hat X is an approximation of X in the L_p-norm, and the function g belongs to certain function classes, which…

Probability · Mathematics 2007-12-24 Rainer Avikainen

We study an entropy measure for quantum systems that generalizes the von Neumann entropy as well as its classical counterpart, the Gibbs or Shannon entropy. The entropy measure is based on hypothesis testing and has an elegant formulation…

Quantum Physics · Physics 2014-02-19 F. Dupuis , L. Kraemer , P. Faist , J. M. Renes , R. Renner

We present a new quantum algorithm for estimating the mean of a real-valued random variable obtained as the output of a quantum computation. Our estimator achieves a nearly-optimal quadratic speedup over the number of classical i.i.d.…

Quantum Physics · Physics 2021-11-16 Yassine Hamoudi

Sequential change-point detection in non-Gaussian stochastic processes is challenging because the underlying densities are rarely known in real time. Classical parametric procedures such as CUSUM lose optimality under distributional…

Methodology · Statistics 2026-05-28 Serhii Zabolotnii

We derive upper bounds on the Wasserstein distance ($W_1$), with respect to $\sup$-norm, between any continuous $\mathbb{R}^d$ valued random field indexed by the $n$-sphere and the Gaussian, based on Stein's method. We develop a novel…

Probability · Mathematics 2024-05-02 Krishnakumar Balasubramanian , Larry Goldstein , Nathan Ross , Adil Salim

Generalized linear statistics are an unifying class that contains U-statistics, U-quantiles, L-statistics as well as trimmed and winsorized U-statistics. For example, many commonly used estimators of scale fall into this class.…

Statistics Theory · Mathematics 2011-08-19 Martin Wendler

We study rates of convergence in central limit theorems for the partial sum of squares of general Gaussian sequences, using tools from analysis on Wiener space. No assumption of stationarity, asymptotically or otherwise, is made. The main…

Probability · Mathematics 2017-06-09 Soukaina Douissi , Khalifa Es-Sebaiy , Frederi G. Viens

In this paper we revisit random linear under-determined systems with sparse solutions. We consider $\ell_1$ optimization heuristic known to work very well when used to solve these systems. A collection of fundamental results that relate to…

Optimization and Control · Mathematics 2016-12-20 Mihailo Stojnic

We study a class of graphon particle systems with time-varying random coefficients. In a graphon particle system, the interactions among particles are characterized by the coupled mean field terms through an underlying graphon and the…

Systems and Control · Electrical Eng. & Systems 2025-10-02 Yan Chen , Tao Li , Xiaofeng Zong

The theory of sparse stochastic processes offers a broad class of statistical models to study signals. In this framework, signals are represented as realizations of random processes that are solution of linear stochastic differential…

Probability · Mathematics 2017-02-17 Julien Fageot , Virginie Uhlmann , Michael Unser

We consider the problem of inference for the states and parameters of a continuous-time multitype branching process from partially observed time series data. Exact inference for this class of models, typically using sequential Monte Carlo,…

Methodology · Statistics 2025-12-01 Angus Lewis , Antonio Parrella , John Maclean , Andrew J. Black

In the paper "The best m-term approximation and greedy algorithms" (V. N. Temlyakov), an error bound for a near best m-term approximation of a function g in L^p([0,1]^d) is provided, using a basis L^p-equivalent to the Haar system, where p…

Numerical Analysis · Mathematics 2009-10-08 Wolfgang Karcher , Hans-Peter Scheffler , Evgeny Spodarev
‹ Prev 1 8 9 10 Next ›