𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Asymptotics for Euclidean functionals with power-weighted edges

✍ Scribed by C. Redmond; J.E. Yukich

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
796 KB
Volume
61
Category
Article
ISSN
0304-4149

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Estimating the asymptotic constants of t
Estimating the asymptotic constants of the total length of Euclidean minimal spanning trees with power-weighted edges
✍ Mario Cortina-Borja; Tony Robinson πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 80 KB

Steele (1988 , Ann. Probab. 16, 1767-1787) has proved that the total length of several combinatorial optimization problems in R p involving trees with n nodes and -power-weighted edges is asymptotically c(p; )n (p-)=p , where 0 Β‘ 6p. In this paper we obtain bounds for these constants and give esti

Strong laws for Euclidean graphs with ge
Strong laws for Euclidean graphs with general edge weights
✍ RaΓΊl JimΓ©nez; J.E. Yukich πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 123 KB

Consider a random Euclidean graph G with a vertex set consisting of i.i.d. random variables with a common density f. Let the edge lengths |e|; e ∈ G, be weighted by a function . We provide su cient conditions on G and guaranteeing that the total edge length functional e∈G (|e|) satisÿes a strong law