NCNoemi Cuppone

Noemi Cuppone

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Noemi Cuppone has a total of 3 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Maximal Minimal Spacing for Random Points

    by Fabio Deelan Cunden, Noemi Cuppone, Giovanni Gramegna, Pierpaolo Vivo

    From $$N+1$$ N + 1 random points on a line we wish to select $$M+1$$ M + 1 points so as to maximize the minimal spacing between them. We consider an initial configuration with independent and identically distributed spacings. Equivalently, the points are arrival times of a generic renewal process. For general spacing distributions, and for all $$M\le N$$ M ≤ N , we derive exact distributional identities for the maximal minimal spacing and obtain its asymptotic behavior. The problem admits a reformulation in terms of a threshold-resetting random walk. The walk advances by successive random increments and is reset to the origin upon exceeding a fixed threshold. The probability that the optimal spacing exceeds a given value coincides with the probability that the walk completes at least M reset cycles within N steps. This yields an exact representation in terms of first-passage functionals of the walk. The same mapping suggests a numerical scheme for the max-min spacing problem in the regime of large N and M , whose accuracy is tested against the exact results obtained here.

  • Open Access

    The most dispersed subset of random points in R d

    by Fabio Deelan Cunden, Noemi Cuppone, Giovanni Gramegna, Pierpaolo Vivo

    Consider a population of N individuals, each having d ≥ 1 different traits, and an additive measure, called dispersion, which rewards large pairwise separations between traits. The goal is to select M ≤ N individuals such that their traits are as dispersed as possible. We compute analytically the full statistics (including large deviation tails) of the maximally achievable dispersion among sub-populations of size M when the traits are independent and identically distributed. Two complementary approaches are developed, one based on a mean-field theory for order statistics, and the other on the replica method from the field of disordered systems. In all dimensions d, and for rotationally symmetric distributions, the optimal subset for large populations consists of all points lying outside a d-dimensional ball whose radius is determined self-consistently. For a single trait (d = 1), the statistics of the maximal dispersion can be tackled for finite N, M as well. The formulae we obtained are corroborated by numerical simulations on small instances and by heuristic algorithms that find nearoptimal solutions.