3 papers
math.CO2026
On the expansion of Hanoi graphs
David Eppstein, Daniel Frishberg, William Maxwell
The famous Tower of Hanoi puzzle involves moving discs of distinct sizes from one of pegs (traditionally ) to another of the pegs, subject to the constraints tha…
math.CO2026
Faster Mixing for Triangulations via Transport Flows
Vedat Levi Alev, Daniel Frishberg, Michail Sarantis +1
We prove an bound for the relaxation time and the log-Sobolev time (inverse log-Sobolev constant) of the classical triangulation flip chain on a convex -…
cs.DC2025
Improved Distributed Algorithms for Random Colorings
Charlie Carlson, Daniel Frishberg, Eric Vigoda
We study distributed versions of Markov Chain Monte Carlo (MCMC) algorithms for generating random -colorings of an input graph with maximum degree . In the sequential settin…