Maximums on trees
type: Item
instance of: scholarly article
title: Maximums on trees
zbMATH Open document ID: 1316.60131
author: Predrag R. Jelenković
author: Mariana Olvera-Cravioto
published in: Stochastic Processes and their Applications
publication date: 2014-11-07T00:00:00Z
full work available at URL: https://arxiv.org/abs/1405.6265
Mathematics Subject Classification ID: 60J80
Mathematics Subject Classification ID: 60G50
Mathematics Subject Classification ID: 60H25
Mathematics Subject Classification ID: 60F10
Mathematics Subject Classification ID: 60K05
zbMATH DE Number: 6366974
zbMATH Keywords: weighted branching processes
zbMATH Keywords: branching random walk
zbMATH Keywords: high-order Lindley equation
zbMATH Keywords: stochastic fixed-point equations
zbMATH Keywords: power law distributions
zbMATH Keywords: large deviations
zbMATH Keywords: Cramér-Lundberg approximation
zbMATH Keywords: random difference equations
zbMATH Keywords: maximum recursion
MaRDI profile type: Publication
OpenAlex ID: W2060897377
arXiv ID: 1405.6265
cites work: A survey of max-type recursive distributional equations
cites work: Precise Tail Index of Fixed Points of the Two-Sided Smoothing Transform
cites work: Fixed points of inhomogeneous smoothing transforms
cites work: Fixed points of the smoothing transform: two-sided solutions
cites work: A stochastic fixed point equation for weighted minima and maxima
cites work: Lindley-type equations in the branching random walk
cites work: Heavy tailed solutions of multivariate smoothing transforms
cites work: Approximating the limiting quicksort distribution
cites work: Implicit renewal theory and tails of solutions of random equations
cites work: Q3154694
cites work: Information ranking and power laws on trees
cites work: Implicit renewal theory and power tails on trees
cites work: Implicit renewal theorem for trees with general weights
cites work: Higher-order Lindley equations
cites work: On fixed points of a generalized multidimensional affine recursion
cites work: A general limit theorem for recursive algorithms and combinatorial structures
cites work: The contraction method for recursive algorithms
cites work: Asymptotic analysis for personalized Web search
DOI: 10.1016/J.SPA.2014.09.004
reviewed by: Marius Iosifescu
description: scientific article; zbMATH DE number 6366974