<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Stochasticity in the Form of a Conditional Cyclic Random Process</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Serhii Lupenko</string-name>
          <email>lupenko.san@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Iaroslav Lytvynenko</string-name>
          <email>iaroslav.lytvynenko@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Nataliia Stadnyk</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andriy Zozulia</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Chokolivskiy bulv.</institution>
          ,
          <addr-line>ap.13, Kyiv, 03186</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Institute of Telecommunications and the Global Information Space of the National Academy of Sciences of Ukraine</institution>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Ternopil Ivan Puluj National Technical University</institution>
          ,
          <addr-line>56, Ruska Street, Ternopil, 46001</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The work is devoted to the development of mathematical modeling of digital cyclic signals with double stochasticity, namely, the construction of their mathematical model in the form of a conditional cyclic random process of discrete argument. This model allows to take into account stochasticity of digital cyclic signals both in their morphological statistical analysis and in statistical analysis of their rhythm. Approaches to morphological and rhythm analysis of cyclic signals based on their model are proposed. Cyclic signal, conditional cyclic random process, morphological analysis, rhythm analysis.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Cyclic processes and phenomena are widespread in various spheres of reality, in particular, they
take place in economics, biology, medicine, technology. The study of cyclical processes involving
modern information systems requires the preliminary development of adequate mathematical models
for them. Many different mathematical models of cyclic processes are known today, including
harmonic, periodic
and
almost periodic
deterministic functions, periodically
correlated
and
periodically distributed random processes, linear periodic random process, almost periodically
correlated random process, cyclic random process [
        <xref ref-type="bibr" rid="ref1 ref10 ref11 ref2 ref3 ref4 ref5 ref6 ref7 ref8 ref9">1-11</xref>
        ].
      </p>
      <p>All these models of cyclic signals do not allow for simultaneous consideration of double
stochasticity in their structure, namely, stochasticity in the morphological structure of the signal and
stochasticity in the rhythmic structure of the signal. Examples of cyclic processes and signals with
double stochasticity are cardiac signals of electrical, magnetic and mechanical nature, economic
cyclic processes, the processes of the appearance of spots in the Sun, the processes of cracking of the
nano coating on the surface of materials.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related works</title>
      <p>
        In [
        <xref ref-type="bibr" rid="ref12 ref13">12, 13</xref>
        ], the development of a mathematical model of a cyclic signal, which has the means of
considering double stochasticity in its structure, namely, stochasticity in the morphological structure
of the signal and stochasticity in the rhythmic structure of the signal, was begun. This model is called
a conditional cyclic random process. Conditional cyclic random process takes into account the
      </p>
      <p>2020 Copyright for this paper by its authors.
cyclicality, stochasticity of the morphological and rhythmic structures of the investigated processes
(signals).</p>
    </sec>
    <sec id="sec-3">
      <title>3. Overview of the research</title>
      <p>
        Despite the results obtained in [
        <xref ref-type="bibr" rid="ref12 ref13">12, 13</xref>
        ], a number of problems remain to be solved, in particular, it
is necessary to clarify the definition of the class of conditional cyclic random processes and the
definition of the random function of the rhythm of the conditional cyclic random process, as well as
clarify the essence of the approach to statistical analysis and analysis the rhythm of cyclic signals
within their mathematical model in the form of a conditional cyclic random process. It should also be
noted that there is no definition of a conditional cyclic random process of discrete argument, which
makes it impossible to develop adequate statistical methods for analyzing digital signals.
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. Proposed model</title>
      <p>In this paper, we develop (detail) the procedure for constructing a class of conditional cyclic
