Cut-off method for endogeny of recursive tree processes
From MaRDI portal
Convergence of probability measures (60B10) Probability distributions: general theory (60E05) Inequalities; stochastic orderings (60E15) Combinatorial optimization (90C27) Quantum field theory on curved space or space-time backgrounds (81T20) Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44)
Abstract: Given a solution to a recursive distributional equation, a natural (and non-trivial) question is whether the corresponding recursive tree process is endogenous. That is, whether the random environment almost surely defines the tree process. We propose a new method of proving endogeny, which applies to various processes. As explicit examples, we establish endogeny of the random metrics on non-pivotal hierarchical graphs defined by multiplicative cascades and of mean-field optimization problems as the mean-field matching and travelling salesman problems in pseudo-dimension q>1.
This page was built for publication: Cut-off method for endogeny of recursive tree processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6278906)
