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

DOI10.1239/AAP/1127483737zbMATH Open1081.60006OpenAlexW1974804467MaRDI QIDQ5697192FDOQ5697192

Ery Arias-Castro, David 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

Recommendations

• On the number of rational points on a strictly convex curve
• Adaptive multiscale detection of filamentary structures in a background of uniform random points
• Convex curves and a Poisson imitation of lattices
• Entropy of the space of twice smooth curves in \({\mathbb{R}}^{n+1}\)
• scientific article; zbMATH DE number 3871491

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)

Cites Work

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

Cited In (11)

• Average case analysis of disk scheduling, increasing subsequences and spacetime geometry
• Networks of polynomial pieces with application to the analysis of point clouds and images
• Manifold estimation and singular deconvolution under Hausdorff loss
• Linear versus non-linear acquisition of step-functions
• Title not available (Why is that?)
• On the number of rational points on a strictly convex curve
• Optimal boarding policies for thin passengers
• \(l_p\)-recovery of the most significant subspace among multiple subspaces with outliers
• How many rational points does a random curve have?
• Adaptive multiscale detection of filamentary structures in a background of uniform random points
• Spectral clustering based on local linear approximations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5697192)