SearcharxivSearch

arXiv · 1908.08481

Rayleigh Random Flights on the Poisson line SIRSN

Abstract

We study scale-invariant Rayleigh Random Flights ("RRF") in random environments given by planar Scale-Invariant Random Spatial Networks ("SIRSN") based on speed-marked Poisson line processes. A natural one-parameter family of such RRF (with scale-invariant dynamics) can be viewed as producing "randomly-broken local geodesics" on the SIRSN; we aim to shed some light on a conjecture that a (non-broken) geodesic on such a SIRSN will never come to a complete stop en route. (If true, then all such geodesics can be represented as doubly-infinite sequences of sequentially connected line segments. This would justify a natural procedure for computing geodesics.) The family of these RRF ("SIRSNRRF"), is introduced via a novel axiomatic theory of abstract scattering representations for Markov chains (itself of independent interest). Palm conditioning (specifically the Mecke-Slivnyak theorem for Palm probabilities of Poisson point processes) and ideas from the ergodic theory of random walks in random environments are used to show that at a critical value of the parameter the speed of the scale-invariant SIRSNRRF neither diverges to infinity nor tends to zero, thus supporting the conjecture.

Explore related subjects

Keep this discovery

BibTeXRIS

Wilfrid Stephen Kendall. 2019-08-22. Rayleigh Random Flights on the Poisson line SIRSN. https://arxiv.org/abs/1908.08481

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