Endogeny for the logistic recursive distributional equation

DOI10.4171/ZAA/1433MaRDI QIDQ537683zbMATH OpenFDO

Authors Antar Bandyopadhyay

Publication date 20 May 2011

Published in Zeitschrift für Analysis und ihre Anwendungen (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0401389

zbMATH Keywords

logistic distributionbivariate uniquenessendogenyrandom assignment problemrecursive distributional equationsrecursive tree processes

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Abstract: In this article we prove the bivariate uniqueness property for a particular ``max-type recursive distributional equation (RDE). Using the general theory developed by Aldous and Bandyopadhyay (2005) we then show that the corresponding recursive tree process (RTP) has no external randomness, more preciously, the RTP is endogenous. The RDE we consider is so called the Logistic RDE, which appears in Aldous' (2001) proof of the $zeta(2)$-limit of the random assignment problem using the local weak convergence method. Thus this work provides a non-trivial application of the general theory developed by Aldous and Bandyopadhyay (2005).

Recommendations

• A survey of max-type recursive distributional equations
• A new characterization of endogeny
• On a linear recursive distributional equation
• On stochastic recursive equations of sum and max type
• Tail asymptotics of maximums on trees in the critical case

Cites work

• scientific article; zbMATH DE number 1273988 (Why is no real title available?)
• scientific article; zbMATH DE number 2042286 (Why is no real title available?)
• scientific article; zbMATH DE number 765034 (Why is no real title available?)
• scientific article; zbMATH DE number 3365602 (Why is no real title available?)
• A characterization of the set of fixed points of the quicksort transformation
• A fixed point theorem for distributions
• A necessary and sufficient condition for the tail-triviality of a recursive tree process
• A survey of max-type recursive distributional equations
• An Introduction to the Theory of Point Processes
• Asymptotics in the random assignment problem
• Counting without sampling
• Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models
• Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method
• The \(\zeta(2)\) limit in the random assignment problem
• The contraction method for recursive algorithms
• The mean field traveling salesman and related problems
• The percolation process on a tree where infinite clusters are frozen

Cited in

(5)

• Replica symmetry of the minimum matching
• A survey of max-type recursive distributional equations
• Belief propagation for optimal edge cover in the random complete graph
• The Noisy Veto-Voter Model: A Recursive Distributional Equation on [0, 1]
• A new characterization of endogeny

This page was built for publication: Endogeny for the logistic recursive distributional equation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537683)