Search arXivSearch

arXiv · 2501.14219

The critical velocity of the bullet process appears pathwise

Abstract

In the bullet process, a gun fires bullets in the same direction at independent random speeds, and with independent random time delays between firings. When two bullets collide, they vanish. The critical velocity $v_c$ is the slowest speed the first bullet can take and still have positive probability of surviving forever. We characterize the critical velocity via a random variable determined by the sequence of speeds and delays, which we show almost surely equals $v_c$. In turn we prove other facts about the process, including that infinitely many bullets survive when the velocity distribution has finite support. Along the way we answer a question from Broutin--Marckert (2020), showing that if a bullet survives, it does so in all but finitely many truncations of the process.

Explore related subjects

Keep this discovery

BibTeXRIS

Josh Meisel. 2025-01-24. The critical velocity of the bullet process appears pathwise. https://arxiv.org/abs/2501.14219

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