Longest convex chains

DOI10.1002/rsa.20269zbMath1206.52009arXiv0906.5452OpenAlexW2952164182MaRDI QIDQ3055769

Gergely Ambrus, Imre Bárány

Publication date: 9 November 2010

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0906.5452

zbMATH Keywords

random pointsconcentrationlimit shapesconvex chains

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Random convex sets and integral geometry (aspects of convex geometry) (52A22)

Related Items

Longest increasing paths with Lipschitz constraints ⋮ Large convex holes in random point sets ⋮ On separating points by lines ⋮ Beyond Hammersley's last-passage percolation: a discussion on possible local and global constraints ⋮ Active-learning a convex body in low dimensions

Cites Work

• Unnamed Item
• A variational problem for random Young tableaux
• Probability that \(n\) random points are in convex position
• A new look at independence
• Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
• [https://portal.mardi4nfdi.de/wiki/Publication:5728818 �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten]