Related papers: The oriented swap process and last passage percola…
We give the first properties of independent Bernoulli percolation, for oriented graphs on the set of vertices $\Z^d$ that are translation-invariant and may contain loops. We exhibit some examples showing that the critical probability for…
In this paper, we obtain optimal uniform lower tail estimates for the probability distribution of the properly scaled length of the longest up/right path of the last passage site percolation model considered by Johansson in [12]. The…
The conjectured limit of last passage percolation is a scale-invariant, independent, stationary increment process with respect to metric composition. We prove this for Brownian last passage percolation. We construct the Airy sheet and…
We study the two-time distribution in directed last passage percolation with geometric weights in the first quadrant. We compute the scaling limit and show that it is given by a contour integral of a Fredholm determinant.
In this paper we consider an equilibrium last-passage percolation model on an environment given by a compound two-dimensional Poisson process. We prove an $\LL^2$-formula relating the initial measure with the last-passage percolation time.…
We assess the probability of resonances between sufficiently distant states in a combinatorial graph serving as the configuration space of an N-particle disordered quantum system. This includes the cases where the transition "shuffles" the…
In [O'Connell and Yor (2002)] a path-transformation G was introduced with the property that, for X belonging to a certain class of random walks on the integer lattice, the transformed walk G(X) has the same law as that of the original walk…
We consider directed last-passage percolation on the random graph G = (V,E) where V = Z and each edge (i,j), for i < j, is present in E independently with some probability 0 < p <= 1. To every present edge (i,j) we attach i.i.d. random…
We prove a strong law of large numbers for directed last passage times in an independent but inhomogeneous exponential environment. Rates for the exponential random variables are obtained from a discretisation of a speed function that may…
Consider a model of $N$ independent, increasing $\mathbb{N}_0$-valued processes, with random, independent waiting times between jumps. It is known that there is either an emergent `leader', in which a single process possesses the maximal…
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…
We study the last passage time in geometric last passage percolation (LPP). As the system size increases, we derive precise large deviation probabilities -- up to and including the constant terms -- for both the lower and upper tails. A key…
We present conjectured exact expressions for two types of correlations in the dense O$(n=1)$ loop model on $L\times \infty$ square lattices with periodic boundary conditions. These are the probability that a point is surrounded by $m$ loops…
We give a simple statistical proof of a binomial identity, by evaluating the Laplace transform of the maximum of n independent exponential random variables in two different ways. As a by product, we obtain a simple proof of an interesting…
The Inverse First Passage time problem seeks to determine the boundary corresponding to a given stochastic process and a fixed first passage time distribution. Here, we determine the numerical solution of this problem in the case of a two…
A random walk problem with particles on discrete double infinite linear grids is discussed. The model is based on the work of Montroll and others. A probability connected with the problem is given in the form of integrals containing…
We present a coupled decreasing sequence of random walks on $ \mathbb Z $ that dominates the edge process of oriented-bond percolation in two dimensions. Using the concept of "random walk in a strip ", we construct an algorithm that…
This paper focuses on the time constant for last passage percolation on complete graph. Let $G_n=([n],E_n)$ be the complete graph on vertex set $[n]=\{1,2,\ldots,n\}$, and i.i.d. sequence $\{X_e:e\in E_n\}$ be the passage times of edges.…
In this note we give a(nother) combinatorial proof of an old result of Baik--Rains: that for appropriately considered independent geometric weights, the generating series for last passage percolation polymers in a $2n \times n \times n$…
A useful result about leftmost and rightmost paths in two dimensional bond percolation is proved. This result was introduced without proof in \cite{G} in the context of the contact process in continuous time. As discussed here, it also…