Zero biasing and Jack measures
From MaRDI portal
Abstract: The tools of zero biasing are adapted to yield a general result suitable for analyzing the behavior of certain growth processes. The main theorem is applied to prove central limit theorems, with explicit error terms in the L^1 metric, for certain statistics of the Jack measure on partitions and for the number of balls drawn in a Polya-Eggenberger urn process.
Recommendations
- On the error bound in the normal approximation for Jack measures
- Stein's method, Jack measure, and the Metropolis algorithm
- Gaussian Asymptotics of Jack Measures on Partitions From Weighted Enumeration of Ribbon Paths
- A limit theorem for the Jack deformation of Plancherel measures
- scientific article; zbMATH DE number 3872474
Cites work
- scientific article; zbMATH DE number 50805 (Why is no real title available?)
- scientific article; zbMATH DE number 1549030 (Why is no real title available?)
- An inductive proof of the Berry-Esseen theorem for character ratios
- Anisotropic Young diagrams and Jack symmetric functions
- Asymptotics of Plancherel measures for symmetric groups
- Berry-Esseen bounds for combinatorial central limit theorems and pattern occurrences, using zero and size biasing
- Bounds on the constant in the mean central limit theorem
- Central limit theorem for the adjacency operators on the infinite symmetric group
- Discrete orthogonal polynomial ensembles and the Plancherel measure
- Gaussian fluctuations of characters of symmetric groups and of Young diagrams
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
- Martingales and character ratios
- Normal approximation for hierarchical structures
- On coupling constructions and rates in the CLT for dependent summands with applications to the antivoter model and weighted U-statistics
- Quantum probability and spectral analysis of graphs. With a foreword by Professor Luigi Accardi.
- Random walks on trees and matchings
- Stein's method and the zero bias transformation with application to simple random sampling
- Stein's method, Jack measure, and the Metropolis algorithm
- Stein’s method and Plancherel measure of the symmetric group
- The Berry-Esseen bound for character ratios
- L^1 bounds in normal approximation
- Z-measures on partitions and their scaling limits
Cited in
(6)- Non-uniform Berry-Esseen bounds for exchangeable pairs with applications to the mean-field classical N-vector models and Jack measures
- Zero assignment by measurement feedback
- Stein's method via induction
- On the error bound in the normal approximation for Jack measures
- Non-uniform bounds for non-normal approximation via Stein's method with applications to the Curie-Weiss model and the imitative monomer-dimer model
- Stein's method using approximate zero bias couplings with applications to combinatorial central limit theorems under the Ewens distribution
This page was built for publication: Zero biasing and Jack measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3103625)