Private measures, random walks, and synthetic data

DOI10.1007/s00440-024-01279-zMaRDI QIDQ6550176

R. V. Vershinin, Thomas Strohmer, March Boedihardjo

Publication date: 4 June 2024

Published in: Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)

zbMATH Keywords

random walksdifferential privacysynthetic data

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Privacy of data (68P27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• New inapproximability bounds for TSP
• Efficient algorithms for privately releasing marginals via convex relaxations
• Faster Algorithms for Privately Releasing Marginals
• On the geometry of differential privacy
• PCPs and the Hardness of Generating Private Synthetic Data
• The Algorithmic Foundations of Differential Privacy
• Calculation of the Wasserstein Distance Between Probability Distributions on the Line
• High-Dimensional Probability
• Minimax Optimal Procedures for Locally Private Estimation
• The Complexity of Differential Privacy
• A learning theory approach to noninteractive database privacy
• Optimal Transport
• A basic course in probability theory
• A (slightly) improved approximation algorithm for metric TSP

This page was built for publication: Private measures, random walks, and synthetic data