Establishes variance lower bounds for hitting times of random walks on graphs and disproves a conjecture on local nonconcentration via high-degree constructions.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 3roles
background 1polarities
background 1representative citing papers
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.
Tempering chains achieve polynomial spectral gap lower bounds of order 11-12 for multimodal Gibbs measures without explicit energy landscape structure.
citing papers explorer
-
Nonconcentration of hitting times for random walks on graphs
Establishes variance lower bounds for hitting times of random walks on graphs and disproves a conjecture on local nonconcentration via high-degree constructions.
-
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.
-
Rapid convergence of tempering chains to multimodal Gibbs measures
Tempering chains achieve polynomial spectral gap lower bounds of order 11-12 for multimodal Gibbs measures without explicit energy landscape structure.