
doi: 10.2307/1427052
Let F (·) be a c.d.f. on [0,∞), f ( s ) = ∑ ∞ 0 p j s i a p.g.f. with p 0 = 0, < 1 < m = Σ j p 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.
Branching processes (Galton-Watson, birth-and-death, etc.), Applications of branching processes, branching random walk, Iteration theory, iterative and composite equations, functional equation
Branching processes (Galton-Watson, birth-and-death, etc.), Applications of branching processes, branching random walk, Iteration theory, iterative and composite equations, functional equation
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 16 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
