On the Number of Reflexive and Shared Nearest Neighbor Pairs in One-Dimensional Uniform Data
From MaRDI portal
Publication:4581305
zbMath1393.05005arXiv1605.01940MaRDI QIDQ4581305
Publication date: 16 August 2018
Full work available at URL: https://arxiv.org/abs/1605.01940
asymptotic normalitylaw of large numberscentral limit theoremrandom permutationexact distributionnearest neighbor graphs and digraphs
Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Permutations, words, matrices (05A05) Directed graphs (digraphs), tournaments (05C20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Intrinsic dimension identification via graph-theoretic methods
- A probabilistic approach to the asymptotics of the length of the longest alternating subsequence
- Graph-theoretic measures of multivariate association and prediction
- Longest alternating subsequences of permutations
- Testing spatial symmetry using contingency tables based on nearest neighbor relations
- Overall and pairwise segregation tests based on nearest neighbor contingency tables
- Sums of functions of nearest neighbor distances, moment bounds, limit theorems and a goodness of fit test
- On nearest-neighbor graphs
- Central limit theorems for some graphs in computational geometry.
- The size of components in continuum nearest-neighbor graphs
- The central limit theorem for dependent random variables
- Nearest neighbors and Voronoi regions in certain point processes
- Mutual and shared neighbor probabilities: finite- and infinite-dimensional results
- On the fraction of random points by specified nearest-neighbour interrelations and degree of attraction
- Reflexive Nearest Neighbours
- Isolated nearest neighbors
- A cluster problem as defined by nearest neighbours
- A Class of Statistics with Asymptotically Normal Distribution
This page was built for publication: On the Number of Reflexive and Shared Nearest Neighbor Pairs in One-Dimensional Uniform Data
