Jante's law process
Abstract: Consider the process which starts with $N\ge 3$ distinct points on ${\mathbb R}d$, and fix a positive integer~$K<N$. Of the total $N$ points keep those $N-K$ which minimize the energy (defined as the sum of all pairwise distances squared) amongst all the possible subsets of size $N-K$, and then replace the removed points by $K$ i.i.d.\ points sampled according to some fixed distribution $\zeta$. Repeat this process ad infinitum. We obtain various quite non-restrictive conditions under which the set of points converges to a certain limit. This is a very substantial generalization of the "Keynesian beauty contest process" studied by Grinfeld, Volkov and Wade, where $K=1$ and the distribution $\zeta$ was uniform on the unit cube.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.