Let denote a bipartite distance-regular graph with diameter D β₯ 4 and valency k β₯ 3. Let ΞΈ 0 > ΞΈ 1 > β’ β’ β’ > ΞΈ D denote the eigenvalues of and let E 0 , E 1 , . . . , E D denote the associated primitive idempotents. Fix s (1 β€ s β€ D -1) and abbreviate E := E s . We say E is a tail whenever the entry
On Tail Distribution of Interpost Distance
β Scribed by Jeong Han Kim; Boris Pittel
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 101 KB
- Volume
- 80
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We derive new estimates for the error term in the binomial approximation to the distance distribution of extended Goppa codes. This is an improvement on the earlier bounds by Vladuts and Skorobogatov, and Levy and Litsyn.
This study was conducted to assess the effects of zinc and lead on genetic variability of minnow populations (Gambusia affinis, Pimephales notatus, and Fundulus notatus) sampled from two creeks, one receiving mine drainage (Willow Creek) and one reference (Brush Creek), in the Tri-State Mining Distr
## Abstract Tail distribution bounds play a major role in the estimation of failure probabilities in performance and reliability analysis of systems. They are usually estimated using Markov's and Chebyshev's inequalities, which represent tail distribution bounds for a random variable in terms of it
Let x be a real number in [0, 1], F n be the Farey sequence of order n and \ n (x) be the distance between x and F n . Assuming that n Γ we derive the asymptotic distributions of the functions n 2 \ n (x) and n\ n (x$Γn), 0 x$ n. We also establish the asymptotics for 1 0 \ $ n (x) dx, for all real $