activity
20032026
most citedRandom Sorting Networks

81 citations · 258 across the 31 of their papers we have counts for

collaborators
Showing math.PRShow all

16 papers · 1 filter

math.PR2026

Jeu de taquin forests and the inverse infinite RSK correspondence

Dan Romik, Piotr Śniady

The Plancherel-random infinite Young tableau arises from applying the infinite Robinson-Schensted-Knuth (RSK) correspondence to a sequence of i.i.d. random variables distributed un…

math.PR2020★ 1 cited

The oriented swap process and last passage percolation

Elia Bisi, Fabio Deelan Cunden, Shane Gibbons +1

We present new probabilistic and combinatorial identities relating three random processes: the oriented swap process on particles, the corner growth process, and the last passa…

math.PR2020

Absorbing time asymptotics in the oriented swap process

Alexey Bufetov, Vadim Gorin, Dan Romik

The oriented swap process is a natural directed random walk on the symmetric group that can be interpreted as a multi-species version of the Totally Asymmetric Simple Exclusion Pro…

math.PR2013★ 8 cited

Connectivity patterns in loop percolation I: the rationality phenomenon and constant term identities

Dan Romik

Loop percolation, also known as the dense O(1) loop model, is a variant of critical bond percolation in the square lattice Z^2 whose graph structure consists of a disjoint union of…

math.PR2011★ 32 cited

Jeu de taquin dynamics on infinite Young tableaux and second class particles

Dan Romik, Piotr Śniady

We study an infinite version of the "jeu de taquin" sliding game, which can be thought of as a natural measure-preserving transformation on the set of infinite Young tableaux equip…

math.PR2009★ 19 cited

Arctic circles, domino tilings and square Young tableaux

Dan Romik

The arctic circle theorem of Jockusch, Propp, and Shor asserts that uniformly random domino tilings of an Aztec diamond of high order are frozen with asymptotically high probabilit…