Related papers: Sorting networks, staircase Young tableaux and las…
We present new probabilistic and combinatorial identities relating three random processes: the oriented swap process on $n$ particles, the corner growth process, and the last passage percolation model. We prove one of the probabilistic…
In this note we provide a short proof of the distributional equality between last passage percolation with geometric weights along a general down-right path and Schur processes. We do this in both the full-space and half-space settings, and…
This paper studies a number of matrix models of size n and the associated Markov chains for the eigenvalues of the models for consecutive n's. They are consecutive principal minors for two of the models, GUE with external source and the…
It has been shown that the last passage time in certain symmetrized models of directed percolation can be written in terms of averages over random matrices from the classical groups $U(l)$, $Sp(2l)$ and $O(l)$. We present a theory of such…
A sorting network is a shortest path from 12...n to n...21 in the Cayley graph of S_n generated by nearest-neighbour swaps. We prove that for a uniform random sorting network, as n->infinity the space-time process of swaps converges to the…
We introduce and study a model of directed last-passage percolation in planar layered environment. This environment is represented by an array of random exponential clocks arranged in blocks, for each block the average waiting times depend…
Particles labelled $1,...,n$ are initially arranged in increasing order. Subsequently, each pair of neighboring particles that is currently in increasing order swaps according to a Poisson process of rate 1. We analyze the asymptotic…
Last three years have seen new developments in the theory of last passage percolation, which has variety applications to random permutations, random growth and random vicious walks. It turns out that a few class of models have determinant…
We explore the connection between tasep-like interacting particle systems and last passage percolation type polymer models, focusing on three models: Geometric, Exponential and Brownian last passage percolation and their associated tasep…
We prove a new shift-invariance property of the colored TASEP. From the shift-invariance of the colored stochastic six-vertex model (proved in Borodin-Gorin-Wheeler or Galashin), one can get a shift-invariance property of the colored TASEP…
In this paper we prove a duality relation between coalescence times and exit points in last-passage percolation models with exponential weights. As a consequence, we get lower bounds for coalescence times with scaling exponent 3/2, and we…
We study the last-passage growth model on the planar integer lattice with exponential weights. With boundary conditions that represent the equilibrium exclusion process as seen from a particle right after its jump we prove that the variance…
We present a version of the RSK correspondence based on the Pitman transform and geometric considerations. This version unifies ordinary RSK, dual RSK and continuous RSK. We show that this version is both a bijection and an isometry, two…
We consider directed random graphs, the prototype of which being the Barak-Erd\H{o}s graph $\vec G(\mathbb Z, p)$, and study the way that long (or heavy, if weights are present) paths grow. This is done by relating the graphs to certain…
We analyze the geometrical structure of the passage times in the last passage percolation model. Viewing the passage time as a piecewise linear function of the weights we determine the domains of the various pieces, which are the subsets of…
We study random typical minimal factorizations of the $n$-cycle, which are factorizations of $(1, \ldots,n)$ as a product of $n-1$ transpositions, chosen uniformly at random. Our main result is, roughly speaking, a local convergence theorem…
A first-order percolation transition, called explosive percolation, was recently discovered in evolution networks with random edge selection under a certain restriction. However, the network percolation with more realistic evolution…
For directed last passage percolation on $\mathbb{Z}^2$ with exponential passage times on the vertices, let $T_{n}$ denote the last passage time from $(0,0)$ to $(n,n)$. We consider asymptotic two point correlation functions of the sequence…
In sorting situations where the final destination of each item is known, it is natural to repeatedly choose items and place them where they belong, allowing the intervening items to shift by one to make room. (In fact, a special case of…
We study the combinatorial structure of the irreducible characters of the classical groups ${\rm GL}_n(\mathbb{C})$, ${\rm SO}_{2n+1}(\mathbb{C})$, ${\rm Sp}_{2n}(\mathbb{C})$, ${\rm SO}_{2n}(\mathbb{C})$ and the "non-classical" odd…