English
Related papers

Related papers: A note on a new exponential bound for M-acceptable…

200 papers

We introduce a new model for sums of exchangeable binary random variables. The proposed distribution is an approximation to the exact distributional form, and relies on the theory of completely monotone functions and the Laplace transform…

Methodology · Statistics 2020-11-18 Ryan Elmore

We prove the following superexponential distribution inequality: for any integrable $g$ on $[0,1)^{d}$ with zero average, and any $\lambda>0$ \[ |\{ x \in [0,1)^{d} \; :\; g \geq\lambda \}| \leq e^{-…

Analysis of PDEs · Mathematics 2017-11-21 Paata Ivanisvili , Sergei Treil

For arrays $(S_{i,j})_{1\leq i\leq j}$ of random variables that are stationary in an appropriate sense, we show that the fluctuations of the process $(S_{1,n})_{n=1}^{\infty}$ can be bounded in terms of a measure of the ``mean…

Dynamical Systems · Mathematics 2016-09-07 Michael Hochman

An approach is suggested defining effective sums of divergent series in the form of self-similar exponential approximants. The procedure of constructing these approximants from divergent series with arbitrary noninteger powers is developed.…

Statistical Mechanics · Physics 2009-10-31 V. I. Yukalov , S. Gluzman

Let S_n=X_1+...+X_n be a sum of independent symmetric random variables such that |X_{i}|\leq 1. Denote by W_n=\epsilon_{1}+...+\epsilon_{n} a sum of independent random variables such that \prob{\eps_i = \pm 1} = 1/2. We prove that…

Probability · Mathematics 2019-11-13 Dainius Dzindzalieta , Matas Šileikis , Tomas Juškevičius

We present new counterexamples, which provide stronger limitations to sums-differences statements than were previously known. The main idea is to consider non-uniform probability measures.

Combinatorics · Mathematics 2014-10-06 Marius Lemm

This paper expands and improves on the general Sieve method. This expaned and improved Sieve is applied to Goldbach's problem. A new estimate of the exception set in Goldbach's number E(X), an improved lower bound D_{1,2}(N) and upper bound…

Number Theory · Mathematics 2009-04-23 Cheng Hui Ren

In statistical inference problems, we wish to obtain lower bounds on the minimax risk, that is to bound the performance of any possible estimator. A standard technique to obtain risk lower bounds involves the use of Fano's inequality. In an…

Information Theory · Computer Science 2018-04-06 Ramji Venkataramanan , Oliver Johnson

For a sample of Exponentially distributed durations we aim at point estimation and a confidence interval for its parameter. A duration is only observed if it has ended within a certain time interval, determined by a Uniform distribution.…

Methodology · Statistics 2021-10-19 Rafael Weißbach , Dominik Wied

An inequality, recently proposed by Franson [Phys. Rev. A 54, 3808 (1996)] is analyzed and improved. The inequality connects the change of the expectation value of an observable with the uncertainty of this observable. A strict bound on the…

Quantum Physics · Physics 2009-10-30 Lev Vaidman , Ori Belkind

Exponential error bounds achievable by universal coding and decoding are derived for frame-asynchronous discrete memoryless %asynchronous multiple access channels with two senders, via the method of subtypes, a refinement of the method of…

Information Theory · Computer Science 2020-02-04 Lóránt Farkas , Tamás Kói

Let $\mathcal{A}=\{a_{n}\}_{n=1}^{\infty}$ and $\mathcal{B}=\{b_{n}\}_{n=1}^{\infty}$ be two sequences of positive integers (not necessarily distinct). Under some restrictions on $\mathcal{A}$ and $\mathcal{B}$, we obtain a lower bound for…

Number Theory · Mathematics 2026-01-22 Artyom Radomskii

Let $\varepsilon_1,\ldots,\varepsilon_n$ be independent identically distributed Rademacher random variables, that is $\mathbb{P}\{\varepsilon_i=\pm1\}=1/2$. Let $S_n=a_1\varepsilon_1+\cdots+a_n\varepsilon_n$, where…

Probability · Mathematics 2015-06-02 Vidmantas Kastytis Bentkus , Dainius Dzindzalieta

We give a new bound of concurrence.

Quantum Physics · Physics 2015-05-18 Zhihao Ma , Jing-Ling Chen

We show that any pair $X, Y$ of independent, non-compactly supported random variables on $[0,\infty)$ satisfies $\liminf_{m\to\infty} \mathbb{P}(\min(X,Y) >m \,| \,X+Y> 2m) =0$. We conjecture multi-variate and weighted generalizations of…

Probability · Mathematics 2020-08-05 Naomi Dvora Feldheim , Ohad Noy Feldheim

We give lower bounds on the case of worst inhomogeneous approximation.

Number Theory · Mathematics 2016-03-22 Chris Pinner

Let ${X_1,...,X_n}$ be i.i.d. random observations. Let $\mathbb{S}=\mathbb{L}+\mathbb{T}$ be a $U$-statistic of order $k\ge2$ where $\mathbb{L}$ is a linear statistic having asymptotic normal distribution, and $\mathbb{T}$ is a…

Probability · Mathematics 2009-12-14 Vidmantas Bentkus , Bing-Yi Jing , Wang Zhou

In this paper, we give a new inequality for convex functions of real variables, and we apply this inequality to obtain considerable generalizations, refinements, and reverses of the Young and Heinz inequalities for positive scalars.…

Functional Analysis · Mathematics 2017-03-23 Yousef Al-Manasrah , Fuad Kittaneh

The paper focuses on general properties of parametric minimum contrast estimators. The quality of estimation is measured in terms of the rate function related to the contrast, thus allowing to derive exponential risk bounds invariant with…

Statistics Theory · Mathematics 2009-01-07 Yuri Golubev , Vladimir Spokoiny

We consider the problem of modulation and estimation of a random parameter $U$ to be conveyed across a discrete memoryless channel. Upper and lower bounds are derived for the best achievable exponential decay rate of a general moment of the…

Information Theory · Computer Science 2016-11-17 Neri Merhav