Limit theorems for random sums of random summands
From MaRDI portal
Abstract: We prove limit theorems for sums of randomly chosen random variables conditioned on the summands. We consider several versions of the corner growth setting, including specific cases of dependence amongst the summands and summands with heavy tails. We also prove a version of Hoeffding's combinatorial central limit theorem and results for summands taken uniformly from a random sample. These results are proved with concentration of measure techniques.
Recommendations
Cites work
- A Combinatorial Central Limit Theorem
- A dozen de Finetti-style results in search of a theory
- An L_p bound for the remainder in a combinatorial central limit theorem
- Concentration for noncommutative polynomials in random matrices
- Concentration of measure and isoperimetric inequalities in product spaces
- Concentration of the spectral measure for large matrices
- scientific article; zbMATH DE number 1574593 (Why is no real title available?)
- scientific article; zbMATH DE number 1574594 (Why is no real title available?)
- scientific article; zbMATH DE number 3133862 (Why is no real title available?)
- scientific article; zbMATH DE number 2020165 (Why is no real title available?)
- Median, concentration and fluctuations for Lévy processes
- On the concentration of measure phenomenon for stable and related random vectors.
- On the error bound in a combinatorial central limit theorem
- Quenched central limit theorem in a corner growth setting
- Remarks on deviation inequalities for functions of infinitely divisible random vectors
- Some results on random circulant matrices
This page was built for publication: Limit theorems for random sums of random summands
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6150876)