SearcharxivSearch

arXiv · 1912.00645

Generalised directed last passage percolation: invariant laws on the cylinders

Abstract

The directed last passage percolation (LPP) on the quarter-plane is a growing model. To come into the growing set, a cell needs that the cells on its bottom and on its left to be in the growing set, and then to wait a random time. We present here a generalisation of directed last passage percolation (GLPP). In GLPP, the waiting time of a cell depends on the difference of the coming times of its bottom and left cells. We explain in this article the physical meaning of this generalisation. In this first work on GLPP, we study them as a growing model on the cylinders rather than on the quarter-plane, the eighth-plane or the half-plane. We focus, mainly, on the law of the front line. In particular, we prove, in some integrable cases, that this law could be given explicitly as a function of the parameters of the model. These new results are obtained by the use of probabilistic cellular automata (PCA) to study LPP and GLPP.

Explore related subjects

Keep this discovery

BibTeXRIS

Jérôme Casse. 2019-12-02. Generalised directed last passage percolation: invariant laws on the cylinders. https://arxiv.org/abs/1912.00645

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR