Results 1 to 10 of about 431,042 (280)

Non-uniform Berry–Esseen bounds via Malliavin–Stein method

open access: yesComptes Rendus. Mathématique
In this paper, we establish non-uniform Berry–Esseen bounds by means of the Malliavin–Stein method. Applications to the multiple Wiener–Itô integrals and the exponential functionals of Brownian motion are given to illustrate the theory.
Tien Dung, Nguyen   +2 more
doaj   +3 more sources

Improvements of Poisson approximation for n-dimensional unit cube random graph [PDF]

open access: yesSongklanakarin Journal of Science and Technology (SJST), 2021
This paper uses the Stein-Chen method to obtain uniform and non-uniform bounds in the Poisson approximation for the n-dimensional unit cube random graph. These bounds are re-established under the restriction of Poisson mean λ = 1.
Kanint Teerapabolarn
doaj   +1 more source

On the Sizes of (k, l)-Edge-Maximal r-Uniform Hypergraphs

open access: yesDiscussiones Mathematicae Graph Theory, 2023
Let H = (V, E) be a hypergraph, where V is a set of vertices and E is a set of non-empty subsets of V called edges. If all edges of H have the same cardinality r, then H is an r-uniform hypergraph; if E consists of all r-subsets of V, then H is a ...
Tian Yingzhi   +3 more
doaj   +1 more source

A non-uniform bound for translated Poisson approximation [PDF]

open access: yesElectronic Journal of Probability, 2004
Let $X_1, ldots , X_n$ be independent, integer valued random variables, with $p^{text{th}}$ moments, $p >2$, and let $W$ denote their sum. We prove bounds analogous to the classical non-uniform estimates of the error in the central limit theorem, but now, for approximation of $law(W)$ by a translated Poisson distribution.
Barbour, A.D., Choi, K.P.
openaire   +4 more sources

New bounds on Poisson approximation to the distribution of a sum of negative binomial random variables [PDF]

open access: yesSongklanakarin Journal of Science and Technology (SJST), 2018
The Stein-Chen method is usedto give new bounds, non-uniform bounds, for the distances between the distribution of a sum of independent negative binomial random variables and a Poisson distribution with mean, where ri and pi = 1-qi are parameters of ...
Kanint Teerapabolarn
doaj   +1 more source

Finite-state Strategies in Delay Games [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2017
What is a finite-state strategy in a delay game? We answer this surprisingly non-trivial question and present a very general framework for computing such strategies: they exist for all winning conditions that are recognized by automata with acceptance ...
Martin Zimmermann
doaj   +1 more source

Optimal Non-Uniform Sampling by Branch-and-Bound Approach for Speech Coding [PDF]

open access: yesIEEE Access, 2022
Speech coding plays a significant role in voice communication and improving network bandwidth efficiency for applications that require long-distance communication or storage space utilization. Non-uniform sampling (NUS) is a technique for the same, which performs data reduction by sampling at irregular intervals.
Sakshi Pandey, Amit Banerjee
openaire   +2 more sources

Celestial Spectrum Velocimetry With Non-Linear Fourier Phase Shift and Its CRLB

open access: yesIEEE Access, 2022
To solve the problem of the non-linear Fourier phase shift caused by the wavelength shift in the celestial spectrum velocimetry, a celestial spectrum velocimetry method based on non-uniform discrete Fourier transform and compressed sensing is proposed ...
Zijun Zhang, Jin Liu, Xiaolin Ning
doaj   +1 more source

An Improvement on the Upper Bounds of the Partial Derivatives of NURBS Surfaces

open access: yesMathematics, 2020
The Non-Uniform Rational B-spline (NURBS) surface not only has the characteristics of the rational Bézier surface, but also has changeable knot vectors and weights, which can express the quadric surface accurately.
Ye Tian   +4 more
doaj   +1 more source

Sharp indistinguishability bounds from non-uniform approximations

open access: yesCoRR, 2021
We study the problem of distinguishing between two symmetric probability distributions over $n$ bits by observing $k$ bits of a sample, subject to the constraint that all $k-1$-wise marginal distributions of the two distributions are identical to each other. Previous works of Bogdanov et al.
openaire   +4 more sources

Home - About - Disclaimer - Privacy