On random motions with velocities alternating at Erlang-distributed random times

2001 ◽  
Vol 33 (03) ◽  
pp. 690-701 ◽  
Author(s):  
Antonio Di Crescenzo

We analyse a non-Markovian generalization of the telegrapher's random process. It consists of a stochastic process describing a motion on the real line characterized by two alternating velocities with opposite directions, where the random times separating consecutive reversals of direction perform an alternating renewal process. In the case of Erlang-distributed interrenewal times, explicit expressions of the transition densities are obtained in terms of a suitable two-index pseudo-Bessel function. Some results on the distribution of the maximum of the process are also disclosed.

2001 ◽  
Vol 33 (3) ◽  
pp. 690-701 ◽  
Author(s):  
Antonio Di Crescenzo

We analyse a non-Markovian generalization of the telegrapher's random process. It consists of a stochastic process describing a motion on the real line characterized by two alternating velocities with opposite directions, where the random times separating consecutive reversals of direction perform an alternating renewal process. In the case of Erlang-distributed interrenewal times, explicit expressions of the transition densities are obtained in terms of a suitable two-index pseudo-Bessel function. Some results on the distribution of the maximum of the process are also disclosed.


2007 ◽  
Vol 2007 ◽  
pp. 1-5 ◽  
Author(s):  
Chunsheng Ma

This paper is concerned with a class of stochastic processes or random fields with second-order increments, whose variograms have a particular form, among which stochastic processes having orthogonal increments on the real line form an important subclass. A natural issue, how big this subclass is, has not been explicitly addressed in the literature. As a solution, this paper characterizes a stochastic process having orthogonal increments on the real line in terms of its variogram or its construction. Our findings are a little bit surprising: this subclass is big in terms of the variogram, and on the other hand, it is relatively “small” according to a simple construction. In particular, every such process with Gaussian increments can be simply constructed from Brownian motion. Using the characterizations we obtain a series expansion of the stochastic process with orthogonal increments.


1988 ◽  
Vol 20 (2) ◽  
pp. 473-475 ◽  
Author(s):  
Panagiotis Konstantopoulos ◽  
Jean Walrand

We consider a stochastic process in continuous time and two point processes on the real line, all jointly stationary. We show that under a certain mixing condition the values of the process at the points of the second point process converge weakly under the Palm distribution with respect to the first point process, and we identify the limit. This result is a supplement to two other known results which are mentioned below.


2016 ◽  
Author(s):  
Daniel J Greenhoe

A traditional random variable X is a function that maps from a stochastic process to the real line (X,<=,d,+,.), where R is the set of real numbers, <= is the standard linear order relation on R, d(x,y)=|x-y| is the usual metric on R, and (R, +, .) is the standard field on R. Greenhoe(2015b) has demonstrated that this definition of random variable is often a poor choice for computing statistics when the stochastic process that X maps from has structure that is dissimilar to that of the real line. Greenhoe(2015b) has further proposed an alternative statistical system, that rather than mapping a stochastic process to the real line, instead maps to a weighted graph that has order and metric geometry structures similar to that of the underlying stochastic process. In particular, ideally the structure X maps from and the structure X maps to are, with respect to each other, both isomorphic and isometric.Mapping to a weighted graph is useful for analysis of a single random variable.for example the expectation EX of X can be defined simply as the center of its weighted graph. However, the mapping has limitations with regards to a sequence of random variables in performing sequence analysis (using for example Fourier analysis or wavelet analysis), in performing sequence processing (using for example FIR filtering or IIR filtering), in making diagnostic measurements (using a post-transform metric space), or in making goptimalh decisions (based on gdistanceh measurements in a metric space or more generally a distance space). Rather than mapping to a weighted graph, this paper proposes instead mapping to an ordered distance linear space Y=(R^n,<=,d,+,.,R,+,x), where (R,+,x) is a field, + is the vector addition operator on R^n x R^n, and . is the scalar-vector multiplication operator on R x R^n. The linear space component of Y provides a much more convenient (as compared to the weighted graph) framework for sequence analysis and processing. The ordered set and distance space components of Y allow one to preserve the order structure and distance geometry inherent in the underlying stochastic process, which in turn likely provides a less distorted (as compared to the real line) framework for analysis, diagnostics, and optimal decision making.


2015 ◽  
Author(s):  
Daniel J Greenhoe

A traditional random variable X is a function that maps from a stochastic process to the real line. Here, "real line" refers to the structure (R,<=,|x-y|), where R is the set of real numbers, <= is the standard linear order relation on R, and d(x,y)=|x-y| is the usual metric on R. The traditional expectation value E(X) of X is then often a poor choice of a statistic when the stochastic process that X maps from is a structure other than the real line or some substructure of the real line. If the stochastic process is a structure that is not linearly ordered (including structures totally unordered) and/or has a metric space geometry very different from that induced by the usual metric, then statistics such as E(X) are often of poor quality with regards to qualitative intuition and quantitative variance (expected error) measurements. For example, the traditional expected value of a fair die is E(X)=(1/6)(1+2+...+6)=3.5. But this result has no relationship with reality or with intuition because the result implies that we expect the value of [ooo] (die face value "3") or [oooo] (dice face value "4") more than we expect the outcome of say [o] or [oo]. The fact is, that for a fair die, we would expect any pair of values equally. The reason for this is that the values of the face of a fair die are merely symbols with no order, and with no metric geometry other than the discrete metric geometry. On a fair die, [oo] is not greater or less than [o]; rather [oo] and [o] are simply symbols without order. Moreover, [o] is not "closer" to [oo] than it is to [ooo]; rather, [o], [oo], and [ooo] are simply symbols without any inherit order or metric geometry. This paper proposes an alternative statistical system, based somewhat on graph theory, that takes into account the order structure and metric geometry of the underlying stochastic process.


