Article contents
Coupling on weighted branching trees
Published online by Cambridge University Press: 10 June 2016
Abstract
In this paper we consider linear functions constructed on two different weighted branching processes and provide explicit bounds for their Kantorovich–Rubinstein distance in terms of couplings of their corresponding generic branching vectors. Motivated by applications to the analysis of random graphs, we also consider a variation of the weighted branching process where the generic branching vector has a different dependence structure from the usual one. By applying the bounds to sequences of weighted branching processes, we derive sufficient conditions for the convergence in the Kantorovich–Rubinstein distance of linear functions. We focus on the case where the limits are endogenous fixed points of suitable smoothing transformations.
Keywords
MSC classification
- Type
- Research Article
- Information
- Copyright
- Copyright © Applied Probability Trust 2016
References
- 3
- Cited by