On densities for solutions to stochastic fixed point equations
From MaRDI portal
Publication:5381055
DOI10.1002/rsa.20799zbMath1454.60017arXiv1604.05787OpenAlexW2964140618MaRDI QIDQ5381055
Publication date: 7 June 2019
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.05787
Combinatorial probability (60C05) Random operators and equations (aspects of stochastic analysis) (60H25) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Related Items
On conditioning a self-similar growth-fragmentation by its intrinsic area, Absolute continuity of the martingale limit in branching processes in random environment, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limit distributions for large Pólya urns
- On the asymptotic internal path length and the asymptotic Wiener index of random Split trees
- The total path length of split trees
- An algebraic approach to Pólya processes
- On the tails of the limiting Quicksort distribution
- Smoothing equations for large Pólya urns
- A fixed point theorem for distributions
- A general limit theorem for recursive algorithms and combinatorial structures
- Asymptotic properties of supercritical age-dependent branching processes and homogeneous branching random walks
- Asymptotic properties and absolute continuity of laws stable by random weighted mean.
- Analytic urns
- On the analysis of stochastic divide and conquer algorithms
- On a functional contraction method
- Limit distributions for multitype branching processes of \(m\)-ary search trees
- Functional limit theorems for multitype branching processes and generalized Pólya urns.
- On a multivariate contraction method for random recursive structures with applications to Quicksort
- Support and density of the limit $m$-ary search trees distribution
- Pólya Urns Via the Contraction Method
- Limiting Distributions for Path Lengths in Recursive Trees
- Polya Urn Models
- A limiting distribution for quicksort
- Universal Limit Laws for Depths in Random Trees
- On the internal path length ofd-dimensional quad trees
- Total Path Length for Random Recursive Trees
- Probability metrics and recursive algorithms
- Asymptotic Analysis of Hoppe Trees
- The CLT Analogue for Cyclic Urns
- Transfer theorems and asymptotic distributional results for m‐ary search trees
- A limit theorem for a class of supercritical branching processes
- B-urns
- Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model
- A limit theorem for “quicksort”
- Quicksort
