Rounding of continuous random variables and oscillatory asymptotics

DOI10.1214/009117906000000232zbMath1113.60017arXivmath/0509009OpenAlexW2069618929MaRDI QIDQ858983

Svante Janson

Publication date: 12 January 2007

Published in: The Annals of Probability (Search for Journal in Brave)

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

zbMATH Keywords

momentscharacteristic functionGumbel distributionrandom assignmentdigital search treePatricia triesSheppard's correction

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Probability distributions: general theory (60E05) Combinatorial probability (60C05)

Related Items (15)

Symmetric and asymmetric rounding: a review and some new results ⋮ Robustness of normality criteria with respect to rounding observations ⋮ On descents after maximal values in samples of discrete random variables ⋮ Scaling limits for a class of regular \(\Xi\)-coalescents ⋮ On sensitivity of exponentiality tests to data rounding: a Monte Carlo simulation study ⋮ Local limit theorems for finite and infinite urn models ⋮ Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation ⋮ Analysis of rounded exponential data ⋮ The asymmetric leader election algorithm: another approach ⋮ Renewals for exponentially increasing lifetimes, with an application to digital search trees ⋮ The size of random fragmentation trees ⋮ Sparse graphs: Metrics and random models ⋮ Renewal theory in the analysis of tries and strings ⋮ On the variance of the number of occupied boxes ⋮ Limit theorems for conditioned non-generic Galton-Watson trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A probabilistic analysis of the height of tries and of the complexity of triesort
• The number of distinct values in a geometrically distributed sample
• Asymptotics of the moments of extreme-value related distribution functions
• Extremes and related properties of random sequences and processes
• Approximate counting: a detailed analysis
• Hypothetical analyses: Approximate counting in the style of Knuth, path length in the style of Flajolet
• Measures of distinctness for random partitions and compositions of an integer
• Analysis of an asymmetric leader election algorithm
• The ?(2) limit in the random assignment problem
• Distinctness of compositions of an integer: A probabilistic analysis
• Paths in a random digital tree: limiting distributions
• Exact and asymptotic distributions in digital and binary search trees
• Limiting Distribution for the Depth in PATRICIA Tries
• Random Assignment with Integer Costs
• A Note on Sheppard's Corrections

This page was built for publication: Rounding of continuous random variables and oscillatory asymptotics