Papers › Hamilton-Jacobi scaling limits of Pareto peeling in 2D
Hamilton-Jacobi scaling limits of Pareto peeling in 2D
Ahmed Bou-Rabee, Peter S. Morfe
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Pareto hull peeling is a discrete algorithm, generalizing convex hull peeling, for sorting points in Euclidean space. We prove that Pareto peeling of a random point set in two dimensions has a scaling limit described by a first-order Hamilton-Jacobi equation and give an explicit formula for the limiting Hamiltonian, which is both non-coercive and non-convex. This contrasts with convex peeling, which converges to curvature flow. The proof involves direct geometric manipulations in the same spirit as Calder (2016).
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections