Convergence of the population dynamics algorithm in the Wasserstein metric

DOI10.1214/19-EJP315zbMath1441.60053arXiv1705.09747OpenAlexW2963382231MaRDI QIDQ2316585

Publication date: 6 August 2019

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.09747

zbMATH Keywords

Wasserstein metric population dynamics weighted branching process distributional fixed point equation iteration bootstrap

Mathematics Subject Classification ID

Random operators and equations (aspects of stochastic analysis) (60H25) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items (2)

Importance sampling for maxima on trees ⋮ Stationary Waiting Time in Parallel Queues with Synchronization

Cites Work

Implicit renewal theorem for trees with general weights
Maximums on trees
On the rate of convergence in Wasserstein distance of the empirical measure
A survey of max-type recursive distributional equations
The functional equation of the smoothing transform
On the tails of the limiting Quicksort distribution
Ising models on locally tree-like graphs
Higher-order Lindley equations
Perfect simulation from the quicksort limit distribution
Tail asymptotics of maximums on trees in the critical case
Lindley-type equations in the branching random walk
Central limit theorems for the Wasserstein distance between the empirical and the true distributions
The contraction method for recursive algorithms
Fixed points of the smoothing transform: two-sided solutions
PageRank on inhomogeneous random digraphs
Thin tails of fixed points of the nonhomogeneous smoothing transform
Elementary fixed points of the BRW smoothing transforms with infinite number of summands
Approximating the limiting Quicksort distribution
Implicit Renewal Theory and Power Tails on Trees
Fixed points of inhomogeneous smoothing transforms
Information ranking and power laws on trees
Density approximation and exact simulation of random variables that are solutions of fixed-point equations
Asymptotic analysis for personalized Web search
Information, Physics, and Computation
Stochastic Discounting, Aggregate Claims, and the Bootstrap
Fixed points of a generalized smoothing transformation and applications to the branching random walk
Stationary Waiting Time in Parallel Queues with Synchronization
Discounted branching random walks
One-dimensional empirical measures, order statistics, and Kantorovich transport distances
Generalized PageRank on directed configuration networks
A limit theorem for “quicksort”
Optimal Transport
On the probabilistic worst-case time of ``find

This page was built for publication: Convergence of the population dynamics algorithm in the Wasserstein metric