activity
20032026
most citedRandom Sorting Networks

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

collaborators

32 papers

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.NT2023★ 1 cited

On Viazovska's modular form inequalities

Dan Romik

Viazovska proved that the lattice sphere packing is the densest sphere packing in 8 dimensions. Her proof relies on two inequalities between functions defined in terms of mod…

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.CO2020★ 5 cited

Sorting networks, staircase Young tableaux and last passage percolation

Elia Bisi, Fabio Deelan Cunden, Shane Gibbons +1

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

math.NT2019★ 4 cited

Orthogonal polynomial expansions for the Riemann xi function

Dan Romik

We study infinite series expansions for the Riemann xi function in three specific families of orthogonal polynomials: (1) the Hermite polynomials; (2) the symmetric Meixner-…