Connect the dots: how many random points can a regular curve pass through?

DOI10.1239/aap/1127483737zbMath1081.60006OpenAlexW1974804467MaRDI QIDQ5697192

Ery Arias-Castro, David L. Donoho, Craig A. Tovey, Xiaoming Huo

Publication date: 17 October 2005

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/aap/1127483737

zbMATH Keywords

entropypattern recognitionconcentration of measurelongest increasing subsequencecurve detectionconnect-the-darts problemconnect-the-dots problem

Mathematics Subject Classification ID

Random fields; image analysis (62M40) Geometric probability and stochastic geometry (60D05)

Related Items (8)

Networks of polynomial pieces with application to the analysis of point clouds and images ⋮ Spectral clustering based on local linear approximations ⋮ Manifold estimation and singular deconvolution under Hausdorff loss ⋮ \(l_p\)-recovery of the most significant subspace among multiple subspaces with outliers ⋮ Average case analysis of disk scheduling, increasing subsequences and spacetime geometry ⋮ Linear versus non-linear acquisition of step-functions ⋮ Adaptive multiscale detection of filamentary structures in a background of uniform random points ⋮ Optimal boarding policies for thin passengers

Cites Work

• On the length of the longest monotone subsequence in a random permutation
• A variational problem for random Young tableaux
• Wedgelets: Nearly minimax estimation of edges
• Universality at the edge of the spectrum in Wigner random matrices.
• Ulam's problem and Hammersley's process
• Concentration of measure and isoperimetric inequalities in product spaces
• Adaptive multiscale detection of filamentary structures in a background of uniform random points
• Irregularities of distribution. III
• The shortest path and the shortest road through n points
• Near-Optimal Detection of Geometric Objects by Fast Multiscale Methods
• On the distribution of the length of the longest increasing subsequence of random permutations
• Entropies of Sets of Functions of Bounded Variation
• Geometric discrepancy. An illustrated guide
• On the distributions of the lengths of the longest monotone subsequences in random words
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Connect the dots: how many random points can a regular curve pass through?