SearcharxivSearch

arXiv · 2512.19822

Asymptotics of returns to the coordinate axes for conditioned planar simple random walks

Abstract

In this paper we study the number of returns to the coordinate axes for two-dimensional nearest-neighbour random walks. While one-dimensional results on returns are classical, much less is known in higher dimensions. We analyse the asymptotic behaviour of returns under several natural conditionings: the unconditioned walk, bridges, meanders, and non-negative bridges (or excursions). Our main results characterize the limiting distributions under appropriate rescaling. The resulting one-dimensional marginals may be half-normal, Rayleigh, geometric, negative binomial, or certain mixtures thereof. In most situations, the coordinates are asymptotically independent; however, there are notable exceptions for the meander case, depending on the drift. The proofs rely on conditioning on the numbers of horizontal and vertical steps, which restores a form of independence and reduces the problem to one-dimensional estimates via binomial convolution and Bernstein-type approximations.

Explore related subjects

Keep this discovery

BibTeXRIS

Rodolphe Garbit, Kilian Raschel. 2025-12-22. Asymptotics of returns to the coordinate axes for conditioned planar simple random walks. https://arxiv.org/abs/2512.19822

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