Asymptotic of power-weighted Euclidean functionals (Q1593589): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5729634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit theorems and rates of convergence for Euclidean functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotics for Euclidean functionals with power-weighted edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growth rates of Euclidean minimal spanning trees with power weighted edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability theory of classical Euclidean optimization problems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-4149(98)00065-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037534835 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:23, 30 July 2024

scientific article
Language Label Description Also known as
English
Asymptotic of power-weighted Euclidean functionals
scientific article

    Statements

    Asymptotic of power-weighted Euclidean functionals (English)
    0 references
    0 references
    17 January 2001
    0 references
    For i.i.d. random points \(X_1,\ldots ,X_n\) in \({\mathbb R}^d\) and \(0<p<1\), let \(L(X_1,\ldots ,X_n;p)\) be the minimum of \(\sum _{j=1}^n |X_{\pi (j+1)}-X_{\pi (j)} |^p\) over all permutations \(\pi \) of \(\{ 1,\ldots ,n\}\) (minimal path of the `travelling salesman'). The author shows that, under some regularity conditions posed on the distribution of the \(X_i\)'s, \(n^{(d-p)/d}L(X_1,\ldots ,X_n;p)\) converges to a given constant a.s. and in \(L^1\) (an analogous result was known earlier for \(p\geq 1\)). In fact, a more general result is proved, which yields as particular cases also the asymptotic behavior of the length of an optimal matching and of the length of a minimal spanning tree on \(X_1,\ldots ,X_n\).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    travelling salesman problem
    0 references
    minimal matching
    0 references
    minimal spanning tree
    0 references
    strong law of large numbers
    0 references
    0 references