A Cyclic Random Motion in R3\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathbb {R}^3$$\\end{document} Driven by Geometric Counting Processes

Abstract

We consider the random motion of a particle that moves with constant velocity in R3\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathbb {R}^3$$\\end{document}. The particle can move along four different directions that are attained cyclically. It follows that the support of the stochastic process describing the particle’s position at a fixed time is a tetrahedron. We assume that the sequence of sojourn times along each direction follows a Geometric Counting Process (GCP). When the initial condition is fixed, we obtain the explicit form of the probability law of the process, for the particle’s position. We also investigate the limiting behavior of the related probability density when the intensities of the four GCPs tend to infinity. Furthermore, we show that the process does not admit a stationary density. Finally, we introduce the first-passage-time problem for the first component of the process through a constant positive boundary providing the bases for future developments.