1. Introduction
We deal with approximation of solutions to the following delay differential equations (DDEs)
(1.1) 
with the constant timelag , fixed time horizon , , and . We assume that is integrable with respect to and (at least) continuous with respect to . Hence, we consider Carathéodory type conditions for .
Motivation of considering such DDEs comes, for example, from the problem of modeling switching systems with memory, see [hale1977theory], [Hale1993IntroductionTF]. Moreover, another inspiration follows from delayed differential equations with rough paths of the form
(1.2) 
where is an integrable perturbation (which might be of stochastic nature). Then satisfies the (possibly random) DDE (1.1) with and , where we assume that for . In this case the function inherits from its low smoothness with respect to the variable . (The exemplary equation (1.2) is a generalization of the ODE with rough paths discussed in [RKYW2017].)
In the case of classical assumptions (such as regularity of wrt all variables ) imposed on the righthand side function errors for deterministic schemes have been established, for example, in the book [bellen1], which is the standard reference. See also [CZPMPP], where error of the Euler scheme has been investigated for some class of nonlinear DDEs under nonstandard assumptions, such as oneside Lipschitz condition and local Hölder continuity. In contrast, much less is known about the approximation of solutions of DDEs with less regular Carathéodory righthand side function . In the case of Carathéodory ODEs we need to turn to randomized algorithms, such as randomized Euler scheme, since it is wellknown that there is lack of convergence for deterministic algorithms, see [RKYW2017]. This behavior is inherited by DDEs, since ODEs form a subclass of DDEs. Hence, we define randomized version of the Euler scheme that is suitable for DDEs of the form (1.1).
While the randomized algorithms for ODEs have been widely investigated in the literature (see, for example, [bochacik2], [BGMP2021], [daun1], [hein_milla1], [jen_neuen1], [BK2006], [RKYW2017]), according to our best knowledge this is the first paper that defines randomized Euler scheme and rigorously investigates its error for (Carathéodory type) DDEs.
The main contributions of the paper are as follows:

we report results of numerical experiments that show stable error behaviour as stated in Theorem 4.2.
In addition, as a consequence of Theorem 3.1 we establish almost sure convergence of the randomized Euler scheme, see Proposition 4.3.
We want to stress here that the techniques used when proving upper error bounds in Theorem 4.2 differ significantly comparing to that used in [bochacik2], [BGMP2021], [daun1], [hein_milla1], [jen_neuen1], [RKYW2017]
for randomized algorithms defined for ordinary differential equations. Mainly, due to the fact that DDEs have to be considered intervalbyinterval we developed a suitable proof technique that is based on mathematical induction. In particular, suitable inductive assumptions have to be related with the Hölder continuity of
with respect to the (delayed) variable .The structure of the article is as follows. Basic notions, definitions together with assumptions and definition of the randomized Euler scheme are given in Section 2. All Section 3 is devoted to the issue of existence and uniqueness of solutions of the Carathéodory type DDEs (1.1) in the case when is only integrable with respect to and satisfies local Lipschitz assumption with respect to . Section 4 contain proof of the main result of the paper (Theorem 3.1) that states upper bounds on the error of the randomized Euler scheme. In Section 5 we report results of numerical experiments. Finally, Appendix contains auiliary results for Carathéodory type ODEs that we use in the paper.
2. Preliminaries
By we mean the Euclidean norm in
. We consider a complete probability space
. For a random variable
we denote by , where .Let us fix the horizon parameter . On the righthand side function we impose the following assumptions:

[label=(A0),ref=(A0)]

for all ,

is Borel measurable for all ,

