A fixed point theorem for distributions
From MaRDI portal
Publication:1194594
DOI10.1016/0304-4149(92)90035-OzbMath0761.60015MaRDI QIDQ1194594
Publication date: 4 October 1992
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
Hausdorff dimensionexponential momentsweighted branching processesrandom Cantor setcontractive behaviorQuicksort algorithm
Related Items
Distribution of distances in random binary search trees. ⋮ Limit laws for partial match queries in quadtrees ⋮ Asymptotic properties of supercritical age-dependent branching processes and homogeneous branching random walks ⋮ On the contraction method with degenerate limit equation. ⋮ Asymptotic properties of expansive Galton-Watson trees ⋮ The Weighted Branching Process ⋮ Greedy Search on the Binary Tree with Random Edge-Weights ⋮ Thin tails of fixed points of the nonhomogeneous smoothing transform ⋮ Root finding algorithms and persistence of Jordan centrality in growing random trees ⋮ Higher moments of Banach space valued random variables ⋮ Random walk on sparse random digraphs ⋮ A limit process for partial match queries in random quadtrees and 2-d trees ⋮ Regular variation of fixed points of the smoothing transform ⋮ Smoothing equations for large Pólya urns ⋮ Almost sure convergence to the quicksort process ⋮ On solutions of the distributional Bellman equation ⋮ Rankings in directed configuration models with heavy tailed in-degrees ⋮ Kinetic models with randomly perturbed binary collisions ⋮ On generalized multiplicative cascades ⋮ The quicksort process ⋮ Limit distribution of the quartet balance index for Aldous’s $(\beta \ge 0)$-model ⋮ Stationary distribution and cover time of sparse directed configuration models ⋮ Exact and approximate limit behaviour of the Yule tree's cophenetic index ⋮ On densities for solutions to stochastic fixed point equations ⋮ Limit distributions for multitype branching processes of \(m\)-ary search trees ⋮ A general limit theorem for recursive algorithms and combinatorial structures ⋮ Weighted height of random trees ⋮ On the number of segregating sites for populations with large family sizes ⋮ Asymptotic distributions for random median quicksort ⋮ Additional aspects of the non-conservative Kolmogorov-Filippov fragmentation model ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The total path length of split trees ⋮ Endogeny for the logistic recursive distributional equation ⋮ Elementary fixed points of the BRW smoothing transforms with infinite number of summands ⋮ Asymptotic properties and absolute continuity of laws stable by random weighted mean. ⋮ Convergence of two-dimensional branching recursions ⋮ Different aspects of a random fragmentation model ⋮ On a multivariate contraction method for random recursive structures with applications to Quicksort ⋮ A survey of max-type recursive distributional equations ⋮ On stochastic recursive equations of sum and max type ⋮ A limit field for orthogonal range searches in two-dimensional random point search trees ⋮ Limit theorems for random spatial drainage networks ⋮ Moments for multidimensional Mandelbrot cascades ⋮ On the internal path length ofd-dimensional quad trees ⋮ All solutions of the stochastic fixed point equation of the Quicksort process ⋮ Symmetric fixed points of a smoothing transformation ⋮ On the total length of the random minimal directed spanning tree ⋮ Stochastic fixed-point equations ⋮ Discrete Spacings ⋮ Partial match queries in random quadtrees ⋮ Limit theorems for Mandelbrot's multiplicative cascades. ⋮ Fixed points with finite variance of a smoothing transformation. ⋮ On weighted branching processes in random environment. ⋮ The Smoothing Transform: A Review of Contraction Results ⋮ Precise Tail Index of Fixed Points of the Two-Sided Smoothing Transform ⋮ Unnamed Item ⋮ On a functional contraction method ⋮ On binary search tree recursions with monomials as toll functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Exponential bounds for the running time of a selection algorithm
- A moment estimate for rank statistics
- Some asymptotic theory for the bootstrap
- The analysis of Quicksort programs
- Random Recursive Constructions: Asymptotic Geometric and Topological Properties
- A limit theorem for “quicksort”
