Related papers: The oriented swap process and last passage percola…
Consider a haploid population which has evolved through an exchangeable reproduction dynamics, and in which all individuals alive at time $t$ have a most recent common ancestor (MRCA) who lived at time $A_t$, say. As time goes on, not only…
The ring of symmetric functions has a basis of dual Grothendieck polynomials that are inhomogeneous $K$-theoretic deformations of Schur polynomials. We prove that dual Grothendieck polynomials determine column distributions for a directed…
A competition model on $\mathbb{Z}_+^{2}$ governed by directed last passage percolation is considered. A stochastic domination argument between subtrees of the last passage percolation is put forward.
We solve exactly the non-equilibrium dynamics of two discrete random walkers moving in channels with transition rates $p \neq q$ that swap positions at a rate $s$. We compute exactly the joint probability distribution $P_{n,m}(t)$ for the…
We consider one-dimensional diffusions, with polynomial drift and diffusion coefficients, so that in particular the motion can be space-inhomogeneous, interacting via one-sided reflections. The prototypical example is the well-known model…
A local order parameter which is important in the analysis of phase transitions in frustrated combinatorial problems is the probability that a node is frozen in a particular state. There is a percolative transition when an infinite…
We investigate the component sizes of the critical configuration model, as well as the related problem of critical percolation on a supercritical configuration model. We show that, at criticality, the finite third moment assumption on the…
The $n$-dimensional binary hypercube is the graph whose vertices are the binary $n$-tuples $\{0, 1\}^n$ and where two vertices are connected by an edge if they differ at exactly one coordinate. We prove that if the edges are assigned…
We establish three identities involving Dyck paths and alternating Motzkin paths, whose proofs are based on variants of the same bijection. We interpret these identities in terms of closed random walks on the halfline. We explain how these…
Eight combinatorial identities are listed and proved by counting paths in the one-dimensional random walk. Four of these identities are assumed to be new.
The 1+1 dimensional directed polymers in a Poissonean random environment is studied. For two polymers of maximal length with the same origin and distinct end points we establish that the point of last branching is governed by the exponent…
In the interchange process on a graph $G=(V,E)$, distinguished particles are placed on the vertices of $G$ with independent Poisson clocks on the edges. When the clock of an edge rings, the two particles on the two sides of the edge…
The probabilities for gaps in the eigenvalue spectrum of finite $ N\times N $ random unitary ensembles on the unit circle with a singular weight, and the related hermitian ensembles on the line with Cauchy weight, are found exactly. The…
Motivated by its relevance for the study of perturbations of one-dimensional voter models, including stochastic Potts models at low temperature, we consider diffusively rescaled coalescing random walks with branching and killing. Our main…
In this note, we prove convergence of the half-space exponential last passage percolation (LPP) model, away from the boundary, to the directed landscape. Our approach couples the half-space and full-space LPP models and constructs two…
The orientational memory of particles can serve as an effective measure of diffusivity, spreading, and search efficiency in complex stochastic processes. We develop a theoretical framework to describe the decay of directional correlations…
In this paper we will prove a shape theorem for the last passage percolation model on a two dimensional $F$-compound Poisson process, called the Hammersley model with random weights. We will also provide diffusive upper bounds for shape…
We identify a fundamental phenomenon of heterogeneous one dimensional random walks: the escape (traversal) time is maximized when the heterogeneity in transition probabilities forms a pyramid-like potential barrier. This barrier corresponds…
We consider the exponential last passage percolation (LPP) with thick two-sided boundary that consists of a few inhomogeneous columns and rows. Ben Arous and Corwin previously studied the limit fluctuations in this model except in a…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…