Results 281 to 290 of about 1,582,117 (317)
Some of the next articles are maybe not open access.
Tusnády's problem, the transference principle, and non-uniform QMC sampling
arXiv.org, 2016It is well-known that for every \(N \ge 1\) and \(d \ge 1\) there exist point sets \(x_1, \dots , x_N \in [0,1]^d\) whose discrepancy with respect to the Lebesgue measure is of order at most \((\log N)^{d-1} N^{-1}\). In a more general setting, the first
C. Aistleitner +2 more
semanticscholar +1 more source
New Non-uniform Bounds on Poisson Approximation for Dependent Bernoulli Trials
Bulletin of the Malaysian Mathematical Sciences Society, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Estimates on Non-uniform Stability for Bounded Semigroups
2015Let S(t) be a bounded strongly continuous semigroup on a Banach space, with generator −A. Assume that the spectrum of A has empty intersection with the imaginary axis. In [6], Charles J.K. Batty and the author have given an estimate of the decay of the operator norm of \(S(t)(1+A)^{-1}\), as t tends to infinity, in terms of asymptotic bounds of the ...
openaire +1 more source
Non–uniform bound of normal approximation for Combinatorial random sums
2023In 2017, Frolov gave a uniform bound of normal approximation for combinatorial random sums. In this thesis, we find a non-uniform bound and investigate this bound for the random sums with random numbers having Poisson distributions.
openaire +1 more source
Adaptive Algorithms Using Bounded Memory Are Inherently Non-uniform
2006Distributed protocols that run in dynamic environments such as the Internet are often not able to use an upper bound on the number of potentially participating processes. In these settings adaptive and uniform algorithms are desirable where the step complexity of all operations is a function of the number of concurrently participating processes ...
openaire +1 more source
Journal of Mathematical Sciences, 2016
S. Nagaev, V. Chebotarev, A. Zolotukhin
semanticscholar +2 more sources
S. Nagaev, V. Chebotarev, A. Zolotukhin
semanticscholar +2 more sources
2023
This dissertation contains two main parts. First, we give a non-uniform exponential bound on normal approximation by using the Stein’s method and bounded monotone size biased couplings. Second, applications of the main theorem to give the bound on normal approximation for sum of independent random variables, the number of bulbs on at the terminal time ...
openaire +1 more source
This dissertation contains two main parts. First, we give a non-uniform exponential bound on normal approximation by using the Stein’s method and bounded monotone size biased couplings. Second, applications of the main theorem to give the bound on normal approximation for sum of independent random variables, the number of bulbs on at the terminal time ...
openaire +1 more source
An improvement of a non-uniform bound for combinatorial central limit theorem
, 2019Patcharee Sumritnorrapong +2 more
semanticscholar +1 more source
A Non-Uniform Bound on Normal Approximation of Randomized Orthogonal Array Sampling Designs
, 2007K. Laipaporn, K. Neammanee
semanticscholar +1 more source

