An Efron-Stein inequality for nonsymmetric statistics
From MaRDI portal
Publication:1083143
DOI10.1214/aos/1176349952zbMath0604.62017OpenAlexW2040820014WikidataQ94785872 ScholiaQ94785872MaRDI QIDQ1083143
Publication date: 1986
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aos/1176349952
Multivariate analysis (62H99) Inequalities; stochastic orderings (60E15) Measures of association (correlation, canonical correlation, etc.) (62H20) Statistical distribution theory (62E99)
Related Items
Average-case analysis via incompressibility ⋮ A limit theorem for continuous selectors ⋮ On the variance of the optimal alignments score for binary random words and an asymmetric scoring function ⋮ Estimation of Entropy and Mutual Information ⋮ Leave-One-Out Bounds for Kernel Methods ⋮ Sharp Thresholds for Monotone Non-Boolean Functions and Social Choice Theory ⋮ Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars ⋮ Effective resistance of random trees ⋮ Normal approximation for the net flux through a random conductor ⋮ Measuring distributional asymmetry with Wasserstein distance and Rademacher symmetrization ⋮ A differential version of the Efron-Stein inequality: Bounding the variance of a function of an infinitely divisible variable ⋮ Lower bounds on the generalized central moments of the optimal alignments score of random sequences ⋮ The iterated jackknife estimate of variance ⋮ Mixing time of the Chung-Diaconis-Graham random process ⋮ Deviation inequalities for random walks ⋮ Rate of convergence of the mean for sub-additive ergodic sequences ⋮ Optimal alignments of longest common subsequences and their path properties ⋮ Pruitt's estimates in Banach space ⋮ Normal approximation for a random elliptic equation ⋮ On the Order of the Central Moments of the Length of the Longest Common Subsequences in Random Words ⋮ A central limit theorem for the length of the longest common subsequences in random words ⋮ Thermodynamics and concentration ⋮ Efficient Error and Variance Estimation for Randomized Matrix Computations ⋮ Heavy and light paths and Hamilton cycles ⋮ Uncertainty learning of rough set-based prediction under a holistic framework ⋮ Vector-valued statistics of binomial processes: Berry-Esseen bounds in the convex distance ⋮ Geometric influences ⋮ Letter change bias and local uniqueness in optimal sequence alignments ⋮ Multiscale functional inequalities in probability: constructive approach ⋮ Polynomial regression under arbitrary product distributions ⋮ A universal strong law of large numbers for conditional expectations via nearest neighbors ⋮ Kernel density estimates in a non-standard situation ⋮ Concentration inequalities using the entropy method ⋮ Chebyshev polynomials, moment matching, and optimal estimation of the unseen ⋮ On the approximation of shortest common supersequences and longest common subsequences ⋮ Submean variance bound for effective resistance of random electric networks ⋮ Thermodynamical approach to the longest common subsequence problem ⋮ Large deviations-based upper bounds on the expected relative length of longest common subsequences ⋮ Optimal couplings between sparse block models ⋮ On a Speculated Relation Between Chvátal–Sankoff Constants of Several Sequences ⋮ A new method of normal approximation ⋮ Covariances of symmetric statistics ⋮ A Bernstein-type inequality for functions of bounded interaction ⋮ A law of large numbers for nearest neighbour statistics ⋮ Local tail bounds for functions of independent random variables ⋮ Random geometric complexes in the thermodynamic regime ⋮ Lower bounds for moments of global scores of pairwise Markov chains ⋮ Approximation to the mean curve in the LCS problem ⋮ Optimal rates of entropy estimation over Lipschitz balls ⋮ The `Butterfly effect' in Cayley graphs with applications to genomics. ⋮ Aging of asymmetric dynamics on the random energy model ⋮ A variance bound for a general function of independent noncommutative random variables ⋮ Convergence properties of functional estimates for discrete distributions ⋮ Macroscopic non-uniqueness and transversal fluctuation in optimal random sequence alignment ⋮ A new method for bounding rates of convergence of empirical spectral distributions ⋮ Residual variance estimation using a nearest neighbor statistic ⋮ Strong universal consistency of smooth kernel regression estimates ⋮ Standard deviation of the longest common subsequence ⋮ Moment inequalities for functions of independent random variables ⋮ Microscopic path structure of optimally aligned random sequences ⋮ Limit theorems for random spatial drainage networks ⋮ Partitioning estimation of local variance based on nearest neighbors under censoring ⋮ Convex Hulls of Random Walks ⋮ Concentration inequalities for bounded functionals via log-Sobolev-type inequalities ⋮ Variance inequalities using first derivatives ⋮ A Quantitative Central Limit Theorem for the Effective Conductance on the Discrete Torus ⋮ Randomized Hamiltonian Monte Carlo as scaling limit of the bouncy particle sampler and dimension-free convergence rates ⋮ Convex hulls of stable random walks ⋮ An analytic study of the phase transition line in local sequence alignment with gaps ⋮ Expected length of the longest common subsequence for large alphabets ⋮ Nonparametric partitioning estimation of residual and local variance based on first and second nearest neighbours ⋮ Entropy and Concentration ⋮ Broadcasting on random recursive trees ⋮ On cross-validation in kernel and partitioning regression estimation.
