AbstractWe provide general and relatively simple conditions under which Euclidean functionals Lp on [0, 1]d with pth power-weighted edges satisfy the limit limn→∞ Lp(X1,…,Xn)/nd−pd = β ∫[0,1]dƒ(x)d−pddx c.c.,where Xi, i ≥ 1, are i.i.d. random variables with values in [0, 1]d, 0 < p < d, β:=β(Lp, d) is a constant, f is the density of the absolutely continuous part of the law of X1, and c.c denotes complete convergence. This general result is shown to apply to the minimal spanning tree, shortest tour, and minimal matching functionals. The approach provides a rate of convergence for the power-weighted minimal spanning tree functional, resolving a question raised by Steele (1988)
This paper is concerned with power-weighted weight functionals associated with a minimal graph span-...
We show that the number of vertices of degree k in the Euclidean minimal spanning tree through point...
Let Xn = {x_1, ..., x_n}, be an i.i.d. sample having multivariate distribution P . We derive a.s. li...
AbstractWe provide general and relatively simple conditions under which Euclidean functionals Lp on ...
AbstractLet {Xi:i⩾1} be i.i.d. points in Rd, d⩾2, and let LMM({X1,…,Xn},p), LMST({X1,…,Xn},p), LTSP(...
Let Xi, 1 ≤ i \u3c ∞, denote independent random variables with values in Rd, d ≥ 2, and let Mn denot...
AbstractLet {Xi:i⩾1} be i.i.d. uniform points on [−1/2,1/2]d, d⩾2, and for 0<p<∞. Let L({X1,…,Xn},p)...
AbstractFor all p⩾1 let Mp(X1,…,Xn) denote the length of the minimal spanning tree through random va...
For all p[greater-or-equal, slanted]1 let Mp(X1,...,Xn) denote the length of the minimal spanning tr...
Abstract. Kesten and Lee [23] proved that the total length of a mini-mal spanning tree on certain ra...
Asymptotic results for the Euclidean minimal spanning tree on n random vertices in Rd can be obtaine...
This paper is concerned with power-weighted weight functionals associated with a minimal graph spann...
In Bhatt and Roy's minimal directed spanning tree construction for a random, partially ordered set o...
If we are given n random points in the hypercube [0,1]d, then the minimum length of a Traveling Sale...
We consider several random spatial graphs of the nearest-neighbour type, including the k- nearest ne...
This paper is concerned with power-weighted weight functionals associated with a minimal graph span-...
We show that the number of vertices of degree k in the Euclidean minimal spanning tree through point...
Let Xn = {x_1, ..., x_n}, be an i.i.d. sample having multivariate distribution P . We derive a.s. li...
AbstractWe provide general and relatively simple conditions under which Euclidean functionals Lp on ...
AbstractLet {Xi:i⩾1} be i.i.d. points in Rd, d⩾2, and let LMM({X1,…,Xn},p), LMST({X1,…,Xn},p), LTSP(...
Let Xi, 1 ≤ i \u3c ∞, denote independent random variables with values in Rd, d ≥ 2, and let Mn denot...
AbstractLet {Xi:i⩾1} be i.i.d. uniform points on [−1/2,1/2]d, d⩾2, and for 0<p<∞. Let L({X1,…,Xn},p)...
AbstractFor all p⩾1 let Mp(X1,…,Xn) denote the length of the minimal spanning tree through random va...
For all p[greater-or-equal, slanted]1 let Mp(X1,...,Xn) denote the length of the minimal spanning tr...
Abstract. Kesten and Lee [23] proved that the total length of a mini-mal spanning tree on certain ra...
Asymptotic results for the Euclidean minimal spanning tree on n random vertices in Rd can be obtaine...
This paper is concerned with power-weighted weight functionals associated with a minimal graph spann...
In Bhatt and Roy's minimal directed spanning tree construction for a random, partially ordered set o...
If we are given n random points in the hypercube [0,1]d, then the minimum length of a Traveling Sale...
We consider several random spatial graphs of the nearest-neighbour type, including the k- nearest ne...
This paper is concerned with power-weighted weight functionals associated with a minimal graph span-...
We show that the number of vertices of degree k in the Euclidean minimal spanning tree through point...
Let Xn = {x_1, ..., x_n}, be an i.i.d. sample having multivariate distribution P . We derive a.s. li...