SearcharxivSearch

arXiv · 1312.5292

Joint probability density functions of random trajectories through a box

Abstract

A wide range of physical problems can be described by randomly-oriented linear trajectories, including any system of objects, organisms, particles, or rays that follow a linear path. Dependent upon the particular random variables that define translation and direction, a description of the probabilistic behavior through a static volume can reveal evidence on an object's physical properties. Yet more information may be available in cases where this behavior is a function of volume shape. In this study two types of random trajectories are considered as they pass through a box of arbitrary relative dimension. One type defines trajectories from uniform random selection of a spatial location paired with a directional vector; the other is formed from a uniformly distributed position vector on a surface. The joint probability distributions for trajectory length as a function of box position are formulated and then examined for different size boxes, and their physical representations discussed.

Explore related subjects

Keep this discovery

BibTeXRIS

Gregory T. Clement. 2013-12-31. Joint probability density functions of random trajectories through a box. https://arxiv.org/abs/1312.5292

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