9 citations · 12 across the 8 of their papers we have counts for
4 papers · 1 filter
Waiting for a bat to fly by (in polynomial time)
Itai Benjamini, Gady Kozma, Laszlo Lovasz +2
We observe returns of a simple random walk on a finite graph to a fixed node, and would like to infer properties of the graph, in particular properties of the spectrum of the trans…
Shortest paths in the Tower of Hanoi graph and finite automata
Dan Romik
We present efficient algorithms for constructing a shortest path between two states in the Tower of Hanoi graph, and for computing the length of the shortest path. The key element…
Explicit formulas for hook walks on continual Young diagrams
Dan Romik
We consider, following the work of S. Kerov, random walks which are continuous-space generalizations of the Hook Walks defined by Greene-Nijenhuis-Wilf, performed under the graph o…
Integrals, Partitions, and Cellular Automata
Alexander E. Holroyd, Thomas M. Liggett, Dan Romik
We prove that where is the decreasing function that satisfies , for . When is an integer and $b=…