Author:
Chen Ningyuan,Olvera-Cravioto Mariana
Abstract
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.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Statistics and Probability
Reference27 articles.
1. Tail behavior of solutions of linear recursions on trees
2. Fixed points of a generalized smoothing transformation and applications to the branching random walk
3. van der Hofstad R. (2014).Random graphs and complex networks. Preprint. Available at http://www.win.tue.nl/~rhofstad/NotesRGCN.html.
4. Fixed points of multivariate smoothing transforms with scalar weights;Iksanov;ALEA Latin Amer. J. Prob. Math. Statist.,2015
5. Distances in random graphs with finite variance degrees
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. PageRank’s behavior under degree correlations;The Annals of Applied Probability;2021-06-01
2. PageRank on inhomogeneous random digraphs;Stochastic Processes and their Applications;2020-04
3. Generalized PageRank on directed configuration networks;Random Structures & Algorithms;2016-11-07