Results 271 to 280 of about 22,626 (299)
Some of the next articles are maybe not open access.
A non-uniform bound on Poisson approximation in somatic cell hybrid model
Mathematical Biosciences, 2005The aim of this paper is a use of the Stein-Chen method to give a non-uniform bound for approximating the point probabilities of the number of pairs of chromosomes for which the Hamming distance is less than some fixed Hamming distance d by Poisson distribution.
Teerapabolarn, K., Neammanee, K.
openaire +3 more sources
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
Correcting and Speeding-Up Bounds for Non-Uniform Graph Edit Distance
2017 IEEE 33rd International Conference on Data Engineering (ICDE), 2017The problem of deriving lower and upper bounds for the edit distance between labelled undirected graphs has recently received increasing attention. However, only one algorithm has been proposed that allegedly computes not only an upper but also a lower bound for non-uniform metric edit costs and incorporates information about both node and edge labels.
David B. Blumenthal, Johann Gamper
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
Voigt-Reuss and Hashin-Shtrikman bounds revisited
International Journal of Engineering Science, 2023Damian Stefaniuk
exaly
This thesis contains two main parts. In the first part, let (a[subscript ij]) and (b[subscript ij]) be n x n matrices of real numbers and pi a random permutation of {1, 2, ...,n}. Under a boundedness condition, we establish non-uniform bounds in normal approximation for V and W by using a concentration inequality approach of Stein's method.
openaire +1 more source
openaire +1 more source