SearcharxivSearch

arXiv · 1107.5913

Flying randomly in $\mathbb{R}^d$ with Dirichlet displacements

Abstract

Random flights in $\mathbb{R}^d,d\geq 2,$ with Dirichlet-distributed displacements and uniformly distributed orientation are analyzed. The explicit characteristic functions of the position $\underline{\bf X}_d(t),\,t>0,$ when the number of changes of direction is fixed are obtained. The probability distributions are derived by inverting the characteristic functions for all dimensions $d$ of $\mathbb{R}^d$ and many properties of the probabilistic structure of $\underline{\bf X}_d(t),t>0,$ are examined. If the number of changes of direction is randomized by means of a fractional Poisson process, we are able to obtain explicit distributions for $P\{\underline{\bf X}_d(t)\in d\underline{\bf x}_d\}$ for all $d\geq 2$. A Section is devoted to random flights in $\mathbb{R}^3$ where the general results are discussed. The existing literature is compared with the results of this paper where in our view the classical Pearson's problem of random flights is resolved by suitably randomizing the step lengths. The random flights where changes of direction are governed by a homogeneous Poisson process are analyzed and compared with the model of Dirichlet-distributed displacements of this work.

Explore related subjects

Keep this discovery

BibTeXRIS

Alessandro De Gregorio, Enzo Orsingher. 2011-07-29. Flying randomly in $\mathbb{R}^d$ with Dirichlet displacements. https://arxiv.org/abs/1107.5913

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