SearcharxivSearch

arXiv · 2508.14202

Passage times of fast inhomogeneous immigration processes

Abstract

In many biophysical systems, key events are triggered when the fastest of many random searchers find a target. Most mathematical models of such systems assume that all searchers are initially present in the search domain, which permits the use of classical extreme value theory. In this paper, we explore $k$th passage times of inhomogeneous immigration processes where searchers are added to the domain over time either through time inhomogeneous rates or a Yule (pure birth) process. We rigorously prove convergence in distribution and convergence of moments of the $k$th passage times for both processes as immigration rates grow. In particular, we relate immigration with time inhomogeneous rates to previous work where all searchers are initially present through a coupling argument and demonstrate how immigration through a Yule process can be viewed as a time inhomogeneous immigration process with a random time shift. For Yule immigration, we find that the extreme distributions depart from the classical family of Frechet, Gumbel, and Weibull, and we compare our results to classical theorems on branching Brownian motion. This work offers one of the few examples where extreme value distributions can be obtained exactly for random variables which are neither independent nor identically distributed.

Explore related subjects

Keep this discovery

BibTeXRIS

Hwai-Ray Tung, Sean D Lawley. 2025-08-19. Passage times of fast inhomogeneous immigration processes. https://arxiv.org/abs/2508.14202

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