Papers
Topics
Authors
Recent
Search
2000 character limit reached

Jante's law process

Published 16 Mar 2017 in math.PR | (1703.05564v4)

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.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.