there exists such that and for all
(2.1) 
for every compact set there exists such that and for all , ,
(2.2)
In Section 3, under the assumptions 14, we investigate existence and uniqueness of solution for (1.1). Next, in Section 4 we investigate error of the randomized Euler scheme under slightly stronger assumptions. Namely, we impose global Lipschitz assumption on with respect to instead of its local version 4.
The mentioned above randomized Euler scheme is defined as follows. Fix the discretization parameter and set
where
(2.3) 
Note that for each the sequence provides uniform discretization of the subinterval . Let be an iid sequence of random variables, defined on the complete probability space , where every
is uniformly distributed on
. We set and then for , we take(2.4)  
(2.5) 
where . As the output we obtain the sequence of
valued random vectors
that provides a discrete approximation of the values . It is easy to see that each random vector , , , is measurable with respect to the field generated by the following family of independent random variables(2.6) 
As the horizon parameter is fixed, the randomized Euler scheme uses evaluations of (with a constant in the ’’ notation that only depends on but not on ).
In Section 4 we provide upper bounds on the error
(2.7) 
for .
3. Properties of solutions to Carathéodory DDEs
In this section we investigate the issue of existence and uniqueness of the solution of (1.1) under the assumptions 14.
In the sequel we use the following equivalent representation of the solution of (1.1
), that is very convenient when proving its properties and when estimating the error of the randomized Euler scheme. For
and it holds(3.1) 
Hence, we take , and for we consider the following sequence of initialvalue problems
(3.2) 
with , . Then the solution of (1.1) can be written as
(3.3) 
We prove the following result about existence, uniqueness and Hölder regularity of the solution of the delay differential equation (1.1). We will use this theorem in the next section when proving error estimate for the randomized Euler algorithm. Since we were not able to find references in literature that are suitable for (1.1) under the assumptions 14, for the completeness and convenience of the reader we provide its justification.
Theorem 3.1.
Proof.
We proceed by induction. We start with the case when and consider the following initialvalue problem
(3.7) 
with . Of course for all the function is continuous and for all the function is Borel measurable. Moreover, by (2.1) we have for all , and by (2.2) for every compact set in there exists a positive function such that for all , it holds
(3.8) 
Therefore, by Lemma 7.1 we have that there exists a unique absolutely continuous solution of (3.7) that satisfies (3.4) with . In addition, if for some then by Lemma 7.1 we obtain that satisfies (3.6) for .
Let us now assume that for some there exists a unique absolutely continuous solution of
(3.9) 
where , and that satisfies (3.4) with (3.6), if for some . We consider the following initialvalue problem
(3.10) 
with . Since is continuous on , it is straightforward to see that for all the function is continuous and for all the function is Borel measurable. Moreover, by (3.4) for all
(3.11) 
where
(3.12) 
Furthermore, by (2.2) and (3.4) for every compact set in there exists a positive function such that for all , it holds
(3.13) 
where
(3.14) 
Hence, by Lemma 7.1 there exists a unique absolutely continuous solution of (3.10). By the inductive assumption and Lemma 7.1 we get that
and
(3.15) 
where
This ends the inductive proof. ∎
Remark 3.2.
4. Error of the randomized Euler scheme
In this section we perform detailed error analysis for the randomized Euler. As mentioned in Serction 1, for the error analysis we impose global Lipschtz assumption on with respect to together with global Hölder condition with respect to . Namely, instead of 3 and 4, we assume

[label=(A3’),ref=(A3’)]

there exist , and such that and for all
(4.1) and for all ,
(4.2)
Remark 4.1.
Note that the assumptions 1, 2, 1 are stronger than the assumptions 14. To see that note that if satisfies 1, 2, 1 then we get for all and that
(4.3) 
and
(4.4) 
since and for all . Hence, the assumptions 14 are satisfied with , for any compact set , and under the assumptions 1, 2, 1 the thesis of Theorem 3.1 holds.
The main result of this section is as follows.
Theorem 4.2.
Proof.
In the proof we use the following auxiliary notation: and . Then is uniformly distributed in and is uniformly distributed in .
We start with and consider the initialvale problem (3.7). We define the auxiliary randomized Euler scheme as
(4.7)  
(4.8) 
Since and , for all we have that . Moreover, by (A1), (A2) and (A3’) we have that is Borel measurable, and for all and
(4.9) 
where , as stated in Remark 4.1. Hence, by Theorem 3.1 and by using analogous arguments as in the proof of Theorem 4.3 in [RKYW2017] we get
where does not depend on . Since we get (4.5) for .
Let us now assume that there exists for which there exists such that for all
(4.10) 
We consider the following initialvalue problem
(4.11) 
with . Recall that by (A1), (A2), (A3’), Theorem 3.1, and Remark 4.1 the function is Borel measurable and for all , it satisfies
(4.12) 
(4.13) 
We define the auxiliary randomized Euler scheme as follows
(4.14)  
(4.15) 
From the definition it follows that , , , is measurable with respect to the filed generated by (2.6), so as . Moreover, approximates at , however is not implementable. We use only in order to estimate the error (4.5) of , since it holds
(4.16)  
Firstly, we estimate . For we get
which gives
Note that the random variables and are not independent. However, by Theorem 3.1 we get
Therefore for
Since and due to the fact that the random variables , are independent, we get
By Jensen inequality and (4.10) we have
(4.17) 