Electronic Journal of Probability

Analysis of large urn models with local mean-field interactions

Wen Sun and Robert Philippe

Full-text: Open access


The stochastic models investigated in this paper describe the evolution of a set of $F_N$ identical balls scattered into $N$ urns connected by an underlying symmetrical graph with constant degree $h_N$. After some random amount of time all the balls of any urn are redistributed locally, among the $h_N$ urns of its neighborhood. The allocation of balls is done at random according to a set of weights which depend on the state of the system. The main original features of this context is that the cardinality $h_N$ of the range of interaction is not necessarily linear with respect to $N$ as in a classical mean-field context and, also, that the number of simultaneous jumps of the process is not bounded due to the redistribution of all balls of an urn at the same time. The approach relies on the analysis of the evolution of the local empirical distributions associated to the state of urns located in the neighborhood of a given urn. Under convenient conditions, by taking an appropriate Wasserstein distance and by establishing several technical estimates for local empirical distributions, we are able to prove mean-field convergence results.

When the load per node goes to infinity, a convergence result for the invariant distribution of the associated McKean-Vlasov process is obtained for several allocation policies. For the class of power of $d$ choices policies, we show that the associated invariant measure has an asymptotic finite support property under this regime. This result differs somewhat from the classical double exponential decay property usually encountered in the literature for power of $d$ choices policies.

Article information

Electron. J. Probab., Volume 24 (2019), paper no. 45, 33 pp.

Received: 5 March 2018
Accepted: 9 April 2019
First available in Project Euclid: 10 May 2019

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 60J27: Continuous-time Markov processes on discrete state spaces 60K25: Queueing theory [See also 68M20, 90B22]
Secondary: 68M15: Reliability, testing and fault tolerance [See also 94C12]

local mean-field interaction nonlinear Markov processes urn models

Creative Commons Attribution 4.0 International License.


Sun, Wen; Philippe, Robert. Analysis of large urn models with local mean-field interactions. Electron. J. Probab. 24 (2019), paper no. 45, 33 pp. doi:10.1214/19-EJP304. https://projecteuclid.org/euclid.ejp/1557453644

Export citation


  • [1] Luisa Andreis, Paolo Dai Pra, and Markus Fischer, McKean-Vlasov limit for interacting systems with simultaneous jumps, arXiv preprint arXiv:1704.01052.
  • [2] Yossi Azar, Andrei Z Broder, Anna R Karlin, and Eli Upfal, Balanced allocations, SIAM journal on computing 29 (1999), no. 1, 180–200.
  • [3] Amarjit Budhiraja, Debankur Mukherjee, and Ruoyu Wu, Supermarket model on graphs, Arxiv https://arxiv.org/abs/1801.02979.
  • [4] Pietro Caputo, Paolo Dai Pra, and Gustavo Posta, Convex entropy decay via the Bochner-Bakry-Emery approach, Annales de l’Institut Henri Poincaré Probabilités et Statistiques 45 (2009), no. 3, 734–753.
  • [5] José A. Carrillo, Robert J. McCann, and Cédric Villani, Kinetic equilibration rates for granular media and related equations: entropy dissipation and mass transportation estimates, Revista Matemática Iberoamericana 19 (2003), no. 3, 971–1018.
  • [6] Donald A. Dawson, Measure-valued Markov processes, École d’Été de Probabilités de Saint-Flour XXI—1991, Lecture Notes in Math., vol. 1541, Springer, Berlin, 1993, pp. 1–260.
  • [7] Persi Diaconis, Group representations in probability and statistics., Institute of Mathematical Statistics, Hayward, 1988.
  • [8] P Ehrenfest, Uber zwei bekannte einwande gegen das boltzmannsche h theorem, Phys. Z 8 (1907), 311–314.
  • [9] Stewart N. Ethier and Thomas G. Kurtz, Markov processes: Characterization and convergence, John Wiley & Sons Inc., New York, 1986.
  • [10] M R Evans and T Hanney, Nonequilibrium statistical mechanics of the zero-range process and related models, Journal of Physics A: Mathematical and General 38 (2005), no. 19, R195.
  • [11] C. Godrèche and J.-M. Luck, Nonequilibrium dynamics of urn models, Journal of Physics: Condensed Matter 14 (2002), no. 7, 1601–1615.
  • [12] Carl Graham, Chaoticity on path space for a queueing network with selection of the shortest queue among several, Journal of Applied Probability 37 (2000), no. 1, 198–211.
  • [13] Carl Graham, Kinetic limits for large communication networks, Modelling in Applied Sciences: A Kinetic Theory Approach (N. Bellomo and M. Pulvirenti, eds.), Birkhauser, 2000, pp. 317–370.
  • [14] Martin Jacobsen, Point process theory and applications, Probability and its Applications, Birkhäuser Boston, Inc., Boston, MA, 2006.
  • [15] A. Karthik, Arpan Mukhopadhyay, and Ravi R. Mazumdar, Choosing among heterogeneous server clouds, Queueing Systems 85 (2017), no. 1, 1–29.
  • [16] J. F. C. Kingman, Poisson processes, Oxford studies in probability, 1993.
  • [17] Valentin Fedorovich Kolchin, Boris Aleksandrovich Sevastyanov, and Vladimir Pavlovich Chistyakov, Random allocations, Winston, 1978.
  • [18] Günter Last and Andreas Brandt, Marked point processes on the real line, Probability and its Applications (New York), Springer-Verlag, New York, 1995.
  • [19] David A. Levin, Yuval Peres, and Elizabeth L. Wilmer, Markov chains and mixing times, American Mathematical Society, Providence, RI, 2009, With a chapter by James G. Propp and David B. Wilson.
  • [20] Eric Luçon and Wilhelm Stannat, Mean field limit for disordered diffusions with singular interactions, The Annals of Applied Probability 24 (2014), no. 5, 1946–1993.
  • [21] Malwina J. Luczak and Colin McDiarmid, Asymptotic distributions and chaos for the supermarket model, Electronic Journal of Probability 12 (2007), no. 3, 75–99.
  • [22] S. T. Maguluri, R. Srikant, and L. Ying, Stochastic models of load balancing and scheduling in cloud computing clusters, 2012 Proceedings IEEE INFOCOM, March 2012, pp. 702–710.
  • [23] Michael Mitzenmacher, Andréa W. Richa, and Ramesh Sitaraman, The power of two random choices: A survey of techniques and results, in Handbook of Randomized Computing, 2000, pp. 255–312.
  • [24] Patrick E. Müller, Limiting properties of a continuous local mean-field interacting spin system, Ph.D. thesis, Rheinischen Friedrich-Wilhelms-Universität Bonn, 2016.
  • [25] Wen Sun, Véronique Simon, Sébastien Monnet, Philippe Robert, and Pierre Sens, Analysis of a stochastic model of replication in large distributed storage systems: A mean-field approach, Proceedings of the ACM on Measurement and Analysis of Computing Systems 1 (2017), no. 1, 24:1–24:21.
  • [26] A.S. Sznitman, Topics in propagation of chaos, École d’Été de Probabilités de Saint-Flour XIX — 1989, Lecture Notes in Maths, vol. 1464, Springer-Verlag, 1991, pp. 167–243.
  • [27] N. D. Vvedenskaya, R. L. Dobrushin, and F. I. Karpelevich, A queueing system with a choice of the shorter of two queues—an asymptotic approach, Rossiĭskaya Akademiya Nauk. Problemy Peredachi Informatsii 32 (1996), no. 1, 20–34.