9 citations · 12 across the 8 of their papers we have counts for
8 papers
Universal finitary codes with exponential tails
Nate Harvey, Alexander E. Holroyd, Yuval Peres +1
In 1977, Keane and Smorodinsky showed that there exists a finitary homomorphism from any finite-alphabet Bernoulli process to any other finite-alphabet Bernoulli process of strictl…
The dynamics of Pythagorean triples
Dan Romik
We construct a piecewise onto 3-to-1 dynamical system on the positive quadrant of the unit circle, such that for rational points (which correspond to normalized Primitive Pythagore…
Random walks with -wise independent increments
Itai Benjamini, Gady Kozma, Dan Romik
We construct examples of a random walk with pairwise-independent steps which is almost-surely bounded, and for any and a random walk with -wise independent steps which h…
Limit shapes for random square Young tableaux and plane partitions
Boris Pittel, Dan Romik
Our main result is a limit shape theorem for the two-dimensional surface defined by a uniform random n-by-n square Young tableau. The analysis leads to a calculus of variations min…
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…