SearcharxivSearch

arXiv · 2208.03014

Analytical description of the diffusion in a cellular automaton with the Margolus neighbourhood in terms of the two-dimensional Markov chain

Abstract

The one-parameter two-dimensional cellular automaton with the Margolus neighbourhood is analyzed based on the considering the projection of the stochastic movements of a single particle. Introducing the auxiliary random variable associated with the direction of the movement, we reduce the problem under consideration to the study of a two-dimensional Markov chain. The master equation for the probability distribution is derived and solved exactly using the probability generating function method. The probability distribution is expressed analytically in terms of Jacobi polynomials. The moments of the obtained solution allowed us to derive the exact analytical formula for the parametric dependence of the diffusion coefficient in the two-dimensional cellular automaton with the Margolus neighbourhood. Our analytic results agree with earlier empirical results of other authors and refine them. The results are of interest for the modelling two-dimensional diffusion using cellular automata especially for the multicomponent problem.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anton Kulagin, Alexander Shapovalov. 2022-08-05. Analytical description of the diffusion in a cellular automaton with the Margolus neighbourhood in terms of the two-dimensional Markov chain. https://doi.org/10.3390/math11030584

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