1. Motivation and problem settings
The aim of this paper is to study some examples of a continuous-time stochastic process with deterministic behaviour between random switching times, the so-called piecewise deterministic process with continuous paths.
Let
$${({{\cal F}_t})_{t \ge 0}}$$
be a filtration and let
${{\varepsilon}} = ({{\varepsilon}}(t))_{t\geq0}$
be an arbitrary measurable and adapted process defined on
$(\Omega , \mathcal F, \mathcal F_t , {{\mathrm P}})$
with values in a finite space
$\{1,\ldots, N\}$
. Let
$\phi_1,\ldots,\phi_N$
be N deterministic flows in a phase space
$(G, \mathcal G)$
, where we assume that G is a topological space and
$\mathcal G$
is the Borel
$\sigma$
-algebra. Let
$\{\tau_n\}_{n\geq1}$
be the sequence of switching times of
${{\varepsilon}}$
. The piecewise deterministic process
${{\mathbb X}}$
is defined as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU1.gif?pub-status=live)
The family of piecewise deterministic processes was introduced in [Reference Davis4], and a subclass of piecewise linear processes was first studied in [Reference Gnedenko and Kovalenko10]. This important class of random processes was then thoroughly studied in [Reference Davis5]; see [Reference Jacobsen11] for a modern presentation. Piecewise deterministic processes are intensively exploited in biology [Reference Lasota, Mackey and Tyrcha18], insurance [Reference Embrechts and Schmidli8], storage models [Reference Boxma, Kaspi, Kella and Perry3], financial market modelling [Reference Kolesnik and Ratanov16], and in many other fields.
To simplify our presentation we restrict ourselves to switchings driven by a Markov process with only two values (states). The simplest example of such a process is a piecewise linear (telegraph) process based on the two-state Markov process
${{\varepsilon}}={{\varepsilon}}(t)\in\{0, 1\}$
:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn1.gif?pub-status=live)
driven by a homogeneous Poisson process
$N=N(t)$
. The value T(t) corresponds to the position of a particle moving on the line with velocities
$-1$
and
$+1$
alternating at Poisson times. The random starting velocity
$V(0)\in\{-1, %\;
+1\}$
is independent of N.
The theory of telegraph processes is well developed, beginning from [Reference Kac12]. Over the past few decades, many generalizations of the telegraph process have been proposed in the literature including motions characterized by arbitrary numbers of possible velocities [Reference Kolesnik13], by random velocities [Reference Stadje and Zacks24, Reference De Gregorio6], with velocity changes governed by an alternating renewal process (for instance [Reference Di Crescenzo and Martinucci7] or perturbed by jumps [Reference Ratanov23, Reference López and Ratanov19]). See also the monograph [Reference Kolesnik and Ratanov16] and the references therein for full details on the telegraph process.
The classic telegraph model (1.1) can be easily generalized to the process T(t) of inhomogeneous structure with velocities
$c_0$
and
$c_1$
,
$c_0>c_1$
, alternating with intensities
${{\lambda}}_0$
and
${{\lambda}}_1$
respectively. The distribution of the random variable T(t) is given hereafter.
Let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU2.gif?pub-status=live)
be the density function of
$T(t){\mathbf{1}}_{\{N(t)=n\}}$
. Note that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU3.gif?pub-status=live)
where
$\delta_{z}({\cdot})$
denotes Dirac’s delta-measure on a line throughout the paper.
Proposition 1.1. The distribution of T(t),
$t>0$
, is described by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn2.gif?pub-status=live)
Here,
$q_i(\xi, \eta;\, n)$
,
$i\in\{0, 1\}$
,
$n\geq1$
, are separately defined for even and odd n by the equalities
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn3.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU4.gif?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn4.gif?pub-status=live)
For the proof, see, e.g., [Reference Kolesnik and Ratanov16, Proposition 4.1]. In the following, Proposition 1.1 will be generalized to the case of a piecewise linear process in an arbitrary linear normed space; see Section 2.1.
The paper is structured as follows. In Section 2 piecewise deterministic flows are studied. After recalling some elementary properties of basic deterministic flows, Section 2 is divided into two main parts: Section 2.1 regarding the distribution of the telegraph process
${{\mathbb T}}(t)$
,
$t\geq0$
, in a normed vector space, and Section 2.2 where we study the time-homogeneous process
${{\mathbb X}}$
defined as
${{\mathbb X}}(t)=\Phi^{-1}(\Phi(x)+{{\mathbb T}}(t))$
,
$t\geq0$
(with
$\Phi$
a continuous injection defined on the state space of the process
${{\mathbb X}}$
). In Section 3 we present two examples: a one-dimensional (1D) squared telegraph process and a two-dimensional process with alternating radial and circular movements. In Section 4 some observations concerning self-similarity are presented.
2. Piecewise deterministic flows
Consider the phase space
$(G, {{\mathcal G}})$
where G is a topological space with the Borel
$\sigma$
-algebra
${{\mathcal G}}$
. For any fixed
$x\in G$
consider a continuous flow on G,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU5.gif?pub-status=live)
starting at time s from position
$x\in G$
:
$\phi(t~|~
\!{\mid}\! x, s)|_{t\downarrow s}=x=\phi(t~|~
\!{\mid}\! x, s)|_{s\uparrow t}$
. Assume that for any s, t,
$s<t$
, the mapping
$x\to\phi^{ts}(x)=\phi(t~|~
\!{\mid}\! x, s)$
,
$t>s$
, is a homeomorphism.
Assume that
$\phi^{ts}$
as well as the inverse mapping (the reverse flow) form a two-parameter semigroup under composition; see, e.g., [Reference Jacobsen11].
In the following we will study piecewise deterministic flows consistently switching between two alternating patterns
$\phi_0(t~|~
\!{\mid}\!{\cdot}\,)$
and
$\phi_1(t~|~
\!{\mid}\!{\cdot}\,)$
at random times.
Let x denote the state of the process at initial time s, and let
$t>s$
. Consider two continuous functions
$\tau\to g_0(\tau)$
,
$\tau\to g_1(\tau)$
,
$\tau\in[s,\;
t]$
, which are defined by iterated superposition of these two flows:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn5.gif?pub-status=live)
These functions determine the pieces of continuous curves
$\ell_0=\ell_0(x)$
and
$\ell_1=\ell_1(x)$
on the space G,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn6.gif?pub-status=live)
For any target point
$y\in\ell_0(x)$
, the time
$\tau_0^*(y;\, x)$
when the flow is switched from
$\phi_0$
to
$\phi_1$
exists and is unique. Indeed, the equation
$g_0(\tau)=y$
has the unique solution
$\tau=\tau_0^*(y;\, x)\in[s,\;
t]$
. Similarly,
$\tau_1^*(y;\, x)\in[s,\;
t]$
,
$y\in\ell_1(x)$
, is defined as the root of the equation
$y=g_1(\tau)$
.
Further, the stochastic switching mechanism between two deterministic flows
$\phi_0$
and
$\phi_1$
is defined by a two-state random process
${{\varepsilon}}={{\varepsilon}}(t)\in\{0, 1\}$
,
$t\in({-}\infty, \infty)$
, with independent inter-switching times.
Let
$s\in({-}\infty, \infty)$
be the (fixed) starting time, and let
$\tau^s$
be the first switching time after s,
$\tau^s>s$
. Denote by
$F^s_i(t)={{\mathrm P}}_i\{\tau^s<t\}={{\mathrm P}}\{\tau^s<t~|~
\!{\mid}\!{{\varepsilon}}(s)=i\}$
the (conditional) distribution function of
$\tau^s$
under the given initial state
${{\varepsilon}}(s)=i$
,
$i\in\{0, 1\}$
. That is,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU6.gif?pub-status=live)
We study the marginal distributions of the piecewise deterministic continuous random walk
$\mathbb X=\mathbb X(t)$
on the topological space G which follows two patterns
$\phi_0$
and
$\phi_1$
alternating at switching times of
${{\varepsilon}}$
. Let
$N=N(s, t)$
count the number of switches of
${{\varepsilon}}({\cdot})$
during the time interval [s, t).
By conditioning on the first pattern’s switching, one can observe that the transition probabilities
$P_i(A, t;\,\;
n~|~
\!{\mid}\! x, s)\,{:\!=}\,{{\mathrm P}}\{\mathbb X(t)\in A,\;
N(s, t)=n~|~
\!{\mid}\!\mathbb X(s)=x,\;
{{\varepsilon}}(s)=i\}$
,
$n\geq0$
,
$i\in\{0, 1\}$
, of
${{\mathbb X}}(t),\;t>s,$
satisfy the following coupled integral Chapman–Kolmogorov equations for
$t>s$
:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn7.gif?pub-status=live)
The distribution of
${{\mathbb X}}(t)$
with no switchings till time t is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn8.gif?pub-status=live)
In the following we consider in detail the Markovian case, that is,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU7.gif?pub-status=live)
with
${{\lambda}}_0,{{\lambda}}_1>0$
.
We begin with the example of a random walk
${{\mathbb T}}(t)$
that follows a linear flow in a linear normed space.
2.1. Piecewise linear processes in a linear normed space
Let V be a linear normed vector space and
$c_0, c_1\in V$
,
$c_0\neq c_1$
. We consider the linear time-homogeneous case, where
${{\mathbb T}}={{\mathbb T}}(t)$
,
$t\geq0$
, is the piecewise linear process (the integrated telegraph process) on the space V, switching between two linear flows
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU8.gif?pub-status=live)
The current position
${{\mathbb T}}(t)$
is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn9.gif?pub-status=live)
where
$\tau_n$
,
$n\geq0$
, are the switching times,
$\tau_0=0$
,
${{\varepsilon}}_n={{\varepsilon}}(\tau_n)$
,
$n\geq0$
, and N(t) is the number of switchings occurring till time t,
$t>0$
,
$N(0)=0$
.
The distribution of
${{\mathbb T}}(t)$
,
$t>0$
, is supported on the straight segment
$I_t\subset V$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn10.gif?pub-status=live)
Indeed, for any
$z\in I_t$
, we have
${{\mathbb T}}(t)=z=\tau c_0+(t-\tau)c_1$
, where
$\tau\in[0, t]$
is the time spent by the underlying Markov process
${{\varepsilon}}(u)$
,
$0\leq u\leq t$
, in state 0.
Due to (2.3), the distribution densities
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU9.gif?pub-status=live)
follow the coupled integral equations
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn11.gif?pub-status=live)
The case of no switchings, corresponding to
${{\mathbb T}}(t){\mathbf{1}}_{N(t)=0}$
, is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn12.gif?pub-status=live)
In the particular case of linearly dependent vectors
$c_0, c_1\in V$
,
$c_0,c_1\neq0$
, the random process
${{\mathbb T}}={{\mathbb T}}(t)$
is one-dimensional and the distribution of
${{\mathbb T}}(t)$
is supported on the segment
$I_t$
of the straight line L with direction vector
$c_0$
(or
$c_1$
),
$I_t\subset L\subset V$
. Moreover, the density functions
$p_0^{{\mathbb T}}(\,{\cdot}\,, t;\,\;
n)$
and
$ p_1^{{\mathbb T}}(\,{\cdot}\,, t;\,\;
n)$
,
$n\geq1$
, coincide with functions
$f_0(\,{\cdot}\,, t;\,\;
n)$
and
$f_1(\,{\cdot}\,, t;\;
n)$
; see the formulae in (1.2) with
$\xi$
,
$0\leq\xi\leq t$
, defined by the equation
$z-tc_1=\xi(c_0-c_1)$
,
$z\in L$
.
In general, the segment
$I_t$
given in (2.6) floats in V (with constant velocity
$\frac12(c_0+c_1)$
). By solving the equations in (2.7), the density functions
$p_0^{{\mathbb T}}(z, t;\,\;
n)$
and
$ p_1^{{\mathbb T}}(z, t;\,\;
n)$
,
$n\geq1$
, can be shown to satisfy formulae similar to (1.2) with
$\xi\in[0, t]$
, which is defined as the (unique) solution
$\xi=\varphi(z, t)$
of the equation
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn13.gif?pub-status=live)
Proposition 2.1. The density functions
$p_0^{{\mathbb T}}(z, t;\,\;
n)$
and
$ p_1^{{\mathbb T}}(z, t;\,\;
n)$
,
$n\geq1$
, are given by
$p_i^{{\mathbb T}}(z, t;\, \;
n)=q_i(\xi, t-\xi;\,\;
n)\theta(\xi, t-\xi)$
, where
$q_i(\xi, \eta;\, \;
n)$
are defined by (1.3), and the function
$\theta$
is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn14.gif?pub-status=live)
Here,
$\xi=\varphi(z, t)\in[0, t]$
,
$z\in I_t$
is the solution of (2.9) and
$\eta=t-\xi$
.
See the proof in Appendix B.
2.2. Time-homogeneous piecewise deterministic process
${{\mathbb X}}$
Consider the time-homogeneous case, so that the deterministic pattern
$\phi(t~|~
\!{\mid}\! x, s)$
depends on s, t through
$t-s$
only. Assume that the flow
$\phi$
is defined by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn15.gif?pub-status=live)
where
$\Phi\,{:}\, G\to V$
is a continuous injective map from G to a topological vector space V and
$c\in V$
is a constant. The reverse flow is defined by
$s\to\Phi^{-1}(\Phi(y)-c(t-s))$
,
$s\leq t$
.
In the following we will use the shortened notation
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU10.gif?pub-status=live)
Remark 2.1. Let
$G={{\mathbb R}}^d$
,
$V={{\mathbb R}}^d$
, and
$\Phi\,{:}\, {{\mathbb R}}^d\to{{\mathbb R}}^d$
be a diffeomorphism. Therefore, the trajectory of
$\phi$
defined by (2.11) is differentiable,
$\Phi(\phi(t;\, x))=\Phi(x)+ct$
, and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU11.gif?pub-status=live)
This means that
$\phi$
follows the differential equation
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn16.gif?pub-status=live)
with the initial condition
$ \phi(t;\, x)|_{t\downarrow 0}=x$
, where
$a(y)=[\Phi'(y)]^{-1}c$
.
The mapping
$\Phi$
acts as a rectifying diffeomorphism for equation (2.12); see [Reference Arnold1].
In the case when the time-homogeneous flows
$\phi_0$
and
$\phi_1$
are defined by (2.11) with
$c_0, c_1\,{\in}\, V$
,
$c_0\neq c_1$
, and are characterized by a common rectifying mapping
$\Phi\,{:}\,G\to V$
, that is,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU12.gif?pub-status=live)
the mappings
$g_0$
and
$g_1$
defined by (2.1) become
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU13.gif?pub-status=live)
Hence, the curves
$\ell_0$
and
$\ell_1$
defined in (2.2) identify
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU14.gif?pub-status=live)
where
$I_{t}$
is the straight segment (2.6).
Let the time-homogeneous flows
$\phi_0=\phi_0(t;\, x)$
and
$\phi_1=\phi_1(t;\, x)$
,
$0\leq t<\infty$
, be defined by (2.11) with a common diffeomorphism
$\Phi\,{:}\, G\to V$
from the open subset G of a linear normed space into a linear normed space V, and with constant ‘velocities’
$c_0, c_1\in V$
,
$c_0\neq c_1$
. Therefore, the corresponding piecewise deterministic time-homogeneous continuous process
${{\mathbb X}}^x={{\mathbb X}}^x(t)\in G$
starting from point x is defined by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn17.gif?pub-status=live)
Here,
${{\mathbb T}}={{\mathbb T}}(t)$
,
$t\geq0$
, is the telegraph process defined by (2.5) with the two velocities
$c_0, c_1\in V$
alternating with switching intensities
${{\lambda}}_0, {{\lambda}}_1>0$
.
For any fixed
$t>0$
, the distribution of
${{\mathbb T}}(t)$
is supported on the straight segment
$I_t\subset V$
; see Proposition 2.1. Hence, the distribution of
$\mathbb X^x(t)$
is supported on the segment of the continuous curve
$\ell=\ell_{t,x}$
,
$\ell\subset G$
,
$\ell=\Phi^{-1}(\Phi(x)+I_{t })$
; see Figure 1.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_fig1g.jpeg?pub-status=live)
Figure 1.
Flows
$\phi_0(\,{\cdot}\,;\,\;
x)$
and
$\phi_1(\,{\cdot}\,;\,\;
x)$
with common mapping
$\Phi\,:\, G\to V$
; a sample path of
${{\mathbb X}}^x(t)$
.
Let
$p_0^{{\mathbb X}}(y, t;\, n~|~
\!{\mid}\! x)$
and
$p_1^{{\mathbb X}}(y, t;\, n~|~
\!{\mid}\! x)$
be the transition densities of
${{\mathbb X}}(t)$
,
$t>s$
:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU15.gif?pub-status=live)
In the case of no switchings,
$n=0$
, by (2.4) we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU16.gif?pub-status=live)
Theorem 2.1. The transition densities
$p_i^{{\mathbb X}}(y, t;\, n~|~
\!{\mid}\! x)$
,
$n\geq1$
, for each positive t are given by Proposition 2.1 with
$\xi=\varphi(\Phi(y)-\Phi(x),\;
t)$
, see (2.9), and with
$\theta$
given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU17.gif?pub-status=live)
where
$k(y)=\dfrac{\|\Phi'(y)\|}{\|c_0-c_1\|}{\mathbf{1}}_{\{y\in\ell\}}$
.
Further,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn18.gif?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn19.gif?pub-status=live)
Proof. By (2.13),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU18.gif?pub-status=live)
The proof follows from the result of Proposition 2.1. Summing over n one can obtain (2.14).
The next section is related to other examples.
3. Examples
3.1. Squared telegraph process
First, we present the important example of the squared telegraph process,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU19.gif?pub-status=live)
${{\mathbb X}}^x(0)=x$
, where the underlying telegraph process
$T=T(t)$
is determined by velocities
$c_0, c_1$
,
$c_0>c_1$
, and switching intensities
${{\lambda}}_0, {{\lambda}}_1$
(see (1.1)). Such a process can be obtained by (2.13), with
$\Phi(x)=\sqrt{x}$
,
$x\geq0$
.
Although
$x\to\Phi^{-1}(x)=x^2$
,
$x\in({-}\infty, \infty)$
, is not a diffeomorphism, Theorem 2.1 can be applied.
The density functions
$p_i(\,{\cdot}\,, t;\, n~|~
\!{\mid}\! x)$
,
$n\geq1$
, of
${{\mathbb X}}^x(t)$
can be expressed using
$f_0(x, t;\, n)$
and
$f_1(x, t;\, n)$
defined in (1.2)–(1.4). The explicit expressions for
$p_i(\,{\cdot}\,, t;\, n~|~
\!{\mid}\! x)$
,
$n\geq1$
, are different for the following four cases, defined by the four possible relationships between the parameters and the time value t,
$t>0$
.
(A)
${0\leq\sqrt{x}+c_1t<\sqrt{x}+c_0t}$
:
The distribution of
${{\mathbb X}}^x(t)$
is supported on the segment
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU20.gif?pub-status=live)
the equation
$(\sqrt{x}+z)^2=y$
,
$y\in\Delta_{\rm A}$
, has the unique solution
$z=\sqrt{y}-\sqrt{x}$
, and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn20.gif?pub-status=live)
(B)
${\sqrt{x}+c_1t<0<-\sqrt{x}-c_1t\leq\sqrt{x}+c_0t}$
:
The distribution of
${{\mathbb X}}^x(t)$
is supported on
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU21.gif?pub-status=live)
For all y,
$0<y\leq(\sqrt{x}+c_1t)^2$
, the equation
$(\sqrt{x}+z)^2=y$
has two roots
$z=\pm\sqrt{y}-\sqrt{x}$
; if
$(\sqrt{x}+c_1t)^2<y\leq(\sqrt{x}+c_0t)^2$
this equation has the unique solution
$z=\sqrt{y}-\sqrt{x}$
between
$c_1t$
and
$c_0t$
. Hence, for
$n\geq1$
,
$i\in\{0, 1\}$
, the density function
$p_i(y, t;\, n~|~
\!{\mid}\! x)$
is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn21.gif?pub-status=live)
(C)
${\sqrt{x}+c_1t\leq-\sqrt{x}-c_0t<0<\sqrt{x}+c_0t}$
:
The distribution of
${{\mathbb X}}^x(t)$
is supported on
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU22.gif?pub-status=live)
For all y,
$0<y\leq(\sqrt{x}+c_0t)^2$
, the equation
$(\sqrt{x}+z)^2=y$
has two roots
$z=\pm\sqrt{y}-\sqrt{x}$
; if
$(\sqrt{x}+c_0t)^2<y\leq(\sqrt{x}+c_1t)^2$
, this equation has the unique solution
$z=-\sqrt{y}-\sqrt{x}$
between
$c_1t$
and
$c_0t$
. Hence, for
$n\geq1$
,
$i\in\{0, 1\}$
, the density function
$p_i(y, t;\, n~|~
\!{\mid}\! x)$
is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn22.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU23.gif?pub-status=live)
(D)
${\sqrt{x}+c_1t<\sqrt{x}+c_0t\leq0}$
:
The distribution of
${{\mathbb X}}^x(t)$
is supported on the segment
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU24.gif?pub-status=live)
the equation
$(\sqrt{x}+z)^2=y$
,
$y\in\Delta_{\rm D}$
, has the unique root
$z=-\sqrt{y}-\sqrt{x}$
. Thus
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn23.gif?pub-status=live)
As a result, the distribution of
${{\mathbb X}}(t)$
depends on the signs of velocities.
First, if both velocities are positive,
$c_0>c_1\geq0$
, then T(t) is a subordinator and the distribution of
${{\mathbb X}}^x(t)=(\sqrt{x}+T(t))^2$
fits case (A).
Second, let
$c_0\geq0>c_1$
. For sufficiently small times,
$0<t\leq \sqrt{x}/({-}\,c_1)$
, the value
$\sqrt{x}+T(t)$
remains positive. Hence the density functions
$p_i(y, t;\, n~|~
\!{\mid}\! x)$
,
$i\in\{0, 1\}$
, are again given by (3.1) (case (A)).
For large t the solution depends on the relation between
$c_0$
and
$|c_1|$
.
If
$c_0+c_1<0$
and
$\sqrt{x}/({-}\,c_1)<t\leq2\sqrt{x}/({-}\,c_0-c_1)$
or
$c_0+c_1\geq0$
and
$t>\sqrt{x}/({-}\,c_1)$
, then
$\sqrt{x}+c_1t<0<-\sqrt{x}-c_1t<\sqrt{x}+c_0t$
, which corresponds to case (B). Hence, the formula (3.2) holds.
If
$c_0+c_1<0$
and
$t\geq2\sqrt{x}/({-}\,c_0-c_1),$
then
$\sqrt{x}+c_1t<-\sqrt{x}-c_0t<0<\sqrt{x}+c_0t$
, which is case (C), and (3.3) holds.
Third, let both velocities be negative,
$0>c_0>c_1$
. The distribution of
${{\mathbb X}}^x(t)$
is given separately for the different time intervals:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU25.gif?pub-status=live)
If
$t=2\sqrt{x}/({-}\,c_0-c_1)$
(with
$c_0+c_1<0$
), case (B) coincides with case (C) and
$p_i(y, t;\, n~|~
\!{\mid}\! x)=\dfrac{1}{2\sqrt{y}}
[ f_i({-}\,\sqrt{y}-\sqrt{x}, t;\, n)+f_i(\sqrt{y}-\sqrt{x}, t;\, n)]$
,
$0<y<(\sqrt{x}+c_1t)^2$
.
A slightly different approach is given in [Reference Martinucci and Meoli20].
3.2. Process in the plane and polar coordinates
The piecewise deterministic process in the plane has been studied in the past in various contexts [Reference Garra, Orsingher and Ratanov9, Reference Kolesnik14, Reference Kolesnik and Orsingher15, Reference Orsingher21, Reference Orsingher and Ratanov22]. Here we present an example of planar motion in the spirit of our construction (2.13).
Let
$\Phi({{x}})=(r({{x}}),\;
\alpha({{x}}))$
,
${{x}}=(x_1, x_2)\in{{\mathbb R}}^2$
,
${{x}}\neq{{\mathbf 0}}$
, be the operator setting the polar coordinates
$r({{x}})=|{{x}}|=\sqrt{x_1^2+x_2^2}>0$
and
$\alpha({{x}})\in S^1$
for any
${{x}}=(x_1, x_2)\in{{\mathbb R}}^2$
,
${{x}}\neq{{\mathbf 0}}$
. The mapping
$\Phi$
is the (local) diffeomorphism from
${{\mathbb R}}^2\setminus\{{{\mathbf 0}}\}$
to the semi-cylinder
$(0,\;
+\infty)\times S^1$
.
Let
$\mathcal J\,{:}\, {{\mathbb C}}\to{{\mathbb R}}^2$
be defined by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU26.gif?pub-status=live)
Consider the two basic deterministic flows
$\phi_0(t;\, {{x}})$
and
$\phi_1(t;\, {{x}})$
defined by (2.13) with
${{c}}={{c}}_0=(c_0, 0)^\top$
and
${{c}}={{c}}_1=(0, c_1)^\top$
respectively. Here,
$c_0>0$
is the velocity of a radial flight and
$c_1>0$
is the constant angular velocity.
The flow
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU27.gif?pub-status=live)
is the radial movement starting from point
${{x}}\in {{\mathbb R}}^2$
,
${{x}}\neq{{\mathbf 0}}$
, and the flow
$\phi_1(t;\, {{x}})$
is the circular motion defined by rotation of
${{x}}$
:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU28.gif?pub-status=live)
The process
${{\mathbb X}}^{{x}}$
is defined by the radial-circular motion, switching from radial to circular motion with intensity
${{\lambda}}_0$
and vice versa with intensity
${{\lambda}}_1$
.
The distribution of
${{\mathbb X}}^{{x}}(t)$
is supported on the segment
$\ell=\ell(t, {{x}})$
of the Archimedean spiral,
${{y}}\in\ell(t, {{x}})$
(Figure 2),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn24.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_fig2g.jpeg?pub-status=live)
Figure 2.
The support of the distribution of
${{\mathbb X}}(t)$
: the Archimedean spiral
$\ell({{x}}, t)$
defined by (3.5) with
${{x}}=(10, 0)$
,
$c_0=2$
,
$c_1=3$
, and time
$t=10$
.
Let
$\xi=\xi({{x}}, {{y}})=\dfrac{|{{y}}|-|{{x}}|}{c_0}$
,
${{y}}\in\ell(t, {{x}})$
, be the total time of radial motion,
$0\leq\xi\leq t$
, such that the remaining time,
$t-\xi$
, is the total time of circular motion.
From Theorem 2.1, the density functions
$p_i({{y}}, t;\, n~|~
\!{\mid}\!{{x}})$
of
${{\mathbb X}}^{{x}}(t)$
are given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn25.gif?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU29.gif?pub-status=live)
and
$q_i(\xi, \eta;\, n)$
are defined by (1.3). If there are no switchings, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU30.gif?pub-status=live)
Here,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU31.gif?pub-status=live)
is the radial displacement and
$\widehat \omega_\alpha({{x}})$
denotes the rotation of
${{x}}$
.
The density functions
$p_i({{y}}, t~|~
\!{\mid}\!{{x}})$
,
$i\in\{0, 1\}$
,
${{y}}\in\ell({{x}}, t)$
, can be obtained by summing up in (3.6) similarly to (2.14) and (2.15); see Figure 3.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_fig3g.jpeg?pub-status=live)
Figure 3.
The regular part of the density function
$p_0(\,{\cdot}\,, 10 ~|~
\!{\mid}\!{{x}})$
with
$c_0=c_1=1$
,
${{\lambda}}_0={{\lambda}}_1=2$
, and the initial point
${{x}}=(1, 1)$
.
4. Self-similarity
The process
${{\mathbb X}}^x={{\mathbb X}}^x(t)\in {{\mathbb R}}_+^1$
is called positive self-similar if there exists a constant
$\gamma > 0$
such that, for any
$x > 0$
and
$R > 0$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn26.gif?pub-status=live)
see the definition in [Reference Kyprianou17, Chapter 13].
The following theorem characterizes piecewise deterministic positive (1D) self-similar processes.
Theorem 4.1. Let
${{\mathbb X}}^x={{\mathbb X}}^x(t)\in{{\mathbb R}}^1_+$
,
$x>0$
, be the positive piecewise deterministic time-homogeneous process with two alternating patterns
$\phi_0$
,
$\phi_1$
based on a common rectifying diffeomorphism
$\Phi$
, (2.13), such that
$\phi_0=\Phi^{-1}(\Phi(x)+c_0t)$
and
$\phi_1=\Phi^{-1}(\Phi(x)+c_1t)$
with
$c_0, c_1>0$
.
The process
${{\mathbb X}}^x$
is positive self-similar with index
$\gamma>0$
if and only if the underlying patterns are given by
$\Phi(x)=x^{\gamma}$
,
$x\in{{\mathbb R}}^1_+$
.
Proof. Let
${{\mathbb X}}^x$
be the piecewise deterministic time-homogeneous process based on the two patterns
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn27.gif?pub-status=live)
with
$c_0, c_1>0$
.
Note that the flows
$\phi_i(t;\, x)$
,
$i\in\{0,1\}$
, defined by (4.2) satisfy the scaling relation
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn28.gif?pub-status=live)
Moreover, under the time scaling
$t\to R^{-\gamma}t$
the switching intensities are transformed as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn29.gif?pub-status=live)
Therefore, the piecewise deterministic process
$\mathbb X^x(t)$
,
$t\geq 0$
, which follows the patterns (4.2), switching from one to another with alternating intensities
${{\lambda}}_0$
,
${{\lambda}}_1$
, is the positive self-similar continuous process with index
$\gamma$
, (4.1).
Note that this can also be verified by using explicit formulae for the distribution. Let
$\Phi(x)=x^\gamma$
,
$x>0$
. Under the space–time scaling
$x\to R^{-1}x$
,
$t\to R^{-\gamma}t$
the variable
$\xi=\varphi(\Phi(y)-\Phi(x),t)$
, (2.9), used in Theorem 2.1, is transformed as
$\xi\to R^{-\gamma}\xi$
. Hence, by Theorem 2.1 and Equations (4.4) and (4.3), the transition densities
$p_i^{{\mathbb X}}(\,{\cdot}\,, t;\, n~|~
\!{\mid}\! x)$
satisfy the relation
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU32.gif?pub-status=live)
The same is fulfilled for
$p_i^{{\mathbb X}}(y, t~|~
\!{\mid}\! x)$
:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU33.gif?pub-status=live)
$i\in\{0, 1\}$
, which corresponds to (4.1).
To prove the inverse assertion note that by definition (4.1) (with
$x\downarrow0$
) one can see that the underlying patterns satisfy
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU34.gif?pub-status=live)
where
$c_i=\phi_i(1;\, 0)^\gamma>0$
.
Due to the semi-group property
$\phi_i(t-s;\, \phi_i(0;\,s))=\phi_i(t;\, 0)$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU35.gif?pub-status=live)
Hence,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU36.gif?pub-status=live)
Therefore (under the shift
$t\to t+x^\gamma/c_i$
) we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU37.gif?pub-status=live)
Remark 4.1. If the ‘velocities’
$c_0, c_1$
are positive, the process
${{\mathbb X}}^x$
is a subordinator (defined for all
$t\geq0$
).
In the case of a negative velocity the process
${{\mathbb X}}^x$
is defined until hitting zero at time
$\zeta^x=\inf\{t>0~|~
\!{\mid}\! X^x(t)=0\}=\inf\{t>0~|~
\!{\mid}\! T(t)=-x^\gamma\}$
. The distribution of
$\zeta^x$
is known explicitly; see, e.g., [Reference Bogachev and Ratanov2].
Remark 4.2. Consider the time-homogeneous process
${{\mathbb X}}^x$
determined by the alternating patterns
$\phi_0$
,
$\phi_1$
with common diffeomorphism
$\Phi(x)={{\rm e}}^x$
,
$x\in{{\mathbb R}}^{1}$
:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU38.gif?pub-status=live)
If
$c_0, c_1\geq0$
, the process
${{\mathbb X}}^x(t)$
is defined for all
$t\geq0$
. In the case of negative
$c_i$
the process is killed and sent to the cemetery state
$-\infty$
at time
$t_*=\inf\{t>0~|~
\!{\mid}\!{{\mathbb T}}(t)=-{{\rm e}}^x\}$
, where
${{\mathbb T}}(t)$
is the respective telegraph process.
The process
${{\mathbb X}}^x(t)$
possesses the property of additive self-similarity: under time scaling the process takes a spatial shift,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU39.gif?pub-status=live)
Indeed, under transformations
$t\to {{\rm e}}^{-R}t$
and
$x\to x-R$
the switching intensities are transformed as
${{\lambda}}_0\to{{\rm e}}^{R}{{\lambda}}_0$
,
${{\lambda}}_1\to{{\rm e}}^{R}{{\lambda}}_1$
, and
$\xi\to{{\rm e}}^{-R}\xi$
. By Theorem 2.1, the distributions of
${{\mathbb X}}^{x-R}({{\rm e}}^{-R}t)$
and
${{\mathbb X}}^x(t)-R$
coincide.
Appendix A. The auxiliary result
Lemma A.1. Let
$z\in I_t$
be fixed, and
$\xi=\varphi(z, t)$
,
$0\leq\xi\leq t$
, be the (unique) solution of the equation
$z-tc_1=\xi(c_0-c_1)$
, (2.9). Then
$z-c_0\tau\in I_{t-\tau}$
and
$z-c_1\tau\in
I_{t-\tau}$
for sufficiently small
$\tau$
,
$\tau>0$
.
Further, for all
$z\in I_t$
the solution
$\xi=\varphi(z, t)$
of (2.9) satisfies the following identities:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn30.gif?pub-status=live)
Proof. By substitution of
$z-c_0\tau$
and
$z-c_1\tau$
with z and
$t-\tau$
with t into (2.9) one can obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn31.gif?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn32.gif?pub-status=live)
Equation (A.2) is satisfied by
$\widetilde\xi=\xi-\tau$
if
$\tau\leq\xi$
, and (A.3) is satisfied by
$\widetilde\xi=\xi$
if
$\tau\leq t-\xi$
.
Further, note that, by definition,
$z-c_0\tau\notin I_{t-\tau}$
if
$\tau>\xi$
and
$z-c_1\tau\notin I_{t-\tau}$
if
$\tau>t-\xi$
. Hence, the lemma is proved.
Appendix B. Proof of Proposition 2.1
System (2.7),
$n=1$
, and (2.8) give the density functions
$p_0^{{\mathbb T}}(z, t;\,\;
1)$
and
$p_1^{{\mathbb T}}(z, t;\,\;
1)$
. Indeed,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU40.gif?pub-status=live)
where
$\xi=\varphi(z, t)$
,
$\xi\in(0, t)$
, is the solution of (2.9). Similarly,
$p_1^{{\mathbb T}}(z, t;\,\;
1)={{\lambda}}_1\theta(\xi, t-\xi)$
. This corresponds to (1.2),
$n=1$
, with
$q_i(\xi, \eta;\, 1)$
defined by (1.3) (
$k=0$
) and
$\theta$
defined by (2.10).
By recalling Lemma A.1 in Appendix A and (2.10),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqn33.gif?pub-status=live)
Moreover, by applying (A.1) and (B.1) one can obtain the following identities, which are sufficient to finish the proof:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU41.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191211054124816-0805:S0021900219000585:S0021900219000585_eqnU42.gif?pub-status=live)
$\xi=\varphi(z, t)$
; cf. [Reference Kolesnik and Ratanov16, Chapter 4].
Acknowledgements
We express our thanks to the referees for useful comments that helped to improve the paper. A.D.C. and B.M. are members of the research group GNCS of INdAM.