random processes, namely, construct a mathematical model of a cyclic signal in the form of a
conditional cyclic random process of a discrete argument, which would consistently reflect its double
(morphological and rhythmic) stochasticity and made it possible to perform statistical morphological
and rhythm analysis in modern digital data processing information systems.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Results &amp; Discussion</title>
      <p>
        We construct a conditional cyclic random process of a discrete argument (conditional cyclic
discrete random process). To do this, in accordance with [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], we briefly consider the concept of a
cyclic random process   , tml ,   Ω, tml  D  R of a discrete argument and introduce the notion
of a class of isomorphic cyclic random processes of a discrete argument. The time area of definition
of a discrete cyclic random process is an ordered discrete set of real numbers
 ___ 
D  tml  R, m  Z, l  1, L, L  2 whose elements have the following type of linear ordering:
 
tm1l1  tm2l2 , if
      </p>
      <p>m2  m1 or if m2  m1 , and l2  l1 , in other cases tm1l1  tm2l2 ( m2 , m1  Z ,
l2 , l1  1_,_L_ , 0  tm,l1  tm,l   ). This process is defined on same probabilistic space Ω, F, P.</p>
      <p>Definition 1. A discrete random process   , tml ,   Ω, tml  D  R , is called a cyclic discrete
random process, if there is such a discrete function T tml , n that satisfies the conditions of the rhythm
function,that finite-dimensional
vectors
( ( ,   1 1),  ( ,   2 2),…,
 ( , tmkl k ) )
and
(
 ( , tm1l1  T tm1l1 , n) ,  ( , tm2l2  T tm2l2 , n) ,...,  ( , tmklk  T tmklk , n) ), n  Z , for all integers k  N
, are stochastically equivalent in the broad sense.</p>
      <p>For a discrete cyclic random process, the family of its distribution functions satisfies the following
equations:
   ( 1, … ,   ,   1 1, … ,      ) =    ( 1, … ,   ,   1 1 +  (  1 1,  ), … ,      + + (     ,  )) =
   ( 1, … ,   ,  (  1 1,  ), … ,  (     ,  )) ,  1, … ,   ∈  ,   1 1, … ,      ∈  ,  ∈  ,  ∈  .
(1)</p>
      <p>We give the definition of isomorphism with respect to the order and values of cyclic random
processes of a discrete argument. Let us have cyclic random processes  1  , t ,   Ω, tml  D with
rhythm function T1 tml , n and  2  , tml ,   Ω, t ml  D with rhythm function T2 tml , n. Areas of
 ___   ___ 
definition D  tml  R, m  Z, l  1, L, L  2 and D  tml  R, m  Z, l  1, L, L  2 these random
   
processes in the general case are different ( D  D ).</p>
      <p>Definition 2. A cyclic random process 1 , tml ,   Ω, tml  D with a rhythm function T1tml , n
and a cyclic random process  2  , t ml ,   Ω, t ml  D with a rhythm function T2 t ml , n , will be
called isomorphic in order and values, or we say that there is an isomorphism in order and values
between these cyclic random processes, if the following properties occur:</p>
      <p>1. Isomorphism with respect to the order between domains for determining cyclic random
processes (isomorphism between ordered numerical sets D and D ), namely:</p>
      <p>1.a) there is a bijection between D and D (denoted by: D  D ), that is, to any tml  D ,
corresponds to only one tml  D ( tml  tml ), and to any tml  D is responsible only one tml  D (
tml  tml ), and for any different tm1l1 , tm2l2  D their images tm1l1 , tm2l2  D are different, and vice
versa (the corresponding elements tml  D and tml  D , and we shall call them bijective related and
denote it as follows: t ml  t ml );
 2  , t ml ,   Ω, t ml  D , namely:
1.b) the type of linear ordering of sets D
and</p>
      <p>D is preserved, that is tm1l1 , tm2l2  D ,
tm1l1 , tm2l2  D that tm1l1  tm1l1 , tm2l2  tm2l2 and there is an order relation tm2l2  tm1l1 , if tm2l2  tm1l1 ,
and vice versa.</p>
      <p>2. Isomorphism with respect to the order of cyclic random processes 1  , tml ,   Ω, tml  D and
