Searcharxiv⌕ Search

arXiv · 2611.00888

Differential Privacy for Generalized Entropy Indices of Income Inequality

Abstract

The mean log deviation and the Theil index are two widely used measures of income inequality. The organization releasing these measures may be obligated to protect the confidentiality of the individual incomes used in the computations. In particular, the organization may wish to release versions of these measures with formal guarantees of privacy. The organization could do so by satisfying differential privacy; however, typical applications of differentially private algorithms are likely to add so much noise to the measures that they become unusable. We present differentially private algorithms for these indices with reasonable error properties. The algorithms rely on computing or approximating bounds on the smooth sensitivity, that is, the maximum absolute amount the inequality measures change when replacing any subset of the $n$ incomes in the reported data with arbitrarily chosen feasible values. For the mean log deviation, the algorithm runs in $O(n^2)$ time. For the Theil index, the algorithm runs in $O(n\log n)$ time. We illustrate the performance of each differentially private algorithm using individual-level and household-level income data from the Current Population Survey. We also examine repeated sampling properties of the algorithms using artificially generated data. The empirical results indicate when these differentially private algorithms can be expected to provide accurate estimates and when they are likely to introduce too much noise.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiahe Li, Jerome P. Reiter. 2026-10-31. Differential Privacy for Generalized Entropy Indices of Income Inequality. https://arxiv.org/abs/2611.00888

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Debiased Estimating Equation Method for Robust and Efficient Mendelian Randomization Using a Large Number of Correlated Weak and Invalid Instruments

Mendelian randomization (MR) is a widely used tool for causal inference in the presence of unmeasured confounders, which uses single nucleotide polymorphisms (SNPs) as instrumental variables to estimate causal effects. However, SNPs often have weak effects on complex traits, leading to bias in existing MR analyses when weak instruments are included. In addition, existing MR methods often restrict analysis to independent SNPs via linkage disequilibrium clumping and result in a loss of efficiency in estimating the causal effect due to discarding correlated SNPs. To address these issues, we propose the Debiased Estimating Equation Method (DEEM), a summary statistics-based MR approach that can incorporate a large number of correlated, weak-effect, and invalid SNPs. DEEM effectively eliminates the weak instrument bias and improves the statistical efficiency of the causal effect estimation by leveraging information from a large number of correlated SNPs. DEEM also allows for pleiotropic effects, adjusts for the winner's curse, and applies to both two-sample and one-sample MR analyses. Asymptotic analyses of the DEEM estimator demonstrate its attractive theoretical properties. Through extensive simulations and two real data examples, we demonstrate that DEEM significantly improves the efficiency and robustness of MR analysis compared with existing methods.

stat.ME↗

Latent Space Graph-fused LASSO for Clustering in Attributed Graphs

This manuscript studies latent space graph-fused LASSO methods for clustering graphs with multivariate nodal attributes. The framework includes node-specific priors of low-dimensional representations coupled with a neural decoder that bridges the observed attributes with the latent variables. Both structural and attribute information are incorporated for the clustering through a graph-fused LASSO regularization on prior nodal means. The optimization problem is solved via the alternating direction method of multipliers with Langevin dynamics for posterior inference. Simulations on grid and block graphs, together with applications to California county temperatures and Los Angeles traffic data, demonstrate the effectiveness of the proposed method.

stat.ME↗

Missing data and cluster graphs: cluster-level missingness vs variable-level missingness

Missing data is pervasive in many scientific domains such as public health, environmental science, and the social sciences. Recoverability from missing data is typically studied using fully specified variable-level missingness models despite that, in many applications, only coarse structural information is available, for instance when variables are grouped into clusters due to limited knowledge or interpretability reasons. In this paper, we investigate recoverability from such abstract representations. We introduce two classes of cluster-based missingness graphs: the m-C-DMG, which retains variable-specific missingness indicators, and the cm-C-DMG, which aggregates missingness mechanisms at the cluster level. We formalize the notion of compatibility between these abstract graphs and underlying variable-level missingness models, and study how this abstraction affects the recoverability of probabilistic and causal queries. In particular, we give graphical conditions of recovering the joint distribution as well as graphical conditions of recovering a macro causal effect.

stat.ME↗