8 citations · 11 across the 5 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
math.PR2026
Last-Coverage Probabilities of Random Walks on Cycle Graphs for Symmetric, Biased, and Time-Dependent Walks
Kiyan Idnani, Jad Salem
This paper studies the last-coverage vertex of a nearest-neighbour random walk on a cycle: the vertex most likely to be the final one discovered. We show that the visited vertices…
quant-ph2026
Quantum Hypergraph Partitioning
Cameron Ibrahim, Bao G. Bach, Jad Salem +4
Quantum optimization algorithms are inherently probabilistic, yet they are most often used to search for a single high-quality solution. In this paper, we instead study hypergraph…
quant-ph2026
Learning Cut Distributions with Quantum Optimization
Bao Bach, Cameron Ibrahim, Reuben Tate +3
Many combinatorial optimization problems admit a maximin fairness variant, where the aim is to find a distribution over possible solutions which maximizes an expected worst-case ou…