2.a)
there
is
a
bijection
between
random
processes
 2  , tml ,   Ω, tml  D (denoted by: 1  , tml    2  , tml ), that is, any pair tml ,1  , tml  from
1  , tml ,   Ω, tml  D and
a
random
process
1  , tml ,   Ω, tml  D ,
only
one
pair
tml , 2  , tml  (
tml ,1  , tml </p>
      <p>( tml , 2  , tml   tml ,1  , tml  )
tml ,1  , tml   tml , 2  , tml  ) corresponds to a random process  2  , tml ,   Ω, tml  D , and to
any pair tml , 2  , tml  from
a random
process  2  , tml ,   Ω, tml  D , only one pair
corresponds
to
a
random
process
bijective related and denote it as: tml ,1 , tml   tml , 2  , tml  );
1 , tml ,   Ω, tml  D , and for any of them different tm1l1 , tm2l2  D their images tm1l1 , tm2l2  D
are different, and vice versa (corresponding pairs tml ,1 , tml  and tml , 2  , tml  we will call them
2.b) cyclic random processes 1 , tml ,   Ω, tml  D and  2  , tml ,   Ω, tml  D are ordered
by their domains of definition, and the ordinal types of random processes coincide with the ordinal
types of their domains of definition D and D . That is, the set of pairs tml ,1 , tml , tml  D that
form (represent) a cyclic random process 1 , tml ,   Ω, tml  D is orderly by parameter tml and
has the same order type with a numerical set D , since there is always a bijective mapping of the
domain of definition D to the random process 1  , tml ,   Ω, tml  D itself, namely the element
tml  D is matched by only one pair tml ,1 , tml  , and vice versa , and for two different
tm1l1 , tm2l2  D matching them pairs tm1l1 ,1 , tm1l1  and tm2l2 ,1 , tm2l2  also different. The same is
true for a random process  2  , t ml ,   Ω, t ml  D , that is, a linear order from the domain of
definition D is induced into the random process  2  , tml ,   Ω, tml  D itself;
2. c) there is the same type of ordering of cyclic random processes 1 , tml ,   Ω, tml  D and
 2  , tml ,   Ω, tml  D , namely: for any different pairs tm1l1 ,1 , tm1l1  and tm2l2 ,1 , tm2l2 
