Skip to main content
    • Aa
    • Aa

Convergence in a Multidimensional Randomized Keynesian Beauty Contest

  • Michael Grinfeld (a1), Stanislav Volkov (a2) and Andrew R. Wade (a3)

We study the asymptotics of a Markovian system of N ≥ 3 particles in [0, 1] d in which, at each step in discrete time, the particle farthest from the current centre of mass is removed and replaced by an independent U[0, 1] d random particle. We show that the limiting configuration contains N − 1 coincident particles at a random location ξ N ∈ [0, 1] d . A key tool in the analysis is a Lyapunov function based on the squared radius of gyration (sum of squared distances) of the points. For d = 1, we give additional results on the distribution of the limit ξ N , showing, among other things, that it gives positive probability to any nonempty interval subset of [0, 1], and giving a reasonably explicit description in the smallest nontrivial case, N = 3.

Corresponding author
Postal address: Department of Mathematics and Statistics, University of Strathclyde, 26 Richmond Street, Glasgow G1 1XH, UK.
∗∗ Postal address: Centre for Mathematical Sciences, Lund University, Box 118, Lund, SE-22100, Sweden.
∗∗∗ Postal address: Department of Mathematical Sciences, Durham University, South Road, Durham DH1 3LE, UK. Email address:
Hide All
[1] BenassiC. and MalagoliF. (2008). The sum of squared distances under a diameter constraint, in arbitrary dimension. Arch. Math. (Basel) 90, 471480.
[2] De GiorgiE. and ReimannS. (2008). The α-beauty contest: choosing numbers, thinking intervals. Games Econom. Behav. 64, 470486.
[3] ErdősP. (1940). On the smoothness properties of a family of Bernoulli convolutions. Amer. J. Math. 62, 180186.
[4] GrinfeldM., KnightP. A. and WadeA. R. (2012). Rank-driven Markov processes. J. Statist. Phys. 146, 378407.
[5] HughesB. D. (1995). Random Walks and Random Environments; Vol. 1, Random Walks. Clarendon Press, New York.
[6] JohnsonN. L. and KotzS. (1995). Use of moments in studies of limit distributions arising from iterated random subdivisions of an interval. Statist. Prob. Lett. 24, 111119.
[7] KeynesJ. M. (1957). The General Theory of Employment, Interest and Money. Macmillan, London.
[8] KrapivskyP. L. and RednerS. (2004). Random walk with shrinking steps. Amer. J. Phys. 72, 591598.
[9] MoranP. A. P. (1968). An Introduction to Probability Theory. Clarendon Press, Oxford.
[10] MoulinH. (1982). Game Theory for the Social Sciences. New York University Press.
[11] MuratovA. and ZuyevS. (2013). LISA: locally interacting sequential adsorption. Stoch. Models 29, 475496.
[12] PemantleR. (2007). A survey of random processes with reinforcement. Prob. Surv. 4, 179.
[13] PenroseM. D. and WadeA. R. (2004). Random minimal directed spanning trees and Dickman-type distributions. Adv. Appl. Prob. 36, 691714.
[14] PenroseM. D. and WadeA. R. (2008). Limit theory for the random on-line nearest-neighbor graph. Random Structures Algorithms 32, 125156.
[15] PillichshammerF. (2000). On the sum of squared distances in the Euclidean plane. Arch. Math. (Basel) 74, 472480.
[16] WitsenhausenH. S. (1974). On the maximum of the sum of squared distances under a diameter constraint. Amer. Math. Monthly 81, 11001101.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Advances in Applied Probability
  • ISSN: 0001-8678
  • EISSN: 1475-6064
  • URL: /core/journals/advances-in-applied-probability
Please enter your name
Please enter a valid email address
Who would you like to send this to? *



Full text views

Total number of HTML views: 0
Total number of PDF views: 8 *
Loading metrics...

Abstract views

Total abstract views: 61 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 22nd October 2017. This data will be updated every 24 hours.