SearcharxivSearch

arXiv · 1302.5413

Limiting geodesics for first-passage percolation on subsets of $\mathbb{Z}^2$

Abstract

It is an open problem to show that in two-dimensional first-passage percolation, the sequence of finite geodesics from any point to $(n,0)$ has a limit in $n$. In this paper, we consider this question for first-passage percolation on a wide class of subgraphs of $\mathbb {Z}^2$: those whose vertex set is infinite and connected with an infinite connected complement. This includes, for instance, slit planes, half-planes and sectors. Writing $x_n$ for the sequence of boundary vertices, we show that the sequence of geodesics from any point to $x_n$ has an almost sure limit assuming only existence of finite geodesics. For all passage-time configurations, we show existence of a limiting Busemann function. Specializing to the case of the half-plane, we prove that the limiting geodesic graph has one topological end; that is, all its infinite geodesics coalesce, and there are no backward infinite paths. To do this, we prove in the Appendix existence of geodesics for all product measures in our domains and remove the moment assumption of the Wehr-Woo theorem on absence of bigeodesics in the half-plane.

Explore related subjects

Keep this discovery

BibTeXRIS

Antonio Auffinger, Michael Damron, Jack Hanson. 2013-02-21. Limiting geodesics for first-passage percolation on subsets of $\mathbb{Z}^2$. https://doi.org/10.1214/13-aap999

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