Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T06:59:18.893Z Has data issue: false hasContentIssue false

Convergence Rates in the Implicit Renewal Theorem on Trees

Published online by Cambridge University Press:  30 January 2018

Predrag R. Jelenković*
Affiliation:
Columbia University
Mariana Olvera-Cravioto*
Affiliation:
Columbia University
*
∗ Postal address: Department of Electrical Engineering, Columbia University, New York, NY 10027, USA. Email address: predrag@ee.columbia.edu
∗∗ Postal address: Department of Industrial Engineering and Operations Research, Columbia University, New York, NY 10027, USA. Email address: molvera@ieor.columbia.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We consider possibly nonlinear distributional fixed-point equations on weighted branching trees, which include the well-known linear branching recursion. In Jelenković and Olvera-Cravioto (2012), an implicit renewal theorem was developed that enables the characterization of the power-tail asymptotics of the solutions to many equations that fall into this category. In this paper we complement the analysis in our 2012 paper to provide the corresponding rate of convergence.

Information

Type
Research Article
Copyright
© Applied Probability Trust