An estimate of the remainder in a combinatorial central limit theorem
From MaRDI portal
Publication:3676893
DOI10.1007/BF00533704zbMATH Open0563.60026WikidataQ61387135 ScholiaQ61387135MaRDI QIDQ3676893FDOQ3676893
Publication date: 1984
Published in: Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)
Recommendations
- STEIN'S METHOD AND THE BERRY-ESSÉEN THEOREM
- On the accuracy in a combinatorial central limit theorem: the characteristic function method
- The Berry-Esseen bound in the theory of random permutations
- Bounds of the remainder in a combinatorial central limit theorem
- A Uniform Bound on a Combinatorial Central Limit Theorem
Cites Work
- A Combinatorial Central Limit Theorem
- Title not available (Why is that?)
- An \(L_p\) bound for the remainder in a combinatorial central limit theorem
- Remainder term estimate in a combinatorial limit theorem
- On the Hoeffding's combinatorial central limit theorem
- Berry-Esseen theorems for simple linear rank statistics under the null- hypothesis
- Title not available (Why is that?)
Cited In (54)
- Cramér-type moderate deviations under local dependence
- On the probabilities of large deviations of combinatorial sums of independent random variables that satisfy the Linnik condition
- Hoeffding and Bernstein inequalities for weighted sums of exchangeable random variables
- Smoothness and Lévy concentration function inequalities for distributions of random diagonal sums
- Motoo's combinatorial central limit theorem for serial rank statistics
- Step Size in Stein's Method of Exchangeable Pairs
- Weighted dependency graphs
- The Stein-Tikhomirov Method and Berry-Esseen Inequality for Sampling Sums from a Finite Population of Independent Random Variables
- A short proof of Motoo's combinatorial central limit theorem using Stein's method
- Some stochastic processes in a random permutation
- Error bounds in local limit theorems using Stein's method
- Normal approximation for random sums
- On the error bound in a combinatorial central limit theorem
- On combinatorial strong law of large numbers and rank statistics
- Distributional transformations, orthogonal polynomials, and Stein characterizations
- Friendly bisections of random graphs
- Multivariate normal approximation with Stein's method of exchangeable pairs under a general linearity condition
- The asymptotic normality of \((s,s+1)\)-cores with distinct parts
- Stein's method for diffusion approximations
- Linear functions on the classical matrix groups
- Stein's method via induction
- \(L^1\) bounds in normal approximation
- Functional approximations via Stein's method of exchangeable pairs
- Berry-Esseen and central limit theorems for serial rank statistics via graphs
- STEIN'S METHOD AND THE BERRY-ESSÉEN THEOREM
- Equivalent conditions on the central limit theorem for a sequence of probability measures on \(\mathbb R\)
- A Uniform Bound on a Combinatorial Central Limit Theorem
- An inductive proof of the Berry-Esseen theorem for character ratios
- Stein's method, heat kernel, and linear functions on the orthogonal groups
- An Improvement of a Uniform Bound on a Combinatorial Central Limit Theorem
- Bounds of the remainder in a combinatorial central limit theorem
- Significance levels of linear rank tests using Edgeworth expansions
- On the asymptotic distribution of scrambled net quadrature.
- On the Accuracy in a Combinatorial Central Limit Theorem: The Characteristic Function Method
- Stein meets Malliavin in normal approximation
- On large deviations for combinatorial sums
- Probability problems connected with a certain integrodifferential inequality
- Stein's method for concentration inequalities
- Characterizations of distributions by generalizations of variance bounds and simple proofs of the CLT
- On the probabilities of moderate deviations for combinatorial sums
- \(L_ p\)-nonuniform bounds for asymptotic normality of linear rank statistics
- An improvement of a non-uniform bound for combinatorial central limit theorem
- CLT-related large deviation bounds based on Stein's method
- A Berry-Esseen bound with applications to vertex degree counts in the Erdős-Rényi random graph
- A Non-Uniform Concentration Inequality for a Random Permutation Sum
- Efficiency of experimental designs for comparing two treatments with correlated binary responses
- The Number of Satisfying Assignments of Random Regulark-SAT Formulas
- Esseen type bounds of the remainder in a combinatorial CLT
- Berry-Esseen bounds for combinatorial central limit theorems and pattern occurrences, using zero and size biasing
- Singularity of discrete random matrices
- Distribution-Free Consistent Independence Tests via Center-Outward Ranks and Signs
- Anticoncentration and Berry-Esseen bounds for random tensors
- Product mixing in the alternating group
- Global and local two-sample tests via regression
This page was built for publication: An estimate of the remainder in a combinatorial central limit theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3676893)
