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
6 Pith papers cite this work. Polarity classification is still indexing.
6
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 6roles
background 1polarities
background 1representative citing papers
Greedy vector balancing on finite unit-vector sets T in R^d achieves norm bound (2/δ_T)^{d-1} independent of sequence length n.
Proves ∃R-hardness of approximating MAX-ETR-INV to within a constant factor and gives polynomial-time 8-factor and nondeterministic 2-factor approximation algorithms.
n/log n-approximation for MaxMin ISR on general graphs, polynomial-time approximation on degenerate graphs, FPT-AS on bounded-treewidth and H-minor-free graphs, plus inapproximability on bounded-degree, bandwidth n^{1/2+Θ(1)}, and bipartite graphs.
SeedER uses initial dense seeding followed by RL-driven selective expansion to improve recall on compositional KG queries while limiting candidate set size.
GeneCS compiler reduces ancillary qubits and checks by over 85% on average for single- and cross-code logical operations on stabilizer codes while preserving error rates and scaling to over 10,000 qubits.
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.
-
Greedy Vector Balancing
Greedy vector balancing on finite unit-vector sets T in R^d achieves norm bound (2/δ_T)^{d-1} independent of sequence length n.
-
Probabilistically checkable proofs for the Existential Theory of the Reals
Proves ∃R-hardness of approximating MAX-ETR-INV to within a constant factor and gives polynomial-time 8-factor and nondeterministic 2-factor approximation algorithms.
-
On (In)approximability of MaxMin Independent Set Reconfiguration
n/log n-approximation for MaxMin ISR on general graphs, polynomial-time approximation on degenerate graphs, FPT-AS on bounded-treewidth and H-minor-free graphs, plus inapproximability on bounded-degree, bandwidth n^{1/2+Θ(1)}, and bipartite graphs.
-
SeedER: Seed-and-Expand Retrieval from Knowledge Graphs
SeedER uses initial dense seeding followed by RL-driven selective expansion to improve recall on compositional KG queries while limiting candidate set size.
-
GeneCS: Synthesizing Resource-Efficient Code Surgery for Arbitrary Quantum Stabilizer Codes
GeneCS compiler reduces ancillary qubits and checks by over 85% on average for single- and cross-code logical operations on stabilizer codes while preserving error rates and scaling to over 10,000 qubits.