Open Access
May 2005 A survey of max-type recursive distributional equations
David J. Aldous, Antar Bandyopadhyay
Ann. Appl. Probab. 15(2): 1047-1110 (May 2005). DOI: 10.1214/105051605000000142

Abstract

In certain problems in a variety of applied probability settings (from probabilistic analysis of algorithms to statistical physics), the central requirement is to solve a recursive distributional equation of the form $X\mathop{=}\limits^{d}\,g((\xi_{i},X_{i}),i\geq 1)$. Here (ξi) and g(⋅) are given and the Xi are independent copies of the unknown distribution X. We survey this area, emphasizing examples where the function g(⋅) is essentially a “maximum” or “minimum” function. We draw attention to the theoretical question of endogeny: in the associated recursive tree process Xi, are the Xi measurable functions of the innovations process (ξi)?

Citation

Download Citation

David J. Aldous. Antar Bandyopadhyay. "A survey of max-type recursive distributional equations." Ann. Appl. Probab. 15 (2) 1047 - 1110, May 2005. https://doi.org/10.1214/105051605000000142

Information

Published: May 2005
First available in Project Euclid: 3 May 2005

zbMATH: 1105.60012
MathSciNet: MR2134098
Digital Object Identifier: 10.1214/105051605000000142

Subjects:
Primary: 60E05 , 62E10 , 68Q25 , 82B44

Keywords: branching process , Branching random walk , Cavity method , Coupling from the past , fixed point equation , frozen percolation , mean-field model of distance , metric contraction , Probabilistic analysis of algorithms , probability distribution , probability on trees , random matching

Rights: Copyright © 2005 Institute of Mathematical Statistics

Vol.15 • No. 2 • May 2005
Back to Top