SearcharxivSearch

arXiv · 2411.17023

On the first hitting time of a high-dimensional orthant

Abstract

We consider a collection of independent standard Brownian particles (or random walks), starting from a configuration where at least one particle is positive, and study the first time they all become negative. This is clearly equivalent to studying the first hitting time from the negative orthant or the first exit time from the complement of the negative orthant. While it turns out to be possible to compute the distribution of these hitting times for one and two particles, the distribution (and even its tail asymptotics) is not known in closed form for three or more particles. In this paper we study the tail asymptotics of the distribution as the number of particles tends to infinity. Our main techniques come from spectral geometry: we prove new asymptotic estimates for the principal eigenvalue of the complement of a high-dimensional orthant, which we believe are of independent interest.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Emmanuel Humbert, Kilian Raschel. 2024-11-26. On the first hitting time of a high-dimensional orthant. https://arxiv.org/abs/2411.17023

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