Search arXivSearch

arXiv · 2607.07589

Surviving from the tip of a cone in competing first-passage percolation

Abstract

In two-type first passage percolation on $\mathbb{Z}^2$, two entities compete to capture the sites of the lattice. The entities spread between nearest neighbor sites at times specified by random passage times associated with the edges. We consider the case when both types have the same passage time distribution, with one type starting at the origin and the other from an infinite cone with tip at the origin and pointing in direction $\theta$. Itai Benjamini has suggested that the type starting at the origin can grow unboundedly if and only if the slope of the cone is strictly smaller than $\pi/2$, so that the cone does not fill a whole half-plane. The main result is that this is correct for any $\theta$ such that the asymptotic shape of the one-type process has a tangent line with direction $\theta$. The proofs are based on a description of infinite time-minimizing paths in terms of Busemann functions together with local modification arguments.

Explore related subjects

Keep this discovery

BibTeXRIS

Daniel Ahlberg, Maria Deijfen, Matteo Sfragara. 2026-07-08. Surviving from the tip of a cone in competing first-passage percolation. https://arxiv.org/abs/2607.07589

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