3 papers
math.PR2024
Time-Biased Random Walks and Robustness of Expanders
Sam Olesker-Taylor, Thomas Sauerwald, John Sylvester
Random walks on expanders play a crucial role in Markov Chain Monte Carlo algorithms, derandomization, graph theory, and distributed computing. A desirable property is that they ar…
cs.DM2023★ 5 cited
Balanced Allocations with Heterogeneous Bins: The Power of Memory
Dimitrios Los, Thomas Sauerwald, John Sylvester
We consider the allocation of balls (jobs) into bins (servers). In the standard Two-Choice process, at each step we first sample two bins uniformly at rand…
math.AP2016
Uncertainty principles for inverse source problems, far field splitting and data completion
Roland Griesmaier, John Sylvester
Starting with far field data of time-harmonic acoustic or electromagnetic waves radiated by a collection of compactly supported sources in two-dimensional free space, we develop cr…