Deterministic (1+ε)-approximation algorithm for the volume of the unit hypercube truncated by k sums-of-univariate-convex constraints, running in poly_k(n, 1/ε, L, L_o) time.
A Chernoff bound for random walks on expander graphs
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Derives matrix concentration inequalities for time-inhomogeneous Markov chains under positive Ollivier-Ricci curvature or Saloff-Coste-Zuniga spectral gap, illustrated on dynamic Bradley-Terry-Luce models.
citing papers explorer
-
Deterministic Volume Estimation of Truncated Hypercubes
Deterministic (1+ε)-approximation algorithm for the volume of the unit hypercube truncated by k sums-of-univariate-convex constraints, running in poly_k(n, 1/ε, L, L_o) time.
-
Matrix concentration inequalities for time-inhomogeneous Markov chains
Derives matrix concentration inequalities for time-inhomogeneous Markov chains under positive Ollivier-Ricci curvature or Saloff-Coste-Zuniga spectral gap, illustrated on dynamic Bradley-Terry-Luce models.