tm1l1 , 2  , tm1l1  tm2l2 , 2  , tm2l2 
being in the bijective related with pairs and (
tm1l1 ,1 , tm1l1   tm1l1 , 2  , tm1l1  , tm2l2 ,1 , tm2l2   tm2l2 , 2  , tm2l2 ), the relations of order
tm2l2 , 2  , tm2l2   tm1l1 , 2  , tm1l1  and tm2l2 ,1 , tm2l2   tm1l1 ,1 , tm1l1  occur, if tm2l2  tm1l1 and
tm2l2  tm1l1 ( tm1l1  tm1l1 , tm2l2
3. Equality of values of cyclic random processes and
 2  , tml ,   Ω, tml  D takes place, when their respective arguments tml  D and tml  D being in
the bijective related ( tml  tml ), namely, taking into account the property of cyclicity of these random
processes, the following equations hold:</p>
      <p>P1 , tml  T1tml , n   2  , tml  T2 tml , n  1 ,
tml  T1tml , n  tml  T1tml , n, tml  D, tml  D, n  Z. (2)</p>
      <p>For isomorphic with respect to the order and values of cyclic random processes
1 , tml ,   Ω, tml  D and  2  , tml ,   Ω, tml  D the equality of their ( k -dimensional)
distribution functions Fk1 (x1,..., xk , tm1l1 ,..., tmk lk ) and Fk2 (x1,..., xk , tm1l1 ,..., tmk lk ) holds, and when the
corresponding sets of their arguments ti  T1ti , n and ti  T2 ti, n, i  1_,_k_ , n  Z being in the
bijective related, namely, the following relations exist:</p>
      <p>Fk1 x1,..., xk , tm1l1  T1tm1l1 , n,...,tmk lk  T1tmk lk , n 
 Fk2 x1,..., xk , tm1l1  T2 tm1l1 , n,...,tmk lk  T2 tmk lk , n,
1 , tml ,   Ω, tml  D
discrete cyclic random processes with Θ . The equivalence relation   Θ2 can be defined in
different ways, in particular, by postulating isomorphism with respect to the order and values between
cyclic random processes with Θ .</p>
      <p>Defining equivalence relation   Θ2 in a class Θ generates a breakdown DΘ  Θ ,   Β a
class Θ into isomorphic subclasses in order and values of cyclic random processes of the discrete
argument, that is, for the elements of partition DΘ  Θ ,   Β, the following ratios occur:
 Θ  Θ , Θ   , Θ1  Θ 2   , 1   2 , 1,  2  Β . (4)
Β</p>
      <p>We select one arbitrary element from the partition DΘ  Θ ,   Β namely, some class of
equivalence (isomorphism) Θ  DΘ of cyclic random processes of a discrete argument. This class
includes isomorphic discrete cyclic random processes, which are different in order and values,
differing only in their rhythm functions, and the transition from one process to another can be ensured
by the action of the corresponding scale transformation operator. Namely, two arbitrary cyclic random
processes 1 , tml ,   Ω, tml  D and  2  , tml ,   Ω, tml  D with Θ connected through direct
G y12  and inverted G y21  scale conversion operators, namely:
 2  , tml   G y12 1 , tml ,   Ω, tml  D, tml  D ,
1 , tml   G y21  2  , tml ,   Ω, tml  D, tml  D .
(5)
(6)</p>
      <p>
        According to [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], the action of scale conversion operators G y12  and G y21  on cyclic random
processes 1 , tml ,   Ω, tml  D and  2  , tml ,   Ω, tml  D is fully defined (given) by its scale
conversion functions y12 tml , tml  D and y21tml , tml  D which are increasing functions, as
follows:
 2  , tml    2  , y12 tml   1 , tml ,   Ω, tml  D, tml  D .
      </p>
      <p>1 , tml   1 , y21tml    2  , tml ,   Ω, tml  D, tml  D .</p>
      <p>
        According to work [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], between the functions of rhythm T1tml , n and T2 tml , n cyclic random
processes 1 , tml ,   Ω, tml  D and  2  , tml ,   Ω, tml  D of the equivalence classes Θ that
are linked through scale conversion operators G y12  and G y21  have the following dependencies:
T2 y12 tml , n  y12 tml  T1tml , n  y12 tml , tml  D, n  Z
      </p>
      <p>T1y21tml , n  y21tml  T2 tml , n  y21tml , tml  D, n  Z
Statistical analysis of any two
cyclic random
processes
 2  , tml ,   Ω, tml  D of the equivalence class Θ  DΘ by their two multi-cycle realizations
 1 tml  and  2 tml  should give approximate results, namely, similar statistical estimates of the
probabilistic characteristics of the cyclic signals.</p>
      <p>For the formal identification of a concrete discrete cyclic random process, the class Θ submit as
a set labeled with a parameter  isomorphic in order and values of cyclic random processes
Θ    , tml ,   Ω, tml  D ,   Λ given on the same probabilistic space Ω, F, P .</p>
      <p>The parameter  gains values from some set Λ (   Λ ), whose power is equal to the power of
the class Θ . Any, elements with Θ differ only in the discrete area of their definition, and as a
1 , tml ,   Ω, tml  D
(7)
(8)
(9)
(10)
and
consequence, their discrete functions</p>
      <p>___ 
D  tml  R, m  Z, l  1, L, L  2 of

of
any
rhythm.</p>
      <p>Actually
the
definition</p>
      <p>area
discrete
cyclic
random
process
  , tml ,   Ω, tml  D with Θ uniquely identifies (distinguishes, marks) it among other random
___ 
processes from Θ . Also, the area of definition D  tml  R, m  Z, l  1, L, L  2 of a particular

 -process   , tml ,   Ω, tml  D from Θ completely determines its rhythm function T tml , n,
namely:
___</p>
      <p>T tml , n  tmn,l  tml , m, n  Z, l  1, L, L  2, tml  D (11)</p>
      <p>Thus, the set SetOf_D of all possible domains for determining isomorphic in order and values of
cyclic random processes of a discrete argument from a class Θ can also be represented as a
parametric set, namely:</p>
      <p>SetOf_D  D ,   Λ  tml  R, m  Z, l  1, L, L  2,   Λ (12)
___  
 </p>
      <p>In view of the above considerations, there is a bijection between the equivalence class
Θ    , tml ,   Ω, tml  D ,   Λ, the set of domains of definition SetOf_D , and the set of
rhythm functions SetOf_T  T tml , n, t  R, n  Z,  Λ isomorphic in order and values of discrete
cyclic random processes with Θ , namely, Θ  SetOf_D  SetOf_T . With such ambiguous
mappings between classes of functions, the bijective related elements, there will be those elements of
sets Θ , SetOf_D and SetOf_T which have the same parameter  , namely:
  , tml   D  T tml , n.</p>
      <p>The above mathematical objects formally take into account the fact that the model of a cyclic
signal, for example, an electrocardiogram signal is a cyclic random process, and also reflect the
experimental fact that the estimates of the functions of a rhythm of an electrocardio signal on its
different realizations are significantly different, however, the statistical characteristics of the signal on
T tml , n.
its various realizations are approximate. However, such a mathematical description is necessary to
supplement the new probabilistic space, which will make it possible to describe the rhythm of the
electrocardio signal as a random function of rhythm within the framework of the theory of random
processes. Such a description will eliminate the existing contradiction between the descriptions of
rhythm and morphological structure in existing models of cyclic signals and processes.</p>
      <p>To do this, consider a stochastic experiment that is described by some probabilistic space
(Ω′, F′, P′) that is stochastically independent of Ω, F, P . We introduce a random object λ(ω′) =
λ, ω′ ∈ Ω′, λ ∈ Λ as a measuring function with definition area Ω and value range Λ . In this case, ω
′
implementation of a random object λ(ω′) is a parameter  that determines the corresponding cyclic
random process   , tml ,   Ω, tml  D with the definition area D
and the rhythm function</p>
      <p>That is, you can enter the following three random objects that are given in the probabilistic
space (Ω′, F′, P′) , namely: conditional cyclic random process of a discrete argument
  , tml  ,    Ω,   Ω, tml   D  ; the random discrete domain of its definition
 ___ 
D   tml   R, m  Z, l  1, L, L  2 , given on a probabilistic space (Ω′, F′, P′) and taking
 
values from the set SetOf_D , and the random function of the rhythm T tml  , n , is a conditional
cyclic random process of a discrete argument   , tml   that takes its values (deterministic
functions of the rhythm) from the set SetOf_T .</p>
      <p>We give a definition to these three probabilistic objects. First, we define the conditional cyclic
random process of a discrete argument.</p>
      <p>Definition 3. A random object   , tml   Θ ,    Ω,   Ω, tml   D  that is given on
stochastically independent probabilistic spaces Ω, F, P and (Ω′, F′, P′) is called a conditional cyclic
random process of a discrete argument if, for each   , its corresponding   -realization
  , tml ,   Ω, tml  D belongs to a class Θ isomorphic in order and values of cyclic random
processes of the discrete argument.</p>
      <p>Definition 4. A random function T tml  , n,    Ω, tml   R, n  Z given on a probabilistic
space (Ω′, F′, P′) is called a random rhythm function of a conditional cyclic random process of a
discrete argument, if for each   , corresponding to its   -realization T tml , n, tml  D belongs to
the class SetOf_T , each element of which satisfies the conditions of the rhythm function, namely: 1)
a group of conditions: 1.a) T tml , n  0 if n  0 ( T tml ,1   ); 1.b) T tml , n  0 , if n  0 ; 1.c)
T tml , n  0 , if n  0 , tml  D  R ; 2) for any tm1l1  D and t  m1l1  tm2l2 ,
m2l2  D  for which t 
for function T tml , n, strict inequality is fulfilled T  tm1l1 , n tm1l1  T  tm2l2 , n tm2l2 , n  Z ; 3)
the function T tml , n is the smallest modulo ( T  tml , n  T  tml , n ) of all such functions

