SearcharxivSearch

arXiv · 1301.6579

From pseudo-random walk to pseudo-Brownian motion: first exit time from a one-sided or a two-sided interval

Abstract

Let $N$ be a positive integer, $c$ be a positive constant and $(U_n)_{n\ge 1}$ be a sequence of independent identically distributed pseudo-random variables. We assume that the $U_n$'s take their values in the discrete set $\{-N,-N+1,...,N-1,N\}$ and that their common pseudo-distribution is characterized by the \textit{(positive or negative) real} numbers \[\mathbb{P}\{U_n=k\}=δ_{k0}+(-1)^{k-1} c\binom{2N}{k+N}\] for any $k\in\{-N,-N+1,...,N-1,N\}$. Let us finally introduce $(S_n)_{n\ge 0}$ the associated pseudo-random walk defined on $\mathbb{Z}$ by $S_0=0$ and $S_n=\sum_{j=1}^n U_j$ for $n\ge 1$. In this paper, we exhibit some properties of $(S_n)_{n\ge 0}$. In particular, we explicitly determine the pseudo-distribution of the first overshooting time of a given threshold for $(S_n)_{n\ge 0}$ as well as that of the first exit time from a bounded interval. Next, with an appropriate normalization, we pass from the pseudo-random walk to the pseudo-Brownian motion driven by the high-order heat-type equation $\partial/\partial t=(-1)^{N-1} c\;\partial^{2N}/$ $\partial x^{2N}$. We retrieve the corresponding pseudo-distribution of the first overshooting time of a threshold for the pseudo-Brownian motion (Lachal, A.: First hitting time and place, monopoles and multipoles for pseudo-processes driven by the equation $\frac{\partial}{\partial t}=\pm \frac{\partial^N}{\partial x^N}$. Electron. J. Probab. 12 (2007), 300--353 [MR2299920]). In the same way, we get the pseudo-distribution of the first exit time from a bounded interval for the pseudo-Brownian motion which is a new result for this pseudo-process.

Explore related subjects

Keep this discovery

BibTeXRIS

Aimé Lachal. 2013-01-28. From pseudo-random walk to pseudo-Brownian motion: first exit time from a one-sided or a two-sided interval. https://doi.org/10.1155/2014%2F520136

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