Search arXivSearch

arXiv · 1808.09855

Generalizations of TASEP in discrete and continuous inhomogeneous space

Abstract

We investigate a rich new class of exactly solvable particle systems generalizing the Totally Asymmetric Simple Exclusion Process (TASEP). Our particle systems can be thought of as new exactly solvable examples of tandem queues, directed first- or last-passage percolation models, or Robinson-Schensted-Knuth type systems with random input. One of the novel features of the particle systems is the presence of spatial inhomogeneity which can lead to the formation of traffic jams. For systems with special step-like initial data, we find explicit limit shapes, describe hydrodynamic evolution, and obtain asymptotic fluctuation results which put the systems into the Kardar-Parisi-Zhang universality class. At a critical scaling around a traffic jam in the continuous space TASEP, we observe deformations of the Tracy-Widom distribution and the extended Airy kernel, revealing the finer structure of this novel type of phase transitions. A homogeneous version of a discrete space system we consider is a one-parameter deformation of the geometric last-passage percolation, and we obtain extensions of the limit shape parabola and the corresponding asymptotic fluctuation results. The exact solvability and asymptotic behavior results are powered by a new nontrivial connection to Schur measures and processes.

Explore related subjects

Keep this discovery

BibTeXRIS

Alisa Knizel, Leonid Petrov, Axel Saenz. 2018-08-29. Generalizations of TASEP in discrete and continuous inhomogeneous space. https://doi.org/10.1007/s00220-019-03495-4

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