1988 ◽  
Vol 20 (02) ◽  
pp. 473-475
Author(s):  
Panagiotis Konstantopoulos ◽  
Jean Walrand

We consider a stochastic process in continuous time and two point processes on the real line, all jointly stationary. We show that under a certain mixing condition the values of the process at the points of the second point process converge weakly under the Palm distribution with respect to the first point process, and we identify the limit. This result is a supplement to two other known results which are mentioned below.


2013 ◽  
Vol 50 (02) ◽  
pp. 450-463 ◽  
Author(s):  
Antonio Di Crescenzo ◽  
Antonella Iuliano ◽  
Barbara Martinucci ◽  
Shelemyahu Zacks

We consider a generalized telegraph process which follows an alternating renewal process and is subject to random jumps. More specifically, consider a particle at the origin of the real line at timet=0. Then it goes along two alternating velocities with opposite directions, and performs a random jump toward the alternating direction at each velocity reversal. We develop the distribution of the location of the particle at an arbitrary fixed timet, and study this distribution under the assumption of exponentially distributed alternating random times. The cases of jumps having exponential distributions with constant rates and with linearly increasing rates are treated in detail.


2010 ◽  
Vol 47 (01) ◽  
pp. 84-96 ◽  
Author(s):  
Antonio Di Crescenzo ◽  
Barbara Martinucci

We introduce a stochastic process that describes a finite-velocity damped motion on the real line. Differently from the telegraph process, the random times between consecutive velocity changes have exponential distribution with linearly increasing parameters. We obtain the probability law of the motion, which admits a logistic stationary limit in a special case. Various results on the distributions of the maximum of the process and of the first passage time through a constant boundary are also given.


2016 ◽  
Author(s):  
Daniel J Greenhoe

A traditional random variable X is a function that maps from a stochastic process to the real line (X,<=,d,+,.), where R is the set of real numbers, <= is the standard linear order relation on R, d(x,y)=|x-y| is the usual metric on R, and (R, +, .) is the standard field on R. Greenhoe(2015b) has demonstrated that this definition of random variable is often a poor choice for computing statistics when the stochastic process that X maps from has structure that is dissimilar to that of the real line. Greenhoe(2015b) has further proposed an alternative statistical system, that rather than mapping a stochastic process to the real line, instead maps to a weighted graph that has order and metric geometry structures similar to that of the underlying stochastic process. In particular, ideally the structure X maps from and the structure X maps to are, with respect to each other, both isomorphic and isometric.Mapping to a weighted graph is useful for analysis of a single random variable.for example the expectation EX of X can be defined simply as the center of its weighted graph. However, the mapping has limitations with regards to a sequence of random variables in performing sequence analysis (using for example Fourier analysis or wavelet analysis), in performing sequence processing (using for example FIR filtering or IIR filtering), in making diagnostic measurements (using a post-transform metric space), or in making goptimalh decisions (based on gdistanceh measurements in a metric space or more generally a distance space). Rather than mapping to a weighted graph, this paper proposes instead mapping to an ordered distance linear space Y=(R^n,<=,d,+,.,R,+,x), where (R,+,x) is a field, + is the vector addition operator on R^n x R^n, and . is the scalar-vector multiplication operator on R x R^n. The linear space component of Y provides a much more convenient (as compared to the weighted graph) framework for sequence analysis and processing. The ordered set and distance space components of Y allow one to preserve the order structure and distance geometry inherent in the underlying stochastic process, which in turn likely provides a less distorted (as compared to the real line) framework for analysis, diagnostics, and optimal decision making.


2015 ◽  
Author(s):  
Daniel J Greenhoe

A traditional random variable X is a function that maps from a stochastic process to the real line. Here, "real line" refers to the structure (R,<=,|x-y|), where R is the set of real numbers, <= is the standard linear order relation on R, and d(x,y)=|x-y| is the usual metric on R. The traditional expectation value E(X) of X is then often a poor choice of a statistic when the stochastic process that X maps from is a structure other than the real line or some substructure of the real line. If the stochastic process is a structure that is not linearly ordered (including structures totally unordered) and/or has a metric space geometry very different from that induced by the usual metric, then statistics such as E(X) are often of poor quality with regards to qualitative intuition and quantitative variance (expected error) measurements. For example, the traditional expected value of a fair die is E(X)=(1/6)(1+2+...+6)=3.5. But this result has no relationship with reality or with intuition because the result implies that we expect the value of [ooo] (die face value "3") or [oooo] (dice face value "4") more than we expect the outcome of say [o] or [oo]. The fact is, that for a fair die, we would expect any pair of values equally. The reason for this is that the values of the face of a fair die are merely symbols with no order, and with no metric geometry other than the discrete metric geometry. On a fair die, [oo] is not greater or less than [o]; rather [oo] and [o] are simply symbols without order. Moreover, [o] is not "closer" to [oo] than it is to [ooo]; rather, [o], [oo], and [ooo] are simply symbols without any inherit order or metric geometry. This paper proposes an alternative statistical system, based somewhat on graph theory, that takes into account the order structure and metric geometry of the underlying stochastic process.


Sign in / Sign up

Export Citation Format

Share Document