中文
相关论文

相关论文: Explicit bounds for the approximation error in Ben…

200 篇论文

We consider the approximation of a convolution of possibly different probability measures by (compound) Poisson distributions and also by related signed measures of higher order. We present new total variation bounds having a better…

概率论 · 数学 2017-03-08 Bero Roos

We study multi-digit correlations in Benford sequences b^n for integer bases 2 <= b <= 1000, measuring dependence via conditional mutual information (CMI). A resonance ratio derived from the continued fraction expansion of log_10(b)…

数论 · 数学 2026-03-20 James M. Hyman

An estimate of the order of approximation in the central limit theorem for strictly stationary associated random variables with finite moments of order q > 2 is obtained. A moderate deviation result is also obtained. We have a refinement of…

概率论 · 数学 2017-09-19 M. Sreehari

We adapt Stein's method of diffusion approximations, developed by Barbour, to the study of chaotic dynamical systems. We establish an error bound in the functional central limit theorem with respect to an integral probability metric of…

动力系统 · 数学 2025-11-05 Juho Leppänen , Yuto Nakajima , Yushi Nakano

This paper proposes a novel approach for statistical modelling of a continuous random variable $X$ on $[0, 1)$, based on its digit representation $X=.X_1X_2\ldots$. In general, $X$ can be coupled with a latent random variable $N$ so that…

统计方法学 · 统计学 2025-12-10 Mario Beraha , Jesper Møller

For normalized sums $Z_n$ of i.i.d. random variables, we explore necessary and sufficient conditions which guarantee the normal approximation with respect to the R\'enyi divergence of infinite order. In terms of densities $p_n$ of $Z_n$,…

概率论 · 数学 2024-06-21 Sergey G. Bobkov , Friedrich Götze

This paper starts by considering the minimization of the Renyi divergence subject to a constraint on the total variation distance. Based on the solution of this optimization problem, the exact locus of the points $\bigl( D(Q\|P_1),…

信息论 · 计算机科学 2015-10-27 Igal Sason

Let $M_n$ be the minimal position at generation $n$, of a real-valued branching random walk in the boundary case. As $n \to \infty$, $M_n- {3 \over 2} \log n$ is tight (see [1][9][2]). We establish here a law of iterated logarithm for the…

概率论 · 数学 2017-07-06 Yueyun Hu

Let $X$ be a random variable with distribution function $F,$ and $X_{1},X_{2},...,X_{n}$ are independent copies of $X.$ Consider the order statistics $X_{i:n},$ $i=1,2,...,n$ and denote $F_{i:n}(x)=P\{X_{i:n}\leq x\}.$ Using majorization…

统计理论 · 数学 2011-09-02 Ismihan Bairamov

Nonextensive statistics, characterized by a nonextensive parameter $q$, is a promising and practically useful generalization of the Boltzmann statistics to describe power-law behaviors from physical and social observations. We here explore…

数据分析、统计与概率 · 物理学 2011-03-07 Lijing Shao , Bo-Qiang Ma

In this work, we deal with approximations for distribution functions of non-negative random variables. More specifically, we construct continuous approximants using an acceleration technique over a well-know inversion formula for Laplace…

统计理论 · 数学 2010-10-12 Carmen Sangüesa

We derive two probabilistic bounds for the relative forward error in the floating point summation of $n$ real numbers, by representing the roundoffs as independent, zero-mean, bounded random variables. The first probabilistic bound is based…

数值分析 · 数学 2021-05-31 Johnathan Rhyne

This paper derives new bounds on the difference of the entropies of two discrete random variables in terms of the local and total variation distances between their probability mass functions. The derivation of the bounds relies on maximal…

信息论 · 计算机科学 2016-11-17 Igal Sason

We prove normal approximation bounds for statistics of randomly weighted (simplicial) complexes. In particular, we consider the complete $d$-dimensional complex on $n$ vertices with $d$-simplices equipped with i.i.d. weights. Our normal…

概率论 · 数学 2024-07-18 Shu Kanazawa , Khanh Duy Trinh , D. Yogeshwaran

We give a "regularity lemma" for degree-d polynomial threshold functions (PTFs) over the Boolean cube {-1,1}^n. This result shows that every degree-d PTF can be decomposed into a constant number of subfunctions such that almost all of the…

计算复杂性 · 计算机科学 2015-03-13 Ilias Diakonikolas , Rocco A. Servedio , Li-Yang Tan , Andrew Wan

Let $K(=K_{n,\theta})$ be a positive integer-valued random variable whose distribution is given by ${\rm P}(K = x) = \bar{s}(n,x) \theta^x/(\theta)_n$ $(x=1,\ldots,n) $, where $\theta$ is a positive number, $n$ is a positive integer,…

统计理论 · 数学 2022-03-29 Koji Tsukuda

Consider a set P of N random points on the unit sphere of dimension $d-1$, and the symmetrized set S = P union (-P). The halving polyhedron of S is defined as the convex hull of the set of centroids of N distinct points in S. We prove that…

计算几何 · 计算机科学 2014-04-25 Quentin Mérigot

We investigate lower bounds for the variance in arithmetic progressions of certain multiplicative functions "close" to $1$. Specifically, we consider $\alpha_N$-fold divisor functions, when $\alpha_N$ is a sequence of positive real numbers…

数论 · 数学 2021-02-23 Daniele Mastrostefano

This paper introduces a novel error estimator for the Proper Generalized Decomposition (PGD) approximation of parametrized equations. The estimator is intrinsically random: It builds on concentration inequalities of Gaussian maps and an…

数值分析 · 数学 2019-10-28 Kathrin Smetana , Olivier Zahm

In 2004, J.C. Tong found bounds for the approximation quality of a regular continued fraction convergent of a rational number, expressed in bounds for both the previous and next approximation. We sharpen his results with a geometric method…

数论 · 数学 2009-08-25 Cor Kraaikamp , Ionica Smeets