Mathew D. Penrose, J. E. Yukich
We consider the sum of power weighted nearest neighbor distances in a sample of size n from a multivariate density f of possibly unbounded support. We give various criteria guaranteeing that this sum satisfies a law of large numbers for large n, correcting some inaccuracies in the literature on the way. Motivation comes partly from the problem of consistent estimation of certain entropies of f.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Under the unifying umbrella of a general result of Penrose & Yukich [Ann. Appl. Probab., (2003) 13, 277--303] we give laws of large numbers (in the $L^p$ sense) for the total power-weighted length of several nearest-neighbour type graphs on random point sets in $\R^d$, $d\in\N$. Some of these results are known; some are new. We give limiting constants explicitly, where previously they have been evaluated in less generality or not at all. The graphs we consider include the k-nearest neighbours graph, the Gabriel graph, the minimal directed spanning forest, and the on-line nearest-neighbour grap…
In this note, we discuss a proof in T. Liggett's work on attractive translation invariant nearest neighbor spin systems on the integers. A correction to a wrong estimate is provided.
We consider transient nearest neighbor random walks on the positive part of the real line. We give criteria for the finiteness of the number of cutpoints and strong cutpoints. Examples and open problems are presented.
Let $X_1,\ldots,X_n$ be a sequence of independent random points in $\mathbb{R}^d$ with common Lebesgue density $f$. Under some conditions on $f$, we obtain a Poisson limit theorem, as $n \to \infty$, for the number of large probability $k$th-nearest neighbor balls of $X_1,\ldots,X_n$. Our result generalizes Theorem 2. of [10], which refers to the special case $k=1$. Our proof is completely different since it employs the Chen-Stein method instead of the method of moments. Moreover, we obtain a rate of convergence for the Poisson approximation.
We revisit the $R-$positivity of nearest neighbors matrices on ${\ZZ_+}$ and the Gibbs measures on the set of nearest neighbors trajectories on ${\ZZ_+}$ whose Hamiltonians award either visits to sites a or visits to edges. We give conditions that guarantee the $R-$positivity or equivalently the existence of the infinite volume Gibbs measure, and we show geometrical recurrence of the associated Markov chain. In this work we generalize and sharpen results obtained in [3] and [6].
In this work we consider the mean field traveling salesman problem, where the intercity distances are taken to be i.i.d. with some distribution $F$. This paper focus on the \emph{nearest neighbor tour} which is to move to the nearest non-visited city and we show that under some conditions on $F$, which are satisfied by exponential distribution with constant mean, the total length of the nearest neighbor tour, asymptotically almost surely scales as $\log n$. Similar result is known for Euclidean TSP and nearest neighbor tour. We further derive the limiting behavior of the total length of the ne…
Consider a nearest-neighbor random walk with certain asymptotically zero drift on the positive half line. Let $M$ be the maximum of an excursion starting from $1$ and ending at $0.$ We study the distribution of $M$ and characterize its asymptotics, which is quite different from those of simple random walks.
Let $n$ points be placed independently in $d-$dimensional space according to the standard $d-$dimensional normal distribution. Let $d_n$ be the longest edge length for the nearest neighbor graph on these points. We show that \[\lim_{n \rar \infty} \frac{\sqrt{\log n} d_n}{\log \log n} = \frac{d}{\sqrt{2}}, \qquad d \geq 2, {a.s.} \]
If $(ω(e))$ is a family of random variables (weights) assigned to the edges of $\mathbb{Z}^d$, the nearest neighbor graph is the directed graph induced by all edges $\langle x,y \rangle$ such that $ω(\{x,y\})$ is minimal among all neighbors $y$ of $x$. That is, each vertex points to its closest neighbor, if the weights are viewed as edge-lengths. Nanda-Newman introduced nearest neighbor graphs when the weights are i.i.d. and continuously distributed and proved that a.s., all components of the undirected version of the graph are finite. We study the case of translation invariant, distinct weigh…
Let $X_1, \ldots, X_n$ be independent random points drawn from an absolutely continuous probability measure with density $f$ in $\mathbb{R}^d$. Under mild conditions on $f$, we derive a Poisson limit theorem for the number of large probability nearest neighbor balls. Denoting by $P_n$ the maximum probability measure of nearest neighbor balls, this limit theorem implies a Gumbel extreme value distribution for $nP_n - \ln n$ as $n \to \infty$. Moreover, we derive a tight upper bound on the upper tail of the distribution of $nP_n - \ln n$, which does not depend on $f$.
We establish a characterization of the class of the simplest nearest neighbor spin systems possesing the mean coverage function (mcf) that obeys a second order differential equation, and derive explicit expressions for the mcf's of the above models. Based on these expressions, the problem of ergodicity of the models is studied and bounds for their spectral gaps are obtained.
In this article, we will explore why Karlin-McGregor method of using orthogonal polynomials in the study of Markov processes was so successful for one dimensional nearest neighbor processes, but failed beyond nearest neighbor transitions. We will proceed by suggesting and testing possible fixtures.
Graph Laplacians on Shared Nearest Neighbor graphs and graph Laplacians on $k$-Nearest Neighbor graphs having the same limit
针对高维数据中广泛使用但缺乏理论支撑的共享最近邻（SNN）图，本文首次证明其图拉普拉斯算子的大规模渐近性质达到与$k$-NN图相同的连续统极限，并给出了高概率下的线性逐点收敛速率。
We start with certain joint densities (for sides and for angles) corresponding to pinned Poissonian triangles in the plane, then discuss analogous results for staked and anchored triangles.
Graph-based approaches are empirically shown to be very successful for the nearest neighbor search (NNS). However, there has been very little research on their theoretical guarantees. We fill this gap and rigorously analyze the performance of graph-based NNS algorithms, specifically focusing on the low-dimensional (d << \log n) regime. In addition to the basic greedy algorithm on nearest neighbor graphs, we also analyze the most successful heuristics commonly used in practice: speeding up via adding shortcut edges and improving accuracy via maintaining a dynamic list of candidates. We believe …
The deviation principles of record numbers in random walk models have not been completely investigated, especially for the non-nearest neighbor cases. In this paper, we derive the asymptotic probabilities of large and moderate deviations for the number of "weak records"(or "ladder points") in two kinds of one-dimensional non-nearest neighbor random walks. The proofs depend only on the direct analysis of random walks. We illustrate that the traditional method of analyzing the local time of Brownian motions, which is often adopted for the simple random walks, would lead to wrong conjectures for …
The property of almost every point being a Lebesgue point has proven to be crucial for the consistency of several classification algorithms based on nearest neighbors. We characterize Lebesgue points in terms of a 1-Nearest Neighbor regression algorithm for pointwise estimation, fleshing out the role played by tie-breaking rules in the corresponding convergence problem. We then give an application of our results, proving the convergence of the risk of a large class of 1-Nearest Neighbor classification algorithms in general metric spaces where almost every point is a Lebesgue point.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。