It is a well-known result that almost all sample paths of a Brownian motion or Wiener process {W(t)} have infinitely many zero-crossings in the interval (0, δ) for δ > 0. Under the Kac condition, the telegraph process weakly converges to the Wiener process. We estimate the number of intersections of a level or the number of level-crossings for the telegraph process. Passing to the limit under the Kac condition, we also obtain an estimate of the level-crossings for the Wiener process.
Similar content being viewed by others
References
A. A. Pogorui and R. M. Rodríguez-Dagnino, “One-dimensional semi-Markov evolutions with general Erlang sojourn times,” Random Oper. Stochast. Equat., 13, 399–405 (2005).
G. A. Korn and T. M. Korn, Mathematical Handbook for Scientists and Engineers, McGraw-Hill Book Co., New York (1961).
H. Bateman and A. Erdélyi, Higher Transcendental Functions, McGraw-Hill Book Co., New York (1953–1955).
A. P. Prudnikov, Yu. A. Brychkov, and O. I. Marichev, Integrals and Series: Direct Laplace Transforms, Gordon & Breach Sci. Publ., New York (1992).
M. Kac, “A stochastic model related to the telegrapher’s equation,” Rocky Mountain J. Math., 4, 497–509 (1974).
D. R. Cox, Renewal Theory, Methuen, London (1962).
M. I. Portenko, “Diffusion processes in media with membranes,” Proc. Inst. Math. Nat. Acad. Sci. Ukraine (1995).
W. Feller, An Introduction to Probability Theory and Its Applications, 2nd Edn., Wiley (1971),
A. A. Pogorui and R. M. Rodríguez-Dagnino, “Random motion with uniformly distributed directions and random velocity,” J. Statist. Phys., 147, No. 6, 1216–1125 (2012).
D. Kolesnik, “Random motions at finite speed in higher dimensions,” J. Statist. Phys., 131, No. 6, 1039–1065 (2008).
Author information
Authors and Affiliations
Additional information
Published in Ukrains’kyi Matematychnyi Zhurnal, Vol. 67, No. 7, pp. 882–889, July, 2015.
Rights and permissions
About this article
Cite this article
Pogorui, A.A., Rodríguez-Dagnino, R.M. & Kolomiets, T. The First Passage Time and Estimation of the Number of Level-Crossings for a Telegraph Process. Ukr Math J 67, 998–1007 (2015). https://doi.org/10.1007/s11253-015-1132-y
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11253-015-1132-y