T  tml , n,   Γ, which satisfy the conditions 1 and 2 above.</p>
      <p></p>
      <p> ___ 
Definition 5. A random object D   tml   R, m  Z, l  1, L, L  2 given on a probabilistic
 
space (Ω′, F′, P′) is called a random domain for determining a conditional cyclic random process of a
discrete argument each   , its corresponding   -realization
if, for
___ 
D  tml  R, m  Z, l  1, L, L  2 is a discrete subset of real numbers whose elements satisfy the
 
following conditions: tm1l1  tm2l2 if m2  m1 , or if m2  m1 , and l2  l1 , in other cases tm1l1  tm2l2 (
___
m2 , m1  Z , l2 , l1  1, L , 0  tm,l1  tml   ).</p>
      <p>Conditional cyclical random process   , tml  ,    Ω,   Ω, tml   D  of a discrete
argument allows simultaneous consideration of both stochasticity of the signals taken into account in
their statistical morphological analysis and stochasticity of the rhythmic structure of the investigated
signal taken into account in the rhythm analysis.</p>
      <p>
        Morphological statistical analysis is reduced to the statistical analysis of any of its   -realization
  , tml ,   Ω, tml  D  as a cyclic random process with a determined rhythm function
T tml , n, tml  D in accordance with known methods of statistic processing of cyclic random
processes [
        <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4">1-4</xref>
        ]. In particular, such an analysis is reduced to a statistical evaluation of the stationary
 ___ 
and stationary-related random processes  l  , tml ,   Ω, tml  D , m  Z, l  1, L embedded in a
 
cyclic random process L . Each such random stationary process is given on a discrete set
Dl  tml  R, m  Z, l  const that is embedded in D and describes (models) the l -th phase of
the investigated electrocardio signal. The values of a stationary discrete stationary random process
 l  , tml ,   Ω, tml  D , m  Z, l  const are defined as follows:
      </p>
      <p> l  , tml     , tml ,   Ω, tml  Dl , m  Z, l  const (13)
Heart rhythm analysis is reduced to a statistical analysis of elements of the random domain of
 ___ 
determining D   tml   R, m  Z, l  1, L, L  2 a conditional cyclic random process of a
 
discrete argument   , tml  ,    Ω,   Ω, tml   D , or to a statistical analysis of its
random rhythm function T tml  , n,    Ω, tml   R, n  Z . The random rhythm function
T tml  , n is completely determined by the elements of the random area D  according to the
formula:
___</p>
      <p>T tml  , n  tmn,l    tm,l  , m, n  Z, l  1, L, tm,l   D 
In particular, when n  1, the rhythm function T tml  ,1 is calculated as follows:
___</p>
      <p>T tml  ,1  tm1,l    tm,l  , m  Z, l  1, L, tm,l   D  .</p>
      <p>If in the heart rhythm analysis we take the random function of the rhythm T tml  ,1 of a
conditional cyclic random process   , tml  , keeping a clear relation to the heart cycle phase and
cardiac cycle number, then we present the mathematical model of the rhythmocardio signal as a
vector of random sequences:</p>
      <p> ____ 
VL ( , m)  Tl ( , m),    Ω, l  1, L, m  Z  , (16)</p>
      <p> 
where each l -th component of the vector is a random sequence Tl ( , m) , whose value is equal to
the value of a random rhythm function T tml  ,1 at times tml   from a discrete set
Dl    tml   R, m  Z, l  const that is embedded in D  and describes the time distances
between the same type l -th phases of the investigated electrocardio signal in its two adjacent cycles,
namely:
Tl ( , m)  T tml  ,1  tm1,l    tm,l  ,</p>
      <p>___
m  Z, l  1, L, tm,l   D .</p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusions</title>
      <p>The procedure of mathematical model of cyclic digital signals in the form of conditional cyclic
random process of discrete argument is developed in the work. The class of isomorphic in order and
(14)
(15)
(17)
values of cyclic random processes of a discrete argument is given. This model allows to take into
account stochasticity of cyclic signals both in their morphological statistical analysis and in statistical
analysis of their rhythm. The definition of a random rhythm function of a conditional cyclic random
process of a discrete argument is given.</p>
      <p>The developed model eliminates the logical contradiction between the known probabilistic
mathematical models of digital cyclic signals and their rhythm models and underpins the development
of new highly informative methods of statistical anaysis of cyclic signals. Based on the new
mathematical model in future research, it is necessary to clarify the probabilistic structure of cyclic
signals with double stochaticity, which will allow the use of new diagnostic features in computer
diagnostic systems.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>P.</given-names>
            <surname>Olofsson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Andersson</surname>
          </string-name>
          , Probability, Statistics, and Stochastic Processes,
          <source>2nd Edition</source>
          , Canada,
          <year>2014</year>
          , p.
          <fpage>576</fpage>
          . ISBN-
          <volume>13</volume>
          :
          <fpage>978</fpage>
          -
          <lpage>0470889749</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>H.</given-names>
            <surname>Pishro-Nik</surname>
          </string-name>
          , Introduction to Probability, Statistics, and Random Processes, USA,
          <year>2016</year>
          , p.
          <fpage>744</fpage>
          .
          <source>ISBN 978-0-9906372-0-2.</source>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A. C.</given-names>
            <surname>Micheas</surname>
          </string-name>
          ,
          <article-title>Theory of Stochastic Objects Probability, Stochastic Processes and Inference</article-title>
          , CRC Press,
          <year>2018</year>
          , p.
          <fpage>408</fpage>
          . ISBN:
          <volume>9781466515215</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>H.</given-names>
            <surname>Kobayashi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. L.</given-names>
            <surname>Mark</surname>
          </string-name>
          , W. Turin, Probability,
          <string-name>
            <given-names>Random</given-names>
            <surname>Processes</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Statistical</given-names>
            <surname>Analysis</surname>
          </string-name>
          , Cambridge University Press,
          <year>2011</year>
          , p.
          <fpage>812</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>O.</given-names>
            <surname>Ibe</surname>
          </string-name>
          <article-title>Fundamentals of Applied Probability and Random Processes</article-title>
          . Academic Press,
          <year>2014</year>
          , p.
          <fpage>431</fpage>
          . ISBN:
          <volume>9780128008522</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>S.</given-names>
            <surname>Miller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Childers</surname>
          </string-name>
          , Probability and Random Processes: With Applications to Signal
          <source>Processing and Communications, 2nd Edition</source>
          , Academic Press,
          <year>2012</year>
          , p.
          <fpage>593</fpage>
          . ISBN:
          <volume>9780123869814</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A.</given-names>
            <surname>Napolitano</surname>
          </string-name>
          , Cyclostationarity: Limits and generalizations,
          <source>Signal Processing 120</source>
          (
          <year>2016</year>
          )
          <fpage>323</fpage>
          -
          <lpage>347</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>V.</given-names>
            <surname>Karyotis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.H.R.</given-names>
            <surname>Khouzani</surname>
          </string-name>
          ,
          <article-title>Malware Diffusion Models for Modern Complex Networks</article-title>
          .
          <source>Theory and Applications</source>
          , Morgan Kaufmann,
          <year>2016</year>
          , p.
          <fpage>324</fpage>
          .
          <source>ISBN 978-0-12-802714-1.</source>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>B.</given-names>
            <surname>Sericola</surname>
          </string-name>
          ,
          <source>Markov Chains: Theory and Applications</source>
          , John Wiley &amp; Sons,
          <year>2013</year>
          , p.
          <fpage>416</fpage>
          . ISBN:
          <fpage>978</fpage>
          -1-
          <fpage>848</fpage>
          -21493-4.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. T</given-names>
            <surname>Denton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. R</given-names>
            <surname>Wilson</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. M Lobo</surname>
          </string-name>
          ,
          <article-title>Probabilistic sensitivity analysis on Markov models with uncertain transition probabilities: an application in evaluating treatment decisions for type 2 diabetes</article-title>
          ,
          <source>Health Care Management Science</source>
          <volume>22</volume>
          (
          <issue>1</issue>
          ) (
          <year>2017</year>
          )
          <fpage>34</fpage>
          -
          <lpage>52</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>R.M. Evaristo</surname>
            ,
            <given-names>A.M.</given-names>
          </string-name>
          <string-name>
            <surname>Batista</surname>
            ,
            <given-names>R.L.</given-names>
          </string-name>
          <string-name>
            <surname>Viana</surname>
            ,
            <given-names>K.C.</given-names>
          </string-name>
          <string-name>
            <surname>Iarosz</surname>
            ,
            <given-names>J.D.</given-names>
          </string-name>
          <string-name>
            <surname>Jr</surname>
            . Szezech,
            <given-names>M.F.</given-names>
          </string-name>
          <string-name>
            <surname>Godoy</surname>
          </string-name>
          ,
          <article-title>Mathematical model with autoregressive process for electrocardiogram signals</article-title>
          ,
          <source>Communications in Nonlinear Science and Numerical Simulation</source>
          ,
          <volume>57</volume>
          (
          <year>2018</year>
          )
          <fpage>415</fpage>
          -
          <lpage>421</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Lupenko</surname>
          </string-name>
          , А.S. Sverstyuk,
          <string-name>
            <given-names>N.S.</given-names>
            <surname>Lutsyk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.B.</given-names>
            <surname>Stadnyk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.M.</given-names>
            <surname>Zozulia</surname>
          </string-name>
          ,
          <article-title>Conditional cyclic random process as a mathematical model of oscillatory signals and processes with double stochasticity</article-title>
          ,
          <source>Printing and Publishing</source>
          <volume>1</volume>
          (
          <issue>71</issue>
          ) (
          <year>2016</year>
          )
          <fpage>147</fpage>
          -
          <lpage>159</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>S.</given-names>
            <surname>Lupenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Lutsyk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Yasniy</surname>
          </string-name>
          , Ł. Sobaszek,
          <article-title>Statistical analysis of human heart with increased informativeness</article-title>
          ,
          <source>Аcta mechanica et automatica 12</source>
          (
          <year>2018</year>
          )
          <fpage>311</fpage>
          -
          <lpage>315</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>S.</given-names>
            <surname>Lupenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zozulya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sverstiuk</surname>
          </string-name>
          , N. Stadnyk,
          <article-title>Mathematical modeling and methods of processing of heart signals on the basis of cyclic random processes and vectors</article-title>
          ,
          <source>Sciences and Education a New Dimension. Natural and Technical Sciences</source>
          ,
          <volume>4</volume>
          (
          <issue>20</issue>
          )
          <fpage>172</fpage>
          (
          <year>2018</year>
          )
          <fpage>47</fpage>
          -
          <lpage>54</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>