SearcharxivSearch

arXiv · 2604.22644

Analysis of an Inhomogeneous Random Walk with Spatial Decay of Transition Probabilities and Parameter Renewal per Excursion

Abstract

In this paper, we propose and analyze a novel one-dimensional inhomogeneous random walk model that combines spatial decay of transition probabilities with a temporal renewal structure for each excursion. In this model, the probability of moving to the right from each state creats a spatial inhomogeneity that causes a stronger pull-back toward the origin as the process moves farther away. Furthermore, it features a random environment aspect where the parameter of each transition probability is independently resampled from a uniform distribution at the beginning of each excursion. We rigorously derive the hitting probability to an upper boundary using a scale function. Furthermore, by solving linear difference equations, we provide the probability generating function of the first hitting time, the expected occupation time for each state during an excursion (discrete Green's function), and the distribution and expectation of the maximum penetration depth.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Naohiro Yoshida. 2026-04-24. Analysis of an Inhomogeneous Random Walk with Spatial Decay of Transition Probabilities and Parameter Renewal per Excursion. https://arxiv.org/abs/2604.22644

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