Cover Image

Constructive l2-Discrepancy Minimization with Additive Deviations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Dutta, Kunal
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics Data Structures and Algorithms Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Near-Optimal Constructive Bounds for $\ell_2$ Prefix Discrepancy and Steinitz Problems via Affine Spectral Independence
by: Dutta, Kunal, et al.
Published: (2026)

Average-Case Matrix Discrepancy: Asymptotics and Online Algorithms
by: Kunisky, Dmitriy, et al.
Published: (2023)

Discrepancy Minimization via Regularization
by: Pesenti, Lucas, et al.
Published: (2022)

Faster Mixing of the Jerrum-Sinclair Chain
by: Chen, Xiaoyu, et al.
Published: (2025)

Sink-free orientations: a local sampler with applications
by: Anand, Konrad, et al.
Published: (2025)

Rumors on evolving graphs through stationary times
by: Bonasorte, Vicenzo
Published: (2025)

Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree
by: Carlson, Charlie, et al.
Published: (2024)

Zero-free regions and concentration inequalities for hypergraph colorings in the local lemma regime
by: Liu, Jingcheng, et al.
Published: (2026)

A Tight Bound on Localization of Electrical Flows
by: Gurel-Gurevich, Ori, et al.
Published: (2026)

Towards an Optimal Contention Resolution Scheme for Matchings
by: Nuti, Pranav, et al.
Published: (2022)

Sampling Colorings Close to the Maximum Degree: Non-Markovian Coupling and Local Uniformity
by: Jain, Vishesh, et al.
Published: (2026)

Phase Transitions via Complex Extensions of Markov Chains
by: Liu, Jingcheng, et al.
Published: (2024)

Non-Additive Discrepancy: Coverage Functions in a Beck-Fiala Setting
by: Avila, Tatiana Rocha, et al.
Published: (2026)

The Compilability Thresholds of 2-CNF to OBDD
by: de Colnet, Alexis, et al.
Published: (2026)

Rapid Mixing of Glauber Dynamics for Monotone Systems via Entropic Independence
by: Feng, Weiming, et al.
Published: (2025)

Spectral Independence via Stability and Applications to Holant-Type Problems
by: Chen, Zongchen, et al.
Published: (2021)

Cycle-factors of regular graphs via entropy
by: Christoph, Micha, et al.
Published: (2025)

Decoupling via Affine Spectral-Independence: Beck-Fiala and Komlós Bounds Beyond Banaszczyk
by: Bansal, Nikhil, et al.
Published: (2025)

Boltzmann Sampling for Powersets without an Oracle
by: Peyen, Jean
Published: (2026)

Integrating High-Dimensional Functions Deterministically
by: Gamarnik, David, et al.
Published: (2024)

Strong spatial mixing for colorings on trees and its algorithmic applications
by: Chen, Zongchen, et al.
Published: (2023)

Probabilistic estimates of the diameters of the Rubik's Cube groups
by: Hirata, So
Published: (2024)

Additive Sparsification of CSPs
by: Pelleg, Eden, et al.
Published: (2021)

Optimally revealing bits for rejection sampling
by: Langevin, Louis-Roy, et al.
Published: (2025)

Parameter estimation for Gibbs distributions
by: Harris, David G., et al.
Published: (2020)

Fast Makespan Minimization via Short ILPs
by: Hermelin, Danny, et al.
Published: (2026)

Parameterized Complexity of Submodular Minimization under Uncertainty
by: Kakimura, Naonori, et al.
Published: (2024)

A Unified Approach to Minimizing Symmetric Submodular Functions
by: Iwata, Satoru, et al.
Published: (2026)

Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
by: Kaul, Matthias, et al.
Published: (2024)

A Method for Generating Connected Erdos-Renyi Random Graphs
by: Chinyaev, Boris
Published: (2025)

Efficient Online Random Sampling via Randomness Recycling
by: Draper, Thomas L., et al.
Published: (2025)

Sharp Online Hardness for Large Balanced Independent Sets
by: Dhawan, Abhishek, et al.
Published: (2025)

Efficient Rejection Sampling in the Entropy-Optimal Range
by: Draper, Thomas L., et al.
Published: (2025)

The Squishy Grid Problem
by: Cai, Zixi, et al.
Published: (2025)

Instability of backoff protocols with arbitrary arrival rates
by: Goldberg, Leslie Ann, et al.
Published: (2022)

Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs
by: Gamarnik, David, et al.
Published: (2026)

Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs
by: Dhawan, Abhishek, et al.
Published: (2026)

Triangle-free 2-matchings
by: Paluch, Katarzyna
Published: (2023)

Path Contraction Faster than $2^n$
by: Agrawal, Akanksha, et al.
Published: (2025)

On the Structural Parameterizations of 2-Club with Triangle Constraints
by: Jacob, Ashwin, et al.
Published: (2025)