SearcharxivSearch

arXiv · 2501.01378

Random walks and Lorentz processes

Abstract

Random walks and Lorentz processes serve as fundamental models for Brownian motion. The study of random walks is a favorite object of probability theory, whereas that of Lorentz processes belongs to the theory of hyperbolic dynamical systems. Here, we first present examples where the method based on the probabilistic approach led to new insights into the study of the Lorentz process. Motivated by a 1981 question of Sinai about limiting laws for planar locally perturbed Lorentz processes, we first derived that, in the plane, local perturbations of homogeneous random walks leave the limit laws and the limiting processes unchanged - independently whether the walk had bounded or unbounded jumps. Afterward, we obtained probabilistic statements for local perturbations of planar Lorentz processes with finite horizon. (Similar statements for local perturbations of Lorentz processes with infinite horizon is a most interesting open problem!) Often an interesting consequence of a local limit theorem for a process is the recurrence of the same process. In this way, our approach also provides an alternative proof for a 2003 result of Lenci about the recurrence of the locally perturbed Lorentz processes with finite horizon. Afterward an unsolved problem, related to Sinai 1981 question, is formulated as an analogous problem in the language of random walks.

Explore related subjects

Keep this discovery

BibTeXRIS

Domokos Szasz. 2025-01-02. Random walks and Lorentz processes. https://doi.org/10.3390/e26110908

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