Search arXivSearch

arXiv · 1808.08074

Large deviations and one-sided scaling limit of randomized multicolor box-ball system

Abstract

The basic $\kappa$-color box-ball (BBS) system is an integrable cellular automaton on one dimensional lattice whose local states take $\{0,1,\cdots,\kappa \}$ with $0$ regarded as an empty box. The time evolution is defined by a combinatorial rule of quantum group theoretical origin, and the complete set of conserved quantities is given by a $\kappa$-tuple of Young diagrams. In the randomized BBS, a probability distribution on $\{0,1,\cdots,\kappa \}$ to independently fill the consecutive $n$ sites in the initial state induces a highly nontrivial probability measure on the $\kappa$-tuple of those invariant Young diagrams. In a recent work \cite{kuniba2018randomized}, their large $n$ `equilibrium shape' has been determined in terms of Schur polynomials by a Markov chain method and also by a very different approach of Thermodynamic Bethe Ansatz (TBA). In this paper, we establish a large deviations principle for the row lengths of the invariant Young diagrams. As a corollary, they are shown to converge almost surely to the equilibrium shape at an exponential rate. We also refine the TBA analysis and obtain the exact scaling form of the vacancy, the row length and the column multiplicity, which exhibit nontrivial factorization in a one-parameter specialization.

Explore related subjects

Keep this discovery

BibTeXRIS

Atsuo Kuniba, Hanbaek Lyu. 2018-08-24. Large deviations and one-sided scaling limit of randomized multicolor box-ball system. https://doi.org/10.1007/s10955-019-02417-x

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