SearcharxivSearch

arXiv · 1611.02005

First passage percolation in Euclidean space and on random tessellations

Abstract

There are various models of first passage percolation (FPP) in $\mathbb R^d$. We want to start a very general study of this topic. To this end we generalize the first passage percolation model on the lattice $\mathbb Z^d$ to $\mathbb R^d$ and adapt the results of \cite{boivin1990first} to prove a shape theorem for ergodic random pseudometrics on $\mathbb R^d$. A natural application of this result will be the study of FPP on random tessellations where a fluid starts in the zero cell and takes a random time to pass through the boundary of a cell into a neighbouring cell. We find that a tame random tessellation, as introduced in the companion paper \cite{ziesche2016bernoulli}, has a positive time constant. This is used to derive a spatial ergodic theorem for the graph induced by the tessellation. Finally we take a look at the Poisson hyperplane tessellation, give an explicit formula to calculate it's FPP limit shape and bound the speed of convergence in the corresponding shape theorem.

Explore related subjects

Keep this discovery

BibTeXRIS

Sebastian Ziesche. 2016-11-07. First passage percolation in Euclidean space and on random tessellations. https://arxiv.org/abs/1611.02005

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