SearcharxivSearch

arXiv · 0910.0044

The Discrete and Continuum Broken Line Process

Abstract

In this work we introduce the discrete-space broken line process (with discrete and continues parameter values) and derive some of its properties. We explore polygonal Markov fields techniques developed by Arak-Surgailis. The discrete version is presented first and a natural continuum generalization to a continuous object living on the discrete lattice is then proposed and studied. The broken lines also resemble the Young diagram and the Hammersley process and are useful for computing last passage percolation values and finding maximal oriented paths. For a class of passage time distributions there is a family of boundary conditions that make the process stationary and self-dual. For such distributions there is a law of large numbers and the process extends to the infinite lattice. A proof of Burke's theorem emerges from the construction. We present a simple proof of the explicit law of large numbers for last passage percolation as an application. Finally we show that the exponential and geometric distributions are the only non-trivial ones that yield self-duality.

Explore related subjects

Keep this discovery

BibTeXRIS

Leonardo T. Rolla, Vladas Sidoravicius, Donatas Surgailis, Maria E. Vares. 2009-09-30. The Discrete and Continuum Broken Line Process. https://arxiv.org/abs/0910.0044

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