Search Results - (Author, Cooperation:J. Yukich)
-
1S. Bhatt ; D. J. Weiss ; E. Cameron ; D. Bisanzio ; B. Mappin ; U. Dalrymple ; K. E. Battle ; C. L. Moyes ; A. Henry ; P. A. Eckhoff ; E. A. Wenger ; O. Briet ; M. A. Penny ; T. A. Smith ; A. Bennett ; J. Yukich ; T. P. Eisele ; J. T. Griffin ; C. A. Fergus ; M. Lynch ; F. Lindgren ; J. M. Cohen ; C. L. Murray ; D. L. Smith ; S. I. Hay ; R. E. Cibulskis ; P. W. Gething
Nature Publishing Group (NPG)
Published 2015Staff ViewPublication Date: 2015-09-17Publisher: Nature Publishing Group (NPG)Print ISSN: 0028-0836Electronic ISSN: 1476-4687Topics: BiologyChemistry and PharmacologyMedicineNatural Sciences in GeneralPhysicsPublished by: -
2Staff View
ISSN: 1572-9230Keywords: Bipartite matching ; Poisson point processes ; strong limit theoremsSource: Springer Online Journal Archives 1860-2000Topics: MathematicsNotes: Abstract LetX 1,...,X n ,Y 1,...,Y n be i.i.d. with the law μ on the cube [0, 1] d ,d⩾3. LetL n (μ)=infπΣ i=1 n ||X i −Y π(i)|| denote the optimal bipartite matching of theX andY points, where π ranges over all permutations of the integers 1, 2,...,n, and where ‖·‖ is a norm on ℝ d . If μ is Lebesgue measure it is shown that $$\mathop {\lim }\limits_{n \to \infty } L_n (\mu )/n^{(d - 1)/d} = \alpha {\text{a}}{\text{.s}}{\text{.}}$$ where α is a finite constant depending on ‖ ‖ andd only. More generally, for arbitrary μ it is shown that $$\mathop {\lim }\limits_{n \to \infty } L_n (\mu )/n^{(d - 1)/d} = \alpha \int {(f{\text{(}}x{\text{)}})^{(d - 1)/d} dxa.s.} $$ wheref is the density of the absolutely continuous part of μ. We also find the rate of convergence.Type of Medium: Electronic ResourceURL: -
3Staff View
ISSN: 1572-9230Keywords: α-stable distributions ; rate-of-convergence problem ; central limit theorem ; group of motions in ℝdSource: Springer Online Journal Archives 1860-2000Topics: MathematicsNotes: Abstract The rate-of-convergence problem in the central limit theorem is considered for α-stable distributions on the noncommutative group of motions in ℝd. The method used here is based on the theory of probability metrics.Type of Medium: Electronic ResourceURL: -
4Staff View
ISSN: 1432-2064Keywords: 60D05 ; 60F15 ; 60C05Source: Springer Online Journal Archives 1860-2000Topics: MathematicsNotes: Summary LetU 1,...,Un denote i.i.d. random variables with the uniform distribution on [0, 1]2, and letT 2≔T2(U1,...,Un) denote the shortest tour throughU 1,...,Un with square-weighted edges. By drawing on the quasi-additive structure ofT 2 and the boundary rooted dual process, it is shown that lim n→∞ E T 2(U 1,...,Un)= β for some finite constant β.Type of Medium: Electronic ResourceURL: -
5Staff View
ISSN: 1432-2064Source: Springer Online Journal Archives 1860-2000Topics: MathematicsNotes: Summary Let ,n≧1, be a sequence of classes of real-valued measurable functions defined on a probability space (S, ,P). Under weak metric entropy conditions on ,n≧1, and under growth conditions on we show that there are non-zero numerical constantsC 1 andC 2 such that where α(n) is a non-decreasing function ofn related to the metric entropy of . A few applications of this general result are considered: we obtain a.s. rates of uniform convergence for the empirical process indexed by intervals as well as a.s. rates of uniform convergence for the empirical characteristic function over expanding intervals.Type of Medium: Electronic ResourceURL: -
6Staff View
ISSN: 1439-6912Keywords: 05 C 35 ; 90 C 10 ; 52 A 40Source: Springer Online Journal Archives 1860-2000Topics: MathematicsNotes: Abstract We provide a simple and natural method for obtaining the worst case asymptotics of some of the classical problems in combinatorial optimization and operations research. Worst case asymptotics for the minimal spanning tree, shortest tour, and minimal matching onn points are found. The key simplifying idea involves consideration of the associated “boundary” processes. The general approach considered here also handles the case of power weighted edges.Type of Medium: Electronic ResourceURL: -
7Staff View
ISSN: 0029-5981Keywords: Engineering ; Engineering GeneralSource: Wiley InterScience Backfile Collection 1832-2000Topics: MathematicsTechnologyNotes: We outline here a finite element technique for the creep of solids whose constitutive equation contains one or more random parameters. In contrast to other finite element techniques for the prediction of random structural response, the present method is based upon exact relations from the theory of probability. It yields, at a given value of time, the probability density function for the field variable of interest, e.g. stress or displacement components. The method is illustrated by a simple creeping beam problem, using a power-law creep constitutive equation. The calculated distributions are found to be highly skewed, and in excellent agreement with the results of Monte Carlo simulation.Additional Material: 7 Ill.Type of Medium: Electronic ResourceURL: