Endogeny for the logistic recursive distributional equation

DOI10.4171/ZAA/1433zbMATH Open1215.60009arXivmath/0401389MaRDI QIDQ537683FDOQ537683

Authors: Antar Bandyopadhyay 

Publication date: 20 May 2011

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

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).

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

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

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)

Cites Work

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

Cited In (5)

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

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)