Hostname: page-component-74656f9884-2dmjx Total loading time: 0 Render date: 2026-11-10T09:32:57.153Z Has data issue: false hasContentIssue false

Discounted branching random walks

Published online by Cambridge University Press:  01 July 2016

K. B. Athreya*
Affiliation:
Iowa State University
*
∗ Postal address: Departments of Mathematics and Statistics, Iowa State University, Ames, IA 50011, USA.

Abstract

Let F(·) be a c.d.f. on [0,∞), f(s) = ∑∞ 0 pjsi a p.g.f. with p 0 = 0, < 1 < m = Σjp j < ∞ and 1 < ρ <∞. For the functional equation for a c.d.f. H(·) on [0,∞] we establish that if 1 – F(x) = O(x –θ ) for some θ > α =(log m)/(log p) there exists a unique solution H(·) to (∗) in the class C of c.d.f.’s satisfying 1 – H(x) = o(x –α ).

We give a probabilistic construction of this solution via branching random walks with discounting. We also show non-uniqueness if the condition 1 – H(x) = o(x –α ) is relaxed.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1985 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable