Strong laws for Euclidean graphs with general edge weights
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[set membership, variant]G, be weighted by a function [phi]. We provide sufficient conditions on G and [phi] guaranteeing that the total edge length functional [summation operator]e[set membership, variant]G [phi](e) satisfies a strong law of large numbers. The limiting constant is shown to depend explicitly on f and [phi].
Volume (Year): 56 (2002)
Issue (Month): 3 (February)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- McGivney, K. & Yukich, J. E., 1999. "Asymptotics for Voronoi tessellations on random samples," Stochastic Processes and their Applications, Elsevier, vol. 83(2), pages 273-288, October.
When requesting a correction, please mention this item's handle: RePEc:eee:stapro:v:56:y:2002:i:3:p:251-259. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.