Skip to Content
EntropyEntropy
  • Feature Paper
  • Article
  • Open Access

15 April 2026

31 Pages

Dynamics, Noise, Delays and the Gibbs and Conditional Entropy

and
1
Departments of Physiology, Physics & Mathematics, McGill University, 3655 Promenade Sir William Osler, Montreal, QC H3G 1Y6, Canada
2
Institute of Mathematics, University of Silesia in Katowice, Bankowa 14, 40-007 Katowice, Poland
*
Author to whom correspondence should be addressed.
This article belongs to the Section Statistical Physics

Abstract

In this paper we review the concepts of the Gibbs and conditional entropies and examine their dynamic behaviour when the underlying dynamics are described by ordinary differential equations or stochastic differential equations. We then go on to introduce techniques for the analogous examination when the dynamics involve delays and noise. It is found that the effects of stochastic perturbations and/or delayed dynamics may be such that the approach of the entropies to equilibrium are not necessarily monotone and are dependent on system parameters.

1. Introduction

The inexorable passage of time both fascinates and terrifies humans: witness the amount of money spent yearly trying to cosmetically reverse, or slow down, the effects of the passage of time, to obtain an idea of just how concerning people find it. This one-way evolution of time is, of course, simply a reflection of the operation of the second law of thermodynamics. Were it not for the consequences of the second law there would presumably be far less panic about the passage of time. We are quite sure, however, there would still be a lingering curiosity about why time evolves in only one direction.
The development of thermodynamics was spurred on by developments in industrial processes during the early to mid-nineteenth century as people had to deal with the concepts of heat, work, and temperature in the pursuit of increased efficiency of steam engines. The initial work by Sadi Carnot led to the formulation of the laws of thermodynamics, due to the efforts of William Thompson (later Lord Kelvin) and Rudolf Clausius. These developments in thermodynamics, including the ‘laws of thermodynamics’, culminated in the development of statistical mechanics, which makes predictions of the collective macroscopic behaviour of particles from their microscopic behaviours.
The second law of thermodynamics states that in a closed (no transfer of matter or energy in or out) system the entropy of the system can only increase (or stay constant) as time progresses. We may characterize this as the strong form of the second law, while the weak form would simply specify that the entropy will approach zero in the limit of long times. The strong form clearly implies the weak form.
In the latter part of the nineteenth century, in the developing field of statistical mechanics, individuals started to seriously contemplate how to define and compute this quantity known as entropy. Three names of giants come to mind—Ludwig Boltzmann (Germany), Henri Poincaré (France), and J. Willard Gibbs (USA)—for their insights into the concept of entropy. For reasons that we will discuss later, Gibbs was the clear winner, and Section 2 will introduce the Gibbs entropy and a generalization of it. The remainder of the paper will deal with the issue of the temporal change in entropy, and this will be based on considerations from physics. Section 3 commences our consideration of the temporal evolution of entropy, as enshrined in the second law of thermodynamics, by reviewing entropy evolution when the underlying dynamics are defined by ordinary differential equations. We then continue in the same section to consider the added effects of noise on entropy evolution. This is a review of the material presented in [1,2].
Section 4 constitutes the bulk of this paper, adding the possibility of delays in dynamics to the mix of entropy evolution and the second law. In Section 4.1 we briefly review multidimensional stochastic functional differential equations, and in Section 4.2 we turn to a consideration of general linear equations with Gaussian noise, as it is only for such equations that we know what the density evolution is and what the entropies are. This examination of the effects of Gaussian noise in linear systems as a first approximation is only possible because of the well-developed theory of Gaussian processes with continuous sample paths. We derive various formulas for entropy dynamics, and show that the conditional entropy will approach zero but need not do so as a monotone function of time. Though linear dynamics driven by Gaussian noise is well motivated by analytical tractability and by its relevance to a broad class of stochastic processes, it is essential to emphasize to the reader that the closed-form entropy expressions we obtain here rely crucially on these assumptions. In particular, the Gaussian structure and linear evolution ensure that the state remains fully characterized by its first two moments, a property that generally fails in nonlinear and/or non-Gaussian systems. Consequently, the results derived here should not be interpreted as generic entropy laws applicable beyond the linear/Gaussian framework.
In Section 4.3 we give examples of non-monotone convergence to zero of the conditional entropy. First we consider a one-dimensional example as initially presented in [3], and next we present completely new material on a second-order differential delay equation perturbed by noise. Section 4.4 contains a derivation of analytical expressions for the variances of the stationary position and velocity variables from Section 4.3. Finally in Section 4.5 we introduce one possible approach to obtain a Fokker–Planck-type equation for stochastic delay differential equations, extending the material presented in [3,4] to delay equations with both discrete and distributed delays. We conclude with some brief remarks in Section 5.

2. Entropies: Gibbs and Conditional

In this paper we are concerned with the dynamic behaviour of entropies that are relevant for physical systems, and thus we confine our attention to the Gibbs entropy, first considered in Gibbs [5], and the conditional entropy which generalizes the Gibbs entropy. The latter has been the object of study by a number of different authors [6,7,8].
In his original work Gibbs assumed that he was dealing with a system operating in a phase space X which attains a steady-state density f * . Given this steady-state density he defined the ‘index of probability’ as ln f * ( x ) (ln is the natural logarithm) and identified the steady-state (equilibrium) entropy to be
H G ( f * ) = − ∫ X f * ( x ) ln f * ( x )   d x .
The equilibrium entropy definition, according to Gibbs, in (1) is the standard for equilibrium computations in thermodynamics and statistical mechanics and has led to the identification of H G ( f * ) with the equilibrium thermodynamic entropy.
There is no particular reason to restrict the definition of the Gibbs entropy in (1) to equilibrium situations, and indeed we extend it to define the time-dependent Gibbs entropy of f ( x , t ) by
H G ( f ( · , t ) ) = − ∫ X f ( x , t ) ln f ( x , t )   d x .
In addition to generalizing the Gibbs entropy to time-dependent situations we can also generalize the Gibbs entropy to situations in which we have a non-uniform steady-state density  f * . This generalization has acquired the name of conditional entropy [9] and is given by
H c ( f ( · , t ) | f * ) = − ∫ X f ( x , t ) ln f ( x , t ) f * ( x ) d x .
It should be noted that − H c ( f ( · , t ) | f * ) is also known as the Kullback–Leibler divergence (I-divergence or relative entropy) [10]. It measures the distance between the two densities and it satisfies − H c ( f ( · , t ) | f * ) ≥ 0 .
But what about the Austrian giant Ludwig Boltzmann and his original entropy [11] (actually there were several different varieties of Boltzmann entropies and [12] has untangled and clarified their inter-relationships)? Problems with the Boltzmann entropy have been very elegantly and clearly analyzed in [13]. The Boltzmann entropy fails to give proper equilibrium entropies in several physical situations [14], while the Gibbs entropy does not suffer from this defect. Secondly, the Gibbs and Boltzmann entropies are only in agreement for extremely dilute gases in which the constituents do not interact. Finally, studies [2] have identified situations in which the Boltzmann entropy behaves non-physically but the Gibbs entropy does not. There is a very nice study of Boltzmann versus Gibbs entropy [15] for the interested reader.
To conclude this section, we recall the amusing quotation from Eddington [16] re-framing the issue of temporal unidirectionality in terms of the behaviour of entropy, saying
“The law that entropy always increases holds, I think, the supreme position among the laws of Nature. If someone points out to you that your pet theory of the universe is in disagreement with Maxwell’s equations—then so much the worse for Maxwell’s equations. If it is found to be contradicted by observation—well, these experimentalists do bungle things sometimes. But if your theory is found to be against the Second Law of Thermodynamics I can give you no hope; there is nothing for it to collapse in deepest humiliation.”

3. Behavior of Entropies for Dynamics Described by Differential Equations and Their Stochastic Perturbations

3.1. Density Evolution Equations

Consider the dynamics defined by the system of ordinary differential equations
d x i d t = F i ( x ) ,   i = 1 , … , d ,
with initial conditions x i ( 0 ) = x i , 0 from a subset of R d . We rewrite it in the vector form as
x ′ ( t ) = F ( x ( t ) ) ,   t > 0 ,   x ( 0 ) = x 0 .
The probability density f ( x , t ) , if it exists, of the variable x ( t ) satisfies the generalized Liouville equation
∂ f ∂ t = − ∑ i ∂ ( f F i ) ∂ x i ,
and if there exists a steady-state density f * , then it is the stationary solution of Equation (4):
∑ i ∂ ( f * F i ) ∂ x i = 0 .
We next turn our attention to the Itô-type stochastic differential equation
d x ( t ) = F ( x ( t ) ) d t + Σ ( x ( t ) )   d w ( t ) ,   t > 0 ,   x ( 0 ) = x 0 ,
where Σ ( x ) = [ σ i j ( x ) ] is a d × n matrix and w is an n-dimensional standard Wiener process on an underlying probability space ( Ω , F , P ) . Recall that a standard Wiener process is a Gaussian process with continuous paths and stationary independent increments for which
E ( w ( t ) − w ( s ) ) = 0 ,   E ( ( w ( t ) − w ( s ) ) ( w ( t ) − w ( s ) ) T ) = I | t − s | ,   t , s ≥ 0 ,
where the superscript T denotes the transpose and I is the identity matrix. Here and later E is the expectation operator corresponding to the probability measure P . We assume that both F and Σ satisfy a global Lipschitz condition. It is known [17,18,19] that if x ( t ) is the solution to the stochastic differential Equation (5) then the evolution of the density function f ( x , t ) of x ( t ) is described by the Fokker–Planck equation (Kolmogorov forward equation)
∂ f ∂ t = − ∑ i = 1 d ∂ [ F i ( x ) f ] ∂ x i + 1 2 ∑ i , j = 1 d ∂ 2 [ a i j ( x ) f ] ∂ x i ∂ x j
where
a i j ( x ) = ∑ k = 1 n σ i k ( x ) σ j k ( x ) .
Moreover, if there exists a stationary density f * ( x ) then it is the solution of the stationary Fokker–Planck Equation (6):
− ∑ i = 1 d ∂ [ F i ( x ) f ] ∂ x i + 1 2 ∑ i , j = 1 d ∂ 2 [ a i j ( x ) f ] ∂ x i ∂ x j = 0 .

3.1.1. Gibbs and Conditional Entropies

Differentiating with respect to time the Gibbs entropy, as given by Equation (2), leads to
d H G d t = ∫ f ∑ i ∂ F i ( x ) ∂ x i − 1 2 ∑ i , j ∂ 2 a i j ( x ) ∂ x i ∂ x j   d x + 1 2 ∫ 1 f ∑ i , j = 1 d a i j ( x ) ∂ f ∂ x i ∂ f ∂ x j   d x .
Note that if a i j values do not depend on x then we obtain
d H G d t = ∫ f ∑ i ∂ F i ( x ) ∂ x i   d x + 1 2 ∑ i , j = 1 d a i j ∫ 1 f ∂ f ∂ x i ∂ f ∂ x j   d x .
In particular, the second term in the right-hand side of (8) is non-negative definite, but the first term is of indeterminant sign [20] (Equation (14)). Thus the temporal behavior of the Gibbs entropy in its approach to equilibrium is unclear.
Next, if we differentiate Equation (3) for the conditional entropy with respect to time, then we obtain
d H c d t = 1 2 ∫ f * 2 f ∑ i , j = 1 d a i j ( x ) ∂ ∂ x i f f * ∂ ∂ x j f f *   d x ,
where we used (6), integration by parts and Equation (7) for the stationary density f * . Consequently,
d H c d t ≥ 0 ,
because the matrix ( a i j ( x ) ) is non-negative definite. Hence, we conclude that the conditional entropy is a monotone increasing function of time and satisfies the strong form of the second law. In particular, if all a i j values are equal to zero (no noise) then d H c d t = 0 , implying that in the noise-free case when f is the solution of the Liouville Equation (4), then
H c ( f ( · , t ) | f * ) ≡ H c ( f 0 | f * ) .
This last result deserves some consideration since it is so important.
1.
All of the formulations of fundamental classical, relativistic, and quantum physics are in terms of ordinary or partial differential equations and without noise.
2.
Thus any temporal evolution of entropy in these systems would appear to be impossible.
3.
It could only occur that the entropy might change (see (9)) in the presence of noise.
This is astonishing and pinpoints exactly the conundrum that physics has always faced (Equation (10)) in terms of trying to find a dynamical foundation for the second law of thermodynamics (either weak or strong).

3.1.2. Convergence to Zero of the Conditional Entropy

Various conditions implying convergence to zero of the conditional entropy are known; see, e.g., Mackey and Tyran-Kamińska [1] for a review. Here we only indicate how one can obtain a lower bound on the conditional entropy H c ( f ( · , t ) | f * ) knowing that the probability density function p ( x , t | x 0 ) of x ( t ) conditional on x ( 0 ) = x 0 exists. One identifies the transition probability p ( x , t | x 0 ) as a solution of the Fokker–Planck Equation (6) with the initial condition δ ( x − x 0 ) . Then we obtain
f ( x , t ) = ∫ p ( x , t | x 0 ) f 0 ( x 0 )   d x 0 ,
where f 0 is the density of the initial condition x 0 , leading to
0 ≥ H c ( f ( · , t ) | f * ) ≥ ∫ H c ( p ( · , t | x 0 ) | f * ) f 0 ( x 0 ) d x 0
by Jensen’s inequality (see [3]). Consequently, if lim t → ∞ H c ( p ( · , t | x 0 ) | f * ) = 0 for all x 0 then
lim t → ∞ H c ( f ( · , t ) | f * ) = 0 .

3.2. Effects of Noise

Specific examples for which one can determine the densities f ( · , t ) and f * and the corresponding entropies are mainly known for linear differential equations with additive noise. Our first example is an Ornstein–Uhlenbeck process that was developed as a perturbation to the velocity v of a Brownian particle and is given by the Langevin equation
d v d t = − γ v + σ ξ ( t ) ,
where γ > 0 , σ > 0 and ξ ( t ) is white noise. In this case (5) reduces to
d v ( t ) = − γ v ( t ) d t + σ d w ( t ) ,
where w ( t ) is a standard one-dimensional Wiener process. Another frequently used example is a noisy harmonic oscillator
d 2 d t 2 x ( t ) + γ d d t x ( t ) + β x ( t ) = σ ξ ( t )
with positive constant coefficients. If we introduce the variables
x ( t ) = x ( t ) v ( t )   with   v ( t ) = x ′ ( t ) ,
then we obtain
d x ( t ) = A x ( t ) d t + Σ d w ( t ) ,
where
A = 0 1 − β − γ   and   Σ = 0 σ .
Thus, in this section we consider the general multidimensional Ornstein–Uhlenbeck process
d x ( t ) = A x ( t ) d t + Σ d w ( t )
where A is a d × d matrix and Σ is a d × n matrix. The solution to Equation (13) is
x ( t ) = e t A x ( 0 ) + ∫ 0 t e ( t − r ) A Σ   d w ( r )
where e t A = ∑ k = 0 ∞ t k k ! A k . Note that X ( t ) = e t A is the solution to X ′ ( t ) = A X ( t ) satisfying X ( 0 ) = I and it is called the fundamental solution of the deterministic equation x ′ ( t ) = A x ( t ) . The properties of stochastic integrals imply that the process
ζ ( t ) = ∫ 0 t X ( t − s ) Σ   d w ( r ) ,   t ≥ 0 ,
is Gaussian. Its mean vector is equal to 0 and its covariance function is given by
E ( ζ ( t ) ζ ( t + s ) T ) = ∫ 0 t e ( t − r ) A Σ Σ T e ( t + s − r ) A T d r ,
by Itô’s isometry. In particular, the distribution of ζ ( t ) is Gaussian with mean 0 and the variance–covariance matrix
R ( t ) : = E ( ζ ( t ) ζ ( t ) T ) = ∫ 0 t e r A Σ Σ T e r A T d r .
Observe that the matrix R ( t ) is symmetric. Since e r A Σ Σ T e r A T is non-negative definite for all r ≥ 0 , the matrix R ( t ) is also nonnegative definite, but it might not be positive definite. In particular, if the Kalman rank condition holds [21,22], i.e., for the d × d matrix A and the d × n matrix Σ , the d × d n block matrix
[ A | Σ ] : = [ Σ   A Σ   …   A d − 1 Σ ]
is of full rank ( rank [ A | Σ ] = d ), then the matrix R ( t ) is of full rank. Consequently, R ( t ) is positive definite for all t > 0 , or equivalently det R ( t ) > 0 .
Let f m , Q be a Gaussian density with mean vector m and positive definite covariance matrix Q, i.e.,
f m , Q ( x ) = 1 ( 2 π ) d / 2 ( det Q ) 1 / 2 e − 1 2 ( x − m ) T Q − 1 ( x − m ) ,   x ∈ R d ,
where Q − 1 is the inverse of the matrix Q. Assume that the density f 0 of x ( 0 ) is f m , Q . Then x ( t ) as given in (14) has a Gaussian distribution with mean vector E ( x ( t ) ) = e t A m and the covariance matrix R ¯ ( t ) is of the form
R ¯ ( t ) = e t A Q e t A T + R ( t ) ,   t > 0 .
Consequently, the distribution of x ( t ) does not depend on t if and only if m = 0 and there exists a covariance matrix R * such that
R * = e t A R * e t A T + R ( t ) ,   t > 0 .
Differentiating (18) with respect to t and then setting t = 0 we obtain the following equation for R * :
A R * + R * A T + Σ Σ T = 0 .
Thus the covariance matrix R * satisfies (19). Conversely, if R * is the solution of (19) then (18) holds as well. Note that if R ( t ) is positive definite then R * is also positive definite by (18).

3.2.1. Existence of a Stationary Density

In what follows we assume that rank [ A | Σ ] = d . Then x ( t ) with x ( 0 ) = x 0 has a Gaussian distribution with mean e t A x 0 and a positive definite covariance R ( t ) as in (15). Letting R ( t ) − 1 be the inverse matrix of R ( t ) , the density of x ( t ) is given by
p ( x , t | x 0 ) = 1 ( 2 π ) d / 2 ( det R ( t ) ) 1 / 2 exp { − 1 2 ( x − e t A x 0 ) T R ( t ) − 1 ( x − e t A x 0 ) } .
A stationary density f * exists if and only if the matrix A has only eigenvalues with negative real parts. In that case, the stationary density f * has the form
f * ( x ) = 1 ( 2 π ) d / 2 ( det R * ) 1 / 2 exp − 1 2 x T R * − 1 x ,
with the positive definite matrix R * being the unique symmetric matrix satisfying (19) and given by
R * = ∫ 0 ∞ e s A Σ Σ T e s A T d s .
Since R ( t ) → R * and e t A → 0 as t → ∞ , we have
lim t → ∞ p ( x , t | x 0 ) = f * ( x ) .
Consequently, every stationary solution of the corresponding Fokker–Planck equation is a constant multiple of the stationary density f * .
A stationary solution of (13) can be represented as
Z ( s ) = ∫ − ∞ s e ( s − r ) A Σ d w ( r ) ,   s ∈ R ,
where we extend the Wiener process w to R taking its independent copy { w ¯ ( t ) : t ≥ 0 } and setting w ( r ) = − w ¯ ( − r ) for r < 0 . Observe that
Z ( t ) = e t A Z ( 0 ) + ζ ( t ) ,   t ≥ 0 ,
implying that Z ( t ) is a solution of (13). Since ζ ( t ) is a Gaussian distributed vector, we see that Z ( t ) has a Gaussian distribution with mean 0 and variance–covariance matrix R * . Consequently, Z ( t ) , t ≥ 0 , is a stationary solution of (13) and f * is the density of Z ( t ) .

3.2.2. Noise and the Temporal Behaviour of Gibbs and Conditional Entropies

For the Gaussian density f m , Q in (16), the Gibbs entropy is
H G ( f m , Q ) = 1 2 ( d + ln [ ( 2 π ) d det Q ] ) ,
while for two Gaussian densities f m 1 , Q 1 and f m 2 , Q 2 the conditional entropy is
H c ( f m 1 , Q 1 | f m 2 , Q 2 ) = 1 2 ln det Q 1 det Q 2 + 1 2 tr [ ( Q 1 − 1 − Q 2 − 1 ) Q 1 ] − 1 2 tr [ Q 2 − 1 ( m 1 − m 2 ) ( m 1 − m 2 ) T ] .  
Consequently, if f 0 = f m , Q with m = E ( x ( 0 ) ) and Q = E ( x ( 0 ) − m ) ( x ( 0 ) − m ) T , then for the density f ( x , t ) of x ( t ) we obtain the following
H G ( f ( · , t ) ) = 1 2 ( d + ln [ ( 2 π ) d det R ¯ ( t ) ] ) ,
where R ¯ ( t ) is given by (17) and
H c ( f ( · , t ) | f * ) = 1 2 ln det R ¯ ( t ) det R * + 1 2 tr ( I − R * − 1 R ¯ ( t ) ) − 1 2 tr ( R * − 1 e t A m m T e t A T ) .
Note that if Q = R * then R ¯ ( t ) = R * and Equation (24) reduces to
H c ( f ( · , t ) | f * ) = − 1 2 tr ( R * − 1 e t A m m T e t A T )
which is always an increasing function of time when m ≠ 0 .
Observe that if m = x ( 0 ) = : x 0 and Q = 0 , then we recover H c ( p ( · , t | x 0 ) | f * ) from Equation (24). Thus, for an arbitrary initial density f 0 with finite variance, we obtain from (11) the lower bound
H c ( f ( · , t ) | f * ) ≥ 1 2 ln det R ( t ) det R * + 1 2 tr ( I − R * − 1 R ( t ) ) − 1 2 ∫ tr ( R * − 1 e t A x 0 x 0 T e t A T ) f 0 ( x 0 ) d x 0
for the conditional entropy. Since
lim t → ∞ e t A = 0   and   lim t → ∞ R ( t ) = R * ,
it is clear that lim t → ∞ H c ( f ( · , t ) | f * ) = 0 . Remember that we have H ˙ c ( f ( · , t ) | f * ) ≥ 0 by (9) so we have the strong form of the second law obeyed in this case.
Thus, the conditional entropy H c for these stochastic systems increases monotonically to 0. To see what the temporal behavior of the Gibbs entropy is, consider first the one-dimensional Ornstein–Uhlenbeck process. If we start with a Gaussian density with mean m 0 and variance σ 0 2
f 0 ( v 0 ) = 1 2 π σ 0 2 exp − ( v 0 − m 0 ) 2 2 σ 0 2 ,
then by Equations (17) and (15) we obtain
R ¯ ( t ) = σ 0 2 e − 2 γ t + ∫ 0 t σ 2 e − 2 γ s d s = σ 0 2 e − 2 γ t + σ 2 2 γ ( 1 − e − 2 γ t )
and the stationary density is given by
f * ( v ) = 1 2 π σ * 2 exp − v 2 2 σ * 2   with   σ * 2 = σ 2 2 γ .
Thus, the Gibbs entropy is
H G ( f ( · , t ) ) = 1 2 + 1 2 ln ( 2 π ) + 1 2 ln ( σ * 2 + ( σ 0 2 − σ * 2 ) e − 2 γ t ) ,
and it is either an increasing function of time when σ 0 2 > σ * 2 or a decreasing function of time when σ 0 2 < σ * 2 , while the conditional entropy, given by
H c ( f ( · , t ) | f * ) = 1 2 ln 1 + σ 0 2 σ * 2 − 1 e − 2 γ t − 1 2 σ 0 2 σ * 2 − 1 e − 2 γ t − m 0 2 2 σ * 2 e − 2 γ t ,
is a strictly increasing function of time for σ 0 2 ≠ σ * 2 or m 0 ≠ 0 .
The temporal behavior of the Gibbs entropy can have more complicated patterns; see Figure 1 and Figure 2 and [1,2] in the case of the noisy harmonic oscillator.
Figure 1. Entropy behaviour in the noisy harmonic oscillator (12). The left-hand panel shows the plot of the conditional entropy given by (24) and the right panel shows the plot of the Gibbs entropy given by (23). The parameters are γ = 1 , β = 1 / 4 , and σ 2 = 1 and the variance–covariance matrix Q is diagonal, with the initial variances of position and velocity being equal to 1 and 2 respectively, while the initial means are set to be equal to 0.
Figure 2. Entropy behaviour in the noisy harmonic oscillator (12). The left-hand panel shows the plot of the conditional entropy given by (24) and the right panel shows the plot of the Gibbs entropy given by (23). The parameters are γ = 1 , β = 20 , and σ 2 = 40 and the variance–covariance matrix Q is again diagonal, with the initial variances of position and velocity equal to 0.9 and 25 respectively, while the initial means are set equal to 0.

4. Adding Delays in the Dynamics

Though the subject of the dynamics of differential delay equations (DDEs) is well developed and relatively mature, things are not quite so clear when one wishes to examine the role of delays in the temporal evolution of entropy. This is because in studying entropy dynamics, the density in a system plays a central role, and there are great difficulties in the study of density evolution under the action of delayed dynamics. Thus we investigate the temporal behavior of entropies for linear systems with additive perturbations leading to Gaussian processes with densities being determined through a vector-valued mean function and a matrix-valued variance–covariance function extending the one-dimensional linear differential equations with a single delay in [3]. We show that the temporal behavior of the conditional entropy depends on the initial condition and is not necessarily a monotone function of time.
The monograph [23] treats in detail the techniques that have been tried unsuccessfully to examine density evolution in delayed systems, while [24] examines certain aspects of this problem from the perspective of microphysical systems. Historically, important approaches have been made by a number of different groups ([24,25,26,27,28,29,30,31,32]), but it is unfortunately the situation that foundational issues are still unresolved and a satisfactory and unified theory allowing one to examine the evolution of densities in (infinite dimensional) delayed systems is yet to be developed. We [3,4] have employed various techniques to circumvent the problems outlined in [23] for the single delay case. At the end of this section, we show how this approach can be extended to functional differential equations with both discrete and distributed delays. The presentation is somewhat technical, but unavoidable, because of the difficulties encountered due to the infinite dimensional nature of systems with delayed dynamics.

4.1. Stochastic Functional Differential Equations

DDEs or more generally functional differential equations (FDEs) are equations in which the rate of change of a system at the present time depends not only on its current state but also on its state at one or more times in the past. The evolution of the system cannot be determined from a single initial value, because the equation explicitly refers to past states. Instead, one must specify a history function, which prescribes the state of the system over a whole time interval in the past—typically from time − τ up to 0, where τ is the maximum delay. This history function acts as the ‘initial condition’ for the differential equation: once it is given, the equation can be used to compute the solution forward in time, which motivates working on the space of paths that are continuous functions on the interval [ − τ , 0 ] . In this path-space setting, the solution map, denoted below as S t , provides a clean way to describe a dynamical system showing how the initial function evolves forward in time. Because delayed dynamics are inherently non-Markovian at the level of the observed state, we need to work on this space of functions to recover the Markov property when adding noise. In Section 4.5 we recall the associated extended generator that captures the infinitesimal time evolution of observables on this enlarged space. Once this framework is in place, we can project back from paths to the observed state variable, recovering evolution equations for its probability density. We refer the reader to [33,34,35] for a thorough introduction to functional differential equations and their stochastic perturbations.
Suppose τ > 0 is a given real number. For a continuous x : [ − τ , ∞ ) → R d we introduce the notation x t ∈ C , where
x t ( s ) = x ( t + s )   for   s ∈ [ − τ , 0 ] , t ≥ 0 ,
and C : = C ( [ − τ , 0 ] , R d ) is the space of continuous functions ϕ : [ − τ , 0 ] → R d . Given a mapping F : C → R d we consider the functional differential equation
x ′ ( t ) = F ( x t ) ,   t ≥ 0 , x 0 = ϕ .
We assume that F satisfies a global Lipschitz condition so that a unique solution x : [ − τ , ∞ ) → R d of (25) exists for each initial condition x 0 = ϕ ∈ C , and it depends continuously on ( t , ϕ ) and x t ∈ C for t > 0 . Then the solution map S t : C → C given by
S t ( ϕ ) ( s ) = x t ( s )   for   s ∈ [ − τ , 0 ] ,
is well defined for all t ≥ 0 and gives rise to a semi-dynamical system { S t } t ∈ R + on the Banach space C equipped with the supremum norm [33]. In particular if
F ( ϕ ) = F ( ϕ ( 0 ) , ϕ ( − τ ) ) ,   ϕ ∈ C ,
for some transformation F : R d × R d → R d , then we recover the case of a single delay equation whose density evolution was studied in [3,4].
We next look at a noise-perturbed version of (25):
d x ( t ) = F ( x t ) d t + Σ ( x t ) d w ( t ) ,   t ≥ 0 , x 0 = ϕ ,
where { w ( t ) } t ≥ 0 is again an n-dimensional standard Wiener process and the stochastic perturbation has an amplitude (diffusion coefficient) Σ , potentially continuously dependent on x t , with values in the space R n × d of n × d matrices. We assume that both F and Σ satisfy a global Lipschitz condition, so that the stochastic functional differential Equation (26) (see [35]) has a pathwise solution x and that { x t } t ≥ 0 is a Markov process with values in the space C, where again
x t ( s ) = x ( t + s ) ,   s ∈ [ − τ , 0 ] , t ≥ 0 .
We end this section with a remark about how one can obtain a lower bound on the conditional entropy as in Section 3, but now for the densities defined by solutions of the stochastic functional differential equation considered in this section. If it happens that the solution x ( t ) = x t ( 0 ) of (26) with each deterministic initial condition ϕ ∈ C has a probability density function, say p ( x , t | ϕ ) , then the function
f ( x , t ) = ∫ C p ( x , t | ϕ ) μ 0 ( d ϕ ) ,   x ∈ R d , t ≥ 0 ,
defines the density of x ( t ) = x t ( 0 ) when the initial condition x 0 has the distribution μ 0 , which is now a distribution on the function space C. Using Jensen’s inequality, we obtain [3]
H c ( f ( · , t ) | f * ) ≥ ∫ C H c ( p ( · , t | ϕ ) | f * ) μ 0 ( d ϕ ) .
Consequently, if H c ( p ( · , t | ϕ ) | f * ) converges to zero as t → ∞ for all ϕ ∈ C then we conclude that
lim t → ∞ H c ( f ( · , t ) | f * ) = 0 .

4.2. A Linear Functional Differential Equation

A particular example of a linear functional differential equation is
x ′ ( t ) = A x ( t ) + B x ( t − τ ) + ∫ − τ 0 A ( θ ) x ( t + θ ) d θ ,
where A and B are d × d matrices and A ( · ) : [ − τ , 0 ] → R d × d is a continuous matrix-valued function. Once again, to proceed, we require some technical developments specific to linear delayed dynamics.
Suppose that F : C → R d is a continuous linear mapping. By the Riesz representation theorem, we can write
F ( ϕ ) = A ϕ ( 0 ) + ∫ − τ 0 d η ( θ ) ϕ ( θ ) ,
where η = [ η i j ] i , j = 1 , … , d is a matrix-valued function of bounded variation and the integral is the Lebesgue–Stieltjes integral. Note that F ( ϕ ) − A ϕ ( 0 ) is a d-dimensional vector with coordinates
∑ j = 1 d ∫ − τ 0 ϕ j ( θ ) d η i j ( θ ) ,   i = 1 , … , d .
Let S t : C → C be the solution map of the functional linear equation
x ′ ( t ) = A x ( t ) + ∫ − τ 0 d η ( θ ) x ( t + θ ) ,   t ≥ 0 , x 0 = ϕ .
In particular, we have
x ( t ) = S t ϕ ( 0 ) ,   t ≥ 0 .
The stability of the trivial solution x ( t ) ≡ 0 is determined by the roots of the characteristic (eigenvalue) equation
det h ( λ ) = 0 ,   h ( λ ) = λ I − A − ∫ − τ 0 e θ λ d η ( θ ) ,
where h : C → C d × d . If all solutions of (29) have negative real parts, then all solutions of (28) tend to 0 as t → ∞ .
The fundamental solution X ( t ) of Equation (28) is the d × d matrix function satisfying
X ′ ( t ) = A X ( t ) + ∫ − τ 0 d η ( θ ) X ( t + θ )
with
X ( s ) = 0   for   s ∈ [ − τ , 0 )   and   X ( 0 ) = I ,
where I is the identity matrix. Let
α 0 = sup { Re ( λ ) : det h ( λ ) = 0 } .
As in the scalar case the fundamental matrix solution X has the following bound [33]: for each α > α 0 there exists a constant C > 0 such that
| X ( t ) | ≤ C e α t   for   all   t > 0 ,
where | · | is a norm of the d × d matrix.
Let Σ be a d × n matrix and w be an n-dimensional standard Wiener process. Given an initial continuous function ϕ : [ − τ , 0 ] → R d we can write the solution of
d x ( t ) = ( A x ( t ) + ∫ − τ 0 d η ( θ ) x ( t + θ ) ) d t + Σ d w ( t ) ,   t > 0 , x 0 = ϕ ,
as
x ( t ) = S t ϕ ( 0 ) + ∫ 0 t X ( t − r ) Σ d w ( r ) ,
where S t is the solution map and X ( t ) is the fundamental matrix solution of the deterministic part (28). This corresponds to (14) in the case of τ = 0 . The process
ζ ( t ) = ∫ 0 t X ( t − r ) Σ d w ( r ) ,   t ≥ 0 ,
is a Gaussian process with values in R d that have zero mean vector and the matrix-valued covariance function of the form
E ( ζ ( t ) ζ ( t + s ) T ) = ∫ 0 t X ( t − r ) Σ Σ T X ( t + s − r ) T d r ,   t , s ≥ 0 ,
by Itô’s isometry. The variance of ζ ( t ) is thus given by
R ( t ) : = Var ( ζ ( t ) ) = E ( ζ ( t ) ζ ( t ) T ) = ∫ 0 t X ( r ) Σ Σ T X ( r ) T d r ,   t ≥ 0 .
Note that R ( t ) is as in (15) when τ = 0 . Although the matrix R ( t ) in (35) is symmetric and non-negative definite, it does not need be positive definite. Observe that ζ defines for each t ≥ 0 the segment ζ t by
ζ t ( s ) = ζ ( t + s ) , if   s + t ≥ 0 , s ∈ [ − τ , 0 ] , 0 , if   s + t < 0 , s ∈ [ − τ , 0 ] .
Consequently, the process x t in (27) being defined by the solution of (34) has the following representation:
x t = S t ϕ + ζ t ,   x 0 = ϕ .
Let μ t be the distribution of x t as in (36). Now suppose that x 0 = ϕ is a Gaussian process. Then x t is a Gaussian process and x ( t ) is an R d -valued Gaussian random vector. To characterize its distribution μ ( t ) it is enough to find its mean vector and the variance–covariance matrix. We have
E ( x ( t ) ) = S t m 0 ( 0 ) ,
where S t m 0 is the solution of (28) with the initial condition being the mean function
m 0 ( s ) = E ( ϕ ( s ) ) ,   s ∈ [ − τ , 0 ] ,
and the variance of x ( t ) is given by the equation
R ¯ ( t ) : = Var ( x ( t ) ) = Var ( S t ϕ ( 0 ) ) + R ( t ) ,   t > 0 .
In particular, if x 0 = ϕ is deterministic, so that the function ϕ is fixed, then x t is also a Gaussian process and Var ( S t ϕ ( 0 ) ) = 0 . If, on the other hand, S t ϕ is an R d -valued Gaussian process with mean vector S t m 0 then we can assume that m 0 ≡ 0 .

4.2.1. Existence of a Stationary Density

Suppose that α 0 < 0 , where α 0 is defined in (32). Then S t ϕ ( 0 ) → 0 as t → ∞ . It follows from (33) that for some α < 0 and C > 0
| ∫ t ∞ X ( r ) Σ Σ T X ( r ) T d r | ≤ C | Σ Σ T | ∫ t ∞ e 2 α r d r → 0   as   t → ∞ ,
implying that the following limit exists and is finite:
lim t → ∞ R ( t ) = ∫ 0 ∞ X ( r ) Σ Σ T X ( r ) T d r : = R * .
If R ( t ) is non-singular (equivalently, R ( t ) is positive definite), then the density p of the distribution μ ( t ) of x ( t ) is given by the Gaussian density
p ( x , t | ϕ ) = 1 ( 2 π ) d / 2 ( det R ( t ) ) 1 / 2 e − 1 2 ( x − S t ϕ ( 0 ) ) T R ( t ) − 1 ( x − S t ϕ ( 0 ) ) ,   x ∈ R d ,
where R ( t ) − 1 is the inverse matrix of the covariance matrix R ( t ) . If R ( t ) is positive definite, we see that its limit R * is also positive definite and thus invertible. Then we have
lim t → ∞ p ( x , t | ϕ ) = 1 ( 2 π ) d / 2 ( det R * ) 1 / 2 e − 1 2 x T R * − 1 x = f * ( x ) ,
and f * is as in (20) with R * now given by (38). Equation (34) has a stationary solution of the form [35] (Corollary 4.2.1)
Z ( s ) = ∫ − ∞ s X ( s − r ) Σ d w ( r ) ,   s ∈ R
and the distribution of Z ( s ) is Gaussian with density f * as in (40).

4.2.2. The Gibbs and Conditional Entropies

In this section, we assume that the matrix R ( t ) is positive definite for all sufficiently large t. Let the initial condition ϕ be a Gaussian process and let f ( · , t ) be the Gaussian density of x ( t ) with variance R ¯ ( t ) as in (37) and the mean vector S t m 0 with m 0 being the mean vector of the initial condition ϕ . By (21) we have
H G ( f ( · , t ) ) = 1 2 d + ln ( 2 π ) d det R ¯ ( t ) ) ,
and thus
d H G ( f ( · , t ) ) d t = 1 2 det R ¯ ( t ) d det R ¯ ( t ) d t .
By Jacobi’s formula we have
d ln det R ¯ ( t ) d t = tr R ¯ ( t ) − 1 d R ¯ ( t ) d t ,
implying that
d H G ( f ( · , t ) ) d t = 1 2 tr R ¯ ( t ) − 1 d R ¯ ( t ) d t .
If we take f m 1 , Q 1 as in (39) and f m 2 , Q 2 as in (40), then Q 1 = R ¯ ( t ) , m 1 = S t m 0 ( 0 ) , and Q 2 = R * , m 2 = 0 . Hence, by (22), we have
H c ( f ( · , t ) | f * ) = 1 2 ln det ( R * − 1 R ¯ ( t ) ) + 1 2 tr [ I − R * − 1 R ¯ ( t ) ] − 1 2 tr [ R * − 1 S t m 0 ( 0 ) ( S t m 0 ( 0 ) ) T ]  
and so the temporal derivative of the conditional entropy satisfies
d H c ( f ( · , t ) | f * ) d t = 1 2 tr R ¯ ( t ) − 1 d R ¯ ( t ) d t − R * − 1 d R ¯ ( t ) d t − R * − 1 d S t m 0 ( 0 ) ( S t m 0 ( 0 ) ) T d t .
If we take as the initial condition x 0 = ϕ with ϕ ( s ) = Z ( s ) + m 0 ( s ) for s ∈ [ − θ , 0 ] , where Z is the Gaussian process, being the stationary solution of (34), and m 0 is a non-zero initial mean function, then R ¯ ( t ) = R * and we obtain from (43) that
H c ( f ( · , t ) | f * ) = − 1 2 tr [ R * − 1 S t m 0 ( 0 ) ( S t m 0 ( 0 ) ) T ] .
However, we cannot conclude that the conditional entropy H c , given by the function − 1 2 tr [ R * − 1 S t m 0 ( 0 ) ( S t m 0 ( 0 ) ) T ] , is strictly increasing although it converges to zero. See Section 4.3 for examples.
If, on the other hand, we take m 0 = ϕ with ϕ fixed, so that the initial condition is deterministic, then R ¯ ( t ) = R ( t ) . Hence, we recover H G ( p ( · , t | ϕ ) ) from Equation (42) and H c ( p ( · , t | ϕ ) | f * ) from (43). Since the matrix d R ( t ) d t is non-negative definite, we see that the matrix R ( t ) − 1 d R ( t ) d t is also nonnegative definite. Consequently, its trace is nonnegative, implying that
d H G ( p ( · , t | ϕ ) ) d t ≥ 0
so the Gibbs entropy of the density p is monotone increasing and thus the strong form of the second law holds. Since
R ( t ) − 1 d R ( t ) d t − R * − 1 d R ( t ) d t = R * − 1 ( R * − R ( t ) ) R ( t ) − 1 d R ( t ) d t
and the matrix R * − R ( t ) , given by
R * − R ( t ) = ∫ t ∞ X ( r ) Σ Σ T X ( r ) T d r ,
is non-negative definite, we conclude that
tr R ( t ) − 1 d R ( t ) d t − R * − 1 d R ( t ) d t ≥ 0 .
However, as in the one-dimensional case we cannot claim that
− tr R * − 1 d S t ϕ ( 0 ) ( S t ϕ ( 0 ) ) T d t ≥ 0
and once again the presence of the delay has opened the possibility of a non-monotone approach of the conditional entropy to zero and, thus, a shift to the weak form of the second law.
Finally, for the density f ( x , t ) of x t ( 0 ) with initial condition x 0 chosen according to a distribution μ 0 we obtain
H c ( f ( · , t ) | f * ) ≥ 1 2 ln   det R ( t ) det R * + 1 2 tr [ I − R * − 1 R ( t ) ] − 1 2 ∫ C tr [ R * − 1 S t ϕ ( 0 ) ( S t ϕ ( 0 ) ) T ] μ 0 ( d ϕ ) .
Since R ( t ) → R * and S t ϕ ( 0 ) → 0 as t → ∞ , we conclude that
lim t → ∞ H c ( f ( · , t ) | f * ) = 0 .

4.2.3. The Covariance of the Stationary Solution

To find R * let us look at the matrix-valued covariance of the process { Z ( s ) : s ∈ R } :
K ( s ) = E ( Z ( t ) Z ( s + t ) T ) ,   s ∈ R .
The covariance function is given by
K ( s ) = ∫ − ∞ min { t , s + t } X ( t − u ) Σ Σ T X ( s + t − u ) T d u
by the Itô isometry. Changing the variables in the integral leads to
K ( s ) = ∫ 0 ∞ X ( r ) Σ Σ T X ( r + s ) T d r ,   s ≥ 0 ,
and
K ( s ) = ∫ 0 ∞ X ( r − s ) Σ Σ T X ( r ) T d r ,   s < 0 .
Hence K ( s ) = K ( − s ) T for s < 0 . Note that
R * = K ( 0 ) = K ( 0 ) T .
Let us now derive a differential equation for the matrix K ( t ) for t > 0 . We have
K ′ ( t ) = ∫ 0 ∞ X ( r ) Σ Σ T X ′ ( r + t ) T d r .
It follows from (30) that
X ′ ( r + t ) T = X ( r + t ) T A T + ∫ − τ 0 X ( r + t + θ ) T d η T ( θ ) ,   r , t > 0 ,
implying that K satisfies the equation
K ′ ( t ) = K ( t ) A T + ∫ − τ 0 K ( t + θ ) d η T ( θ ) ,   t > 0 .
Moreover, we have
d d r ( X ( r ) Σ Σ T X ( r ) T ) = X ′ ( r ) Σ Σ T X ( r ) T + X ( r ) Σ Σ T X ′ ( r ) T
and
∫ 0 ∞ X ( r ) Σ Σ T X ′ ( r ) T d r = K ′ ( 0 ) ,   where   K ′ ( 0 ) = lim s ↓ 0 K ′ ( s ) .
Hence, we obtain
K ′ ( 0 ) T + K ′ ( 0 ) = − Σ Σ T   with   K ′ ( 0 ) = K ( 0 ) A T + ∫ − τ 0 K ( θ ) d η T ( θ ) .
Consequently, if we want to find R * = K ( 0 ) , then we need to solve Equation (48) subject to condition (49).
In general, it is impossible to find a solution of (48), though in the one-dimensional case with a single discrete delay one was derived in [36]; see also [28]. Here we obtain a second-order differential equation for the covariance K of the stationary solution of equation
d x ( t ) = [ A x ( t ) + B x ( − τ ) ] d t + Σ d w ( t ) ,
where B is a d × d matrix. It follows from (48) that the covariance K ( t ) of the stationary solution satisfies
K ′ ( t ) = K ( t ) A T + K ( t − τ ) B T ,   t > 0 ,
and K ( s ) = K ( − s ) T for s ≤ 0 . For t ∈ ( 0 , τ ) we have K ( t − τ ) = K ( τ − t ) T . Thus, we obtain
K ′ ( t ) = K ( t ) A T + K ( τ − t ) T B T ,   t ∈ ( 0 , τ ) .
Next, differentiating the function U ( t ) = K ( τ − t ) T we get
U ′ ( t ) = d d t [ K ( τ − t ) T ] = − A K ( τ − t ) T − B K ( t )
implying that
K ′ ′ ( t ) = K ′ ( t ) A T + U ′ ( t ) B T = K ′ ( t ) A T − A K ( τ − t ) T B T − B K ( t ) B T .
From Equation (51) we obtain
K ( τ − t ) T B T = K ′ ( t ) − K ( t ) A T .
Consequently, the covariance satisfies for t ∈ ( 0 , τ ) the second-order matrix differential equation
K ′ ′ ( t ) = K ′ ( t ) A T − A K ′ ( t ) + A K ( t ) A T − B K ( t ) B T
with
K ′ ( 0 ) + K ′ ( 0 ) T = − Σ Σ T ,   K ′ ( 0 ) = K ( 0 ) A T + K ( τ ) T B T .
Let us summarize symbols used in Section 4.2:
  • F—a general linear continuous mapping on C = C ( [ − τ , 0 ] , R d ) , A, B – d × d matrices;
  • S t —the solution map of (28); S t ϕ ( 0 ) is the solution of (28);
  • X ( t ) —the fundamental matrix solution (30) and (31);
  • x ( t ) —the solution of (34); its variance is R ¯ ( t ) ;
  • ζ ( t ) —a Gaussian vector with zero mean and the variance equal to R ( t ) as in (35);
  • R * —the limit of the variance R ( t ) as defined in (38);
  • Z ( s ) , s ∈ R —the Gaussian process as in (41) that is the stationary solution of (34);
  • K ( s ) —the matrix-valued covariance function of the stationary process Z; K ( 0 ) = R * .

4.3. Examples

4.3.1. A Linear Equation with Single Delay in One Dimension

Consider the single delay Equation (50) in the case of d = 1 , so that A = a and B = b are real constants
d x ( t ) = ( a x ( t ) + b x ( t − τ ) ) d t + σ d w ( t ) .
The entirety of the ( a τ , b τ ) plane inside the hatched wedge-shaped area in Figure 3 corresponds to parameter values ( a , b , τ ) such that this equation has a stationary solution and a stationary density.
Figure 3. A graphical representation of the stability region for the linear equation with single delay as determined by [37]. Modified from [38].
Equation (52) for the variance K ( t ) of the stationary solution Z reduces to
K ′ ′ ( t ) = ( a 2 − b 2 ) K ( t ) ,
with initial and boundary conditions
K ′ ( 0 ) = − σ 2 2 ,   K ′ ( 0 ) = a K ( 0 ) + b K ( τ ) .
It follows from [36] that if a 2 ≠ b 2 then the variance K ( 0 ) = V * is given by
V * = σ 2 2 b sinh ( a 2 − b 2 τ ) − a 2 − b 2 a 2 − b 2 ( b cosh ( a 2 − b 2 τ ) + a ) .
Note that if τ = 0 , b = 0 and a = − γ we recover the variance σ * 2 of the stationary Ornstein–Uhlenbeck process from Section 3.2. The conditional entropy as given in (45) reduces to
H c ( f ( · , t ) | f * ) = − 1 2 m 2 ( t ) σ * 2 ,
where m ( t ) = S t m 0 ( 0 ) is the solution of the equation x ′ ( t ) = a x ( t ) + b x ( t − τ ) with the initial condition function m 0 ( s ) , s ∈ [ − τ , 0 ] ; see Figure 4.
Figure 4. The left-hand panel shows the temporal behaviour of the conditional entropy given by (54) for an initial condition m 0 ( s ) = s + 1 with s ∈ [ − 1 , 0 ] and parameters a = − 1 , b = − 2 , τ = 1 , and σ = 1 , while the right-hand panel shows the plot of the increasing conditional entropy given by (54) for τ = 0 , b = 0 , and initial condition m 0 = 1 .

4.3.2. A Second-Order Equation with One Delay

We now consider a particle of mass m, located at a position x ( t ) and moving with velocity v ( t ) and subject to a delayed restoring force [ − β x ( t − τ ) ] as well as a delayed frictional force − γ v ( t − τ ) and a fluctuating force σ ξ ( t ) , where β > 0 and γ > 0 , while σ ≥ 0 and ξ ( t ) is the white noise. Thus, the dynamics of this noisy, delayed harmonic oscillator are given by
d d t x ( t ) = v ( t ) , m d d t v ( t ) = − γ v ( t − τ ) − β x ( t − τ ) + σ ξ ( t ) .
Note that the system (55) with m = 1 in the absence of noise ( σ = 0 ) is equivalent to the second-order linear delayed equation
d 2 d t 2 x ( t ) = − γ d d t x ( t − τ ) − β x ( t − τ ) .
This equation is a special case of the general second-order delay differential equation
d 2 d t 2 x ( t ) + a 1 d d t x ( t ) + a 0 x ( t ) = b 0 x ( t − τ ) + b 1 d d t x ( t − τ ) ,
where a 1 , a 0 , b 1 , b 0 are real constants. The stability of the trivial solution x ( t ) ≡ 0 of the deterministic Equation (57) is determined by the roots of the characteristic (eigenvalue) equation
λ 2 + a 1 λ + a 0 − b 1 λ e − λ τ − b 0 e − λ τ = 0 ,
obtained with the ansatz x ( t ) ∼ e λ t . One can infer conditions for asymptotic stability from the literature [39,40,41,42]. In particular, if b 0 ≥ a 0 then the trivial solution is unstable. In what follows we thus assume that a 0 > b 0 and that all roots of (58) have negative real parts, i.e.,
a 0 > b 0   and   α 0 : = sup { Re ( λ ) : λ   satisfies   ( 58 ) } < 0 .
Note that if we take τ = 0 in (58), then we have α 0 < 0 iff a 0 > b 0 and a 1 > b 1 . See Section 4.4.2 for necessary and sufficient conditions for α 0 < 0 when τ > 0 . The stability region of parameters for Equation (56) is presented in Figure 5.
Figure 5. A graphical representation of the stability region of the steady state x ≡ 0 of (56). The entirety of the ( γ τ , β τ 2 ) plane in the hatched banana-shaped area corresponds to parameter values ( β , γ , τ ) such that x = 0 is stable. Modified from Kolmanovskii and Myshkis [34] (Chapter 4).
Now consider Equation (57) with noise
d 2 d t 2 x ( t ) + a 1 d d t x ( t ) + a 0 x ( t ) = b 0 x ( t − τ ) + b 1 d d t x ( t − τ ) + σ ξ ( t ) ,
and see [29,31,32] for particular examples. Introducing the variables
x ( t ) = x ( t ) v ( t )   with   v ( t ) = x ′ ( t ) ,
then we obtain
d x ( t ) = [ A x ( t ) + B x ( t − τ ) ] d t + Σ d w ( t ) ,
where w ( t ) is a standard one-dimensional Wiener process and
A = 0 1 − a 0 − a 1 ,   B = 0 0 b 0 b 1 ,   Σ = 0 σ .
We can define a stationary solution { Z ( t ) : t ∈ R } for (59) as in the previous section. Let K ( t ) = ( k i j ( t ) ) i , j = 1 , 2 be its covariance matrix t ≥ 0 .
First, we show that
k 12 ( t ) + k 21 ( t ) = 0   for   all   t ≥ 0 .
Recall that
K ( t ) = ∫ 0 ∞ X ( r ) Σ Σ T X ( r + t ) T d r .
Since the fundamental solution X ( t ) is a 2 × 2 matrix, which we represent as X ( t ) = ( x i j ( t ) ) i , j = 1 , 2 , and furthermore, it satisfies
X ′ ( t ) = A X ( t ) + B X ( t − τ ) ,   t > 0 , X ( 0 ) = I ,   X ( s ) = 0   for   s < 0 ,
we see that
x 12 ′ ( t ) = x 22 ( t )   for   t > 0 ,   x 12 ( s ) = 0   for   s ≤ 0 .
Thus, we obtain
X ( r ) Σ = σ x 12 ( r ) x 12 ′ ( r )
and
X ( r ) Σ Σ T X ( r + t ) T = σ 2 x 12 ( r ) x 12 ( r + t ) x 12 ( r ) x 12 ′ ( r + t ) x 12 ′ ( r ) x 12 ( r + t ) x 12 ′ ( r ) x 12 ′ ( r + t ) .
We have
k 12 ( t ) = ∫ 0 ∞ σ 2 x 12 ( r ) x 12 ′ ( r + t ) d r .
Since x 12 ( r ) → 0 as r → ∞ and x 12 ( 0 ) = 0 , integrating by parts leads to
k 12 ( t ) = − ∫ 0 ∞ x 12 ′ ( r ) x 12 ( r + t ) d r = − k 21 ( t ) .
Next it follows from (60) that the matrix R * = K ( 0 ) is diagonal, since K ( 0 ) T = K ( 0 ) . Thus the stationary density f * as given by (40) will be of the form
f * ( x , v ) = 1 2 π σ x 2 σ v 2 e − x 2 2 σ x 2 + v 2 2 σ v 2 ,   x , v ∈ R ,
where the variances
σ x 2 = k 11 ( 0 )   and   σ v 2 = k 22 ( 0 )
and k 11 ( 0 ) , k 22 ( 0 ) are the diagonal elements of the matrix K ( 0 ) as given by (85).
The Gibbs and conditional entropies behave as described in Section 4.2. Although the conditional entropy always converges to zero, it might not be an increasing function of time, as the following example shows.
We consider the initial condition x 0 to be x 0 ( s ) = Z ( s ) + m 0 ( s ) , s ∈ [ − τ , 0 ] , where Z is the stationary Gaussian process and m 0 is a non-zero mean vector function with m 0 ( s ) = ( m 0 x ( s ) , m 0 x ′ ( s ) ) T , s ∈ [ − τ , 0 ] . Then the conditional entropy is by (45), equal to
H c ( f ( · , t ) | f * ) = − 1 2 m x 2 ( t ) σ x 2 + m v 2 ( t ) σ v 2 ,
where m x ( t ) is the solution of (57) with initial condition m 0 x , while m v ( t ) = m x ′ ( t ) . Particular examples are given in Figure 6 and Figure 7, where we have a 0 = 0 and a 1 = 0 together with b 0 = − β and b 1 = − γ with the values of ( β , γ , τ ) in the hatched area of Figure 5.
Figure 6. The left-hand panel shows a plot of the conditional entropy given by (63) for initial condition m 0 x ( s ) = s + 1 for s ∈ [ − 1 , 0 ] and parameters a 0 = a 1 = 0 , b 0 = − 0.25 , b 1 = − 1 , τ = 1 , σ = 1 , while the right-hand panel shows the plot of the conditional entropy, given by (63), with τ = 0 for initial condition m x ( 0 ) = 1 , m v ( 0 ) = 1 .
Figure 7. This is a plot of the conditional entropy as given by (63) for initial condition m 0 x ( s ) = s 2 + 1 for s ∈ [ − 1 , 0 ] and parameters a 0 = a 1 = 0 , b 0 = − 0.25 , b 1 = − 1 , τ = 1 , σ = 1 .

4.4. Determination of the Variances in (62)

This section is devoted to a derivation of the variances k 11 ( 0 ) and k 22 ( 0 ) as functions of parameters a 1 , a 0 , b 1 , b 0 and the delay τ for the stationary solution of (59). Let K ( t ) = ( k i j ( t ) ) i , j = 1 , 2 be its covariance matrix function (61). To find the equation for k i j ( t ) for t ∈ ( 0 , τ ) we infer from (51) and (60) that
k 11 ′ ( t ) − k 21 ′ ( t ) k 21 ′ ( t ) k 22 ′ ( t ) = k 11 ( t ) − k 21 ( t ) k 21 ( t ) k 22 ( t ) 0 − a 0 1 − a 1 + k 11 ( τ − t ) k 21 ( τ − t ) − k 21 ( τ − t ) k 22 ( τ − t ) 0 b 0 0 b 1 ,
implying that
k 11 ′ ( t ) = − k 21 ( t ) ,   k 21 ′ ( t ) = k 22 ( t )
and
k 22 ′ ( t ) = − a 0 k 21 ( t ) − a 1 k 22 ( t ) − b 0 k 21 ( τ − t ) + b 1 k 22 ( τ − t ) .
Using (52) we arrive at
k 22 ′ ′ ( t ) = − 2 a 0 k 21 ′ ( t ) + ( a 0 2 − b 0 2 ) k 11 ( t ) + ( a 1 2 − b 1 2 ) k 22 ( t )
and applying (64) we obtain the following system of second-order differential equations:
k 11 ′ ′ ( t ) = − k 22 ( t ) , k 22 ′ ′ ( t ) = ( a 0 2 − b 0 2 ) k 11 ( t ) + ( a 1 2 − b 1 2 − 2 a 0 ) k 22 ( t ) .
The initial boundary conditions for this equation, based on (53), turn into
k 11 ′ ( 0 ) = 0 ,   k 22 ′ ( 0 ) = − σ 2 2 ,
and
k 21 ′ ( 0 ) = k 22 ( 0 ) , − k 21 ′ ( 0 ) = − a 0 k 11 ( 0 ) + b 0 k 11 ( τ ) + b 1 k 21 ( τ ) , k 22 ′ ( 0 ) = − a 1 k 22 ( 0 ) − b 0 k 21 ( τ ) + b 1 k 22 ( τ ) .
Combining them together with k 21 ( τ ) = − k 11 ′ ( τ ) by (64), we conclude that Equation (66) is supplemented with
a 0 k 11 ( 0 ) − k 22 ( 0 ) − b 0 k 11 ( τ ) + b 1 k 11 ′ ( τ ) = 0 , a 1 k 22 ( 0 ) − b 0 k 11 ′ ( τ ) − b 1 k 22 ( τ ) = σ 2 2 , k 11 ′ ( 0 ) = 0 ,   k 22 ′ ( 0 ) = − σ 2 2 .
Consequently, we may rewrite (66) as a second-order system of equations in the vector form
k 11 ′ ′ ( t ) k 22 ′ ′ ( t ) = G k 11 ( t ) k 22 ( t )
with
G = 0 − 1 a 0 2 − b 0 2 a 1 2 − b 1 2 − 2 a 0 .
The general solution of this equation is
k 11 ( t ) k 22 ( t ) = C ( t ) k 11 ( 0 ) k 22 ( 0 ) + S ( t ) k 11 ′ ( 0 ) k 22 ′ ( 0 ) ,
where
C ( t ) = ∑ k = 0 ∞ t 2 k ( 2 k ) ! G k   and   S ( t ) = ∑ k = 0 ∞ t 2 k + 1 ( 2 k + 1 ) ! G k .
Since C ′ ( t ) = G S ( t ) and S ′ ( t ) = C ( t ) , we also have
k 11 ′ ( t ) k 22 ′ ( t ) = G S ( t ) k 11 ( 0 ) k 22 ( 0 ) + C ( t ) k 11 ′ ( 0 ) k 22 ′ ( 0 ) .
We can rewrite (67) as the following equation:
G 1 k 11 ( 0 ) k 22 ( 0 ) + G 2 k 11 ( τ ) k 22 ( τ ) + G 3 k 11 ′ ( τ ) k 22 ′ ( τ ) = 0 σ 2 2 ,
where
G 1 = a 0 − 1 0 a 1 ,   G 2 = − b 0 0 0 b 1 ,   G 3 = b 1 0 − b 0 0 .
Using (69) and (71) for t = τ , we rewrite condition (72) as
( G 1 + G 2 C ( τ ) + G 3 G S ( τ ) ) k 11 ( 0 ) k 22 ( 0 ) + ( G 2 S ( τ ) + G 3 C ( τ ) ) 0 − σ 2 2 = 0 σ 2 2 .
Consequently, we obtain
k 11 ( 0 ) k 22 ( 0 ) = ( G 1 + G 2 C ( τ ) + G 3 G S ( τ ) ) − 1 ( I + G 2 S ( τ ) + G 3 C ( τ ) ) 0 σ 2 2
and
k 11 ( t ) k 22 ( t ) = C ( t ) k 11 ( 0 ) k 22 ( 0 ) + S ( t ) 0 − σ 2 2 ,   t ∈ ( 0 , τ ) .
Remark 1.
Our approach implies that the function k 22 satisfies, by (66), the following fourth-order differential equation
k 22 ( i v ) ( t ) − ( a 1 2 − b 1 2 − 2 a 0 ) k 22 ′ ′ ( t ) + ( a 0 2 − b 0 2 ) k 22 = 0 .
If we go back to (64) and (65), and if we take m = 1 , a 1 = a , a 0 = k , b 1 = − b , b 0 = 0 , k 21 ( t ) = g ( t ) , and k 22 ( t ) = C ( t ) , then we get the same equation as Equation (10) in [29], where it is postulated that a general solution of Equation (10) is of the form
C ( t ) = A c cos ( ω ( t − τ / 2 ) ) + A s sin ( ω ( t − τ / 2 ) ) ,
with constants A c , A s , ω derived separately. However, observe that no matter what the constants are, we obtain
C ′ ′ ( t ) = − ω 2 C ( t ) ,
but C ( t ) should be a general solution of (75). A similar approach was used in [31] (Appendix B) with Equation (B2), where b 1 = 0 , b 0 = g / Q 0 , a 1 = 1 / Q 0 , a 0 = 1 , and k 22 ( t ) = ϕ v v ( t ) .

4.4.1. General Form of the Matrices C ( t ) and S ( t ) in (70)

To calculate the matrices C ( t ) and S ( t ) , we find the eigenvalues of the matrix G. The characteristic equation det ( z I − G ) = 0 for the matrix G in (68) is given by
z 2 − tr ( G ) z + det ( G ) = 0 ,
where
tr ( G ) = a 1 2 − b 1 2 − 2 a 0   and   det ( G ) = a 0 2 − b 0 2 .
Thus, we arrive at
z 2 − ( a 1 2 − b 1 2 − 2 a 0 ) z + ( a 0 2 − b 0 2 ) = 0 ,
whose roots are
z ± = 1 2 ( a 1 2 − b 1 2 − 2 a 0 ± Δ ) ,
where
Δ = ( a 1 2 − b 1 2 − 2 a 0 ) 2 − 4 ( a 0 2 − b 0 2 ) .
Suppose that Δ > 0 , so that there are two different real eigenvalues. If det G < 0 then z + z − < 0 while if det G > 0 then z ± < 0 or z ± > 0 . The case of det G = 0 implies that one of the roots is equal to 0. If Δ < 0 then z ± = α e ± i β , where α ≥ 0 and β ∈ R , and we write z ± = α e ± i β / 2 . Finally, if Δ = 0 and det G ≠ 0 then z + = z − ≠ 0 , while if det G = 0 then z + = z − = 0 .
We have
C ( t ) = c 0 ( t ) I + c 1 ( t ) G ,   S ( t ) = s 0 ( t ) I + s 1 ( t ) G ,
for some functions c i , s i , i = 0 , 1 that we now specify.
1.
If Δ ≠ 0 and det ( G ) ≠ 0 then
c 0 ( t ) = z + c − ( t ) − z − c + ( t ) ,   c 1 ( t ) = c + ( t ) − c − ( t ) s 0 ( t ) = z + s − ( t ) − z − s + ( t ) ,   s 1 ( t ) = s + ( t ) − s − ( t )
where
c ± ( t ) = cosh ( t z ± ) z + − z − ,   s ± ( t ) = sinh ( t z ± ) ( z + − z − ) z ± .
2.
If Δ ≠ 0 and det ( G ) = 0 so that one of the roots is equal to zero, then c 0 and c 1 stay the same and
s 0 ( t ) = 0 ,   s 1 ( t ) = sinh ( t z + ) z + z + .
3.
Now suppose that Δ = 0 and det ( G ) ≠ 0 , so that z + = z − ≠ 0 . Then
c 0 ( t ) = cosh ( t z + ) − 1 2 z + t sinh ( t z + ) ,   c 1 ( t ) = t 2 z + sinh ( t z + )
and
s 0 ( t ) = 3 2 z + sinh ( t z + ) − t 2 cosh ( t z + ) , s 1 ( t ) = t 2 z + cosh ( t z + ) − 1 2 z + z + sinh ( t z + ) .
4.
Finally, when Δ = 0 and det ( G ) = 0 , then z + = z − = 0 and we have
c 0 ( t ) = 1 ,   c 1 ( t ) = 1 2 t 2 ,   s 0 ( t ) = t ,   s 1 ( t ) = 1 6 t 3 .

4.4.2. Stability Analysis of the Deterministic Delay Equation

To find the stability region for the second-order delay equation [39,40], substitute λ = i ω with ω > 0 into the characteristic Equation (58), separating it into real and imaginary parts:
a 0 − ω 2 = b 0 cos ( ω τ ) + b 1 ω sin ( ω τ ) ,   a 1 ω = b 1 ω cos ( ω τ ) − b 0 sin ( ω τ ) ,
and leading to a quartic equation for ω :
ω 4 + ( a 1 2 − b 1 2 − 2 a 0 ) ω 2 + ( a 0 2 − b 0 2 ) = 0 .
Now observe that if we substitute z = − ω 2 into (77) then we obtain Equation (80). Consequently, solutions of (80) satisfy ω 2 = − z ± , where z ± are as in (78). Thus, we can find a positive solution of (80) if and only if z + < 0 or z − < 0 .
Here we classify the existence of these positive solutions in terms of det ( G ) and tr ( G ) as given in (76). Let m be the number of positive solutions of (80). Then
  • m = 0 iff det ( G ) > 0 and tr ( G ) > − 2 det ( G ) or det ( G ) = 0 and tr ( G ) ≥ 0 ;
  • m = 1 iff det ( G ) < 0 or det ( G ) = 0 and tr ( G ) < 0 or det ( G ) > 0 and tr ( G ) = − 2 det ( G ) ;
  • m = 2 iff det ( G ) > 0 and tr ( G ) < − 2 det ( G ) .
Note that det ( G ) > 0 iff | a 0 | > | b 0 | .
Recall that we assume a 0 > b 0 . Then α 0 < 0 if and only if one of the following holds (see [39,40,41,42]):
1.
a 1 > b 1 , m = 0 and τ ≥ 0 ;
2.
a 1 > b 1 , m = 1 and τ ∈ [ 0 , τ 0 + ) for some τ 0 + > 0 ;
3.
a 1 > b 1 , m = 2 and
τ ∈ [ 0 , τ 0 + ) ∪ ⋃ j = 1 k ( τ j − 1 − , τ j + ) ,
for some k and a sequence of delays τ j ± ;
4.
a 1 ≤ b 1 , m = 2 and
τ ∈ ⋃ j = 0 k ( τ j − , τ j + ) .

4.4.3. Formulas for Variances

We need to find the inverse of the matrix H : = G 1 + G 2 C ( τ ) + G 3 G S ( τ ) and the second column of the matrix I + G 2 S ( τ ) + G 3 C ( τ ) . To this end, observe that
G 1 + G 2 C ( τ ) + G 3 G S ( τ ) = G 1 + c 0 ( τ ) G 2 + c 1 ( τ ) G 2 G + s 0 ( τ ) G 3 G + s 1 ( τ ) G 3 G 2 ,
where c i = c i ( τ ) , s i = s i ( τ ) , i = 0 , 1 are from (79) and the matrices G 1 , G 2 , G 3 are as in (73). We have
G 2 G = − b 0 0 0 b 1 0 − 1 det ( G ) tr ( G ) = 0 b 0 b 1 det ( G ) b 1 tr ( G )
and
G 3 G = b 1 0 − b 0 0 G = 0 − b 1 0 b 0 ,   G 3 G 2 = − b 1 det ( G ) − b 1 tr ( G ) b 0 det ( G ) b 0 tr ( G ) ,
implying that the elements of the matrix G 1 + G 2 C ( τ ) + G 3 G S ( τ ) = ( h i j ( t ) ) i , j = 1 , 2 are given by
h 11 = a 0 − b 0 c 0 − b 1 det ( G ) s 1 ,   h 12 = − 1 + b 0 c 1 − b 1 q 1 , h 21 = det ( G ) [ b 1 c 1 + b 0 s 1 ] ,   h 22 = a 1 + b 1 q 0 + b 0 q 1 ,
where
q 0 = c 0 + tr ( G ) c 1 ,   q 1 = s 0 + tr ( G ) s 1 .
The determinant of H is
det ( H ) = ( a 0 − b 0 c 0 − b 1 det ( G ) s 1 ) ( a 1 + b 1 q 0 + b 0 q 1 ) − det ( G ) ( b 1 c 1 + b 0 s 1 ) ( − 1 + b 0 c 1 − b 1 q 1 )
which reduces to
det ( H ) = a 0 a 1 + a 0 ( b 1 q 0 + b 0 q 1 ) − a 1 ( b 0 c 0 + b 1 det ( G ) s 1 ) + det ( G ) ( b 0 s 1 + b 1 c 1 ) − ( b 0 c 0 + b 1 det ( G ) s 1 ) ( b 1 q 0 + b 0 q 1 ) − det ( G ) ( b 1 c 1 + b 0 s 1 ) ( b 0 c 1 − b 1 q 1 ) .
Next, we find the vector
h 1 h 2 = ( I + G 2 S ( τ ) + G 3 C ( τ ) ) 0 1 .
We have
I + G 2 S ( τ ) + G 3 C ( τ ) = I + s 0 G 2 + s 1 G 2 G + c 0 G 3 + c 1 G 3 G = 1 − b 0 s 0 + b 1 c 0 s 1 b 0 − b 1 c 1 b 1 det ( G ) s 1 − b 0 c 0 1 + b 1 s 0 + b 1 tr ( G ) s 1 + b 0 c 0
implying that
h 1 = b 0 s 1 − b 1 c 1 ,   h 2 = 1 + b 0 c 0 + b 1 q 1 .
Consequently, the diagonal matrix K ( 0 ) has on its diagonal by (74) the following values
k 11 ( 0 ) = σ 2 2 det ( H ) [ h 22 h 1 − h 12 h 2 ] ,   k 22 ( 0 ) = σ 2 2 det ( H ) [ h 11 h 2 − h 21 h 1 ] ,
where det ( H ) is as in (83), h i j as in (81) with q i in (82), and h i as in (84). We have
h 22 h 1 − h 12 h 2 = ( a 1 + b 1 q 0 + b 0 q 1 ) ( b 0 s 1 − b 1 c 1 ) − ( − 1 + b 0 c 1 − b 1 q 1 ) ( 1 + b 0 c 0 + b 1 q 1 ) = 1 + a 1 ( b 0 s 1 − b 1 c 1 ) + b 0 ( c 0 − c 1 ) + b 0 b 1 ( c 0 q 1 − q 0 s 1 ) + b 1 2 q 0 c 1 + b 0 2 q 1 s 1 − b 1 1 q 1 2
and
h 11 h 2 − h 21 h 1 = ( a 0 − b 0 c 0 − b 1 det ( G ) s 1 ) ( 1 + b 0 c 0 + b 1 q 1 ) − det ( G ) ( b 1 c 1 + b 0 s 1 ) ( b 0 s 1 − b 1 c 1 ) .
Note that if τ = 0 , b 0 = 0 , b 1 = 0 , then we have det ( H ) = a 0 a 1 and
k 11 ( 0 ) = σ 2 2 a 0 a 1 ,   k 22 ( 0 ) = σ 2 2 a 1 ,
that are the variances of the stationary solution of the noisy harmonic oscillator from Section 3.2 with β = a 0 and γ = a 1 .

4.5. Is There a Fokker–Planck-like Equation for Differential Delay Equations?

We start with a few preliminaries with the ultimate goal of deriving a Fokker–Planck-like equation for the evolution of a ‘density’ under the action of noisy, delayed dynamics. The process { x t } t ≥ 0 as in (27) defines a transition semigroup { T t } t ≥ 0 by
T t ψ ( ϕ ) = E ( ψ ( x t ) | x 0 = ϕ ) ,   t ≥ 0 , ϕ ∈ C , ψ ∈ B ( C ) ,
on the space B ( C ) of bounded Borel measurable functions ψ : C → R . For each t ≥ 0 we define the Borel probability measure μ t on the space C as the distribution of x t , so that
⟨ ψ , μ t ⟩ = ⟨ T t ψ , μ 0 ⟩ ,   t ≥ 0 , ψ ∈ B ( C ) ,
where we use the customary scalar product notation
⟨ ψ , μ ⟩ = ∫ C ψ ( ϕ ) μ ( d ϕ ) .
Then { μ t } t ≥ 0 is said to solve the equation
∂ ∂ t μ t = L * μ t ,
where L * is a formal adjoint of the so-called extended generator L of the Markov process. The linear operator L : D → B ( C ) with domain D ⊂ B ( C ) is such that
∫ 0 t ⟨ | L ψ | , μ r ⟩ d r < ∞
and
⟨ ψ , μ t ⟩ = ⟨ ψ , μ 0 ⟩ + ∫ 0 t ⟨ L ψ , μ r ⟩ d r
for all t > 0 and ψ ∈ D .
Now, instead of dealing with the abstract Equation (86) we proceed as in [3,4,43]. We introduce a differential operator L : C c 2 ( R d ) → B ( C ) defined by
L g ( ϕ ) = ∑ i = 1 d F i ( ϕ ) ∂ g ∂ x i ( ϕ ( 0 ) ) + 1 2 ∑ i , j = 1 d ( Σ Σ T ) i j ( ϕ ) ∂ 2 g ∂ x i ∂ x j ( ϕ ( 0 ) ) ,   ϕ ∈ C ,
for g ∈ C c 2 ( R d ) , where C c 2 ( R d ) is the space of functions with compact support that possess continuous derivatives up to second order. Here, [ ( Σ Σ T ) i j ] i , j = 1 , … , d is the matrix Σ Σ T , where Σ T is the transpose of the matrix Σ . Consider the distribution μ ( t ) of x ( t ) = x t ( 0 ) , t ≥ 0 , defined on B ( R d ) , the σ -algebra of Borel subsets of R d , by
μ ( t ) ( B ) = μ t { ϕ ∈ C : ϕ ( 0 ) ∈ B } ,   B ∈ B ( R d ) .
Then { μ t } t ≥ 0 is said to solve the equation
∂ ∂ t μ ( t ) = L * μ t
if
∫ 0 t ⟨ | L g | , μ r ⟩ d r < ∞
and
∫ R d g ( x ) μ ( t ) ( d x ) = ∫ R d g ( x ) μ ( 0 ) ( d x ) + ∫ 0 t ⟨ L g , μ r ⟩ d r
for all t > 0 and g ∈ C c 2 ( R d ) . Note that we can represent the Borel measure μ ( t ) as μ ( t ) = μ t ∘ π 0 − 1 , where the projection map π 0 : C → R d is given by π 0 ( ϕ ) = ϕ ( 0 ) , ϕ ∈ C . Thus, Equation (87) can be compared with (86) as it can be rewritten as
∂ ∂ t μ t ∘ π 0 − 1 = L * μ t .
Suppose that the drift coefficient F and the diffusion coefficient Σ in (26) are those with discrete delays
F ( ϕ ) = F ( ϕ ( τ 0 ) , … , ϕ ( τ k ) ) ,   Σ ( ϕ ) = σ ( ϕ ( τ 0 ) , … , ϕ ( τ k ) ) ,
where k ∈ N , F and σ are given transformations on R d ( k + 1 ) and
0 = τ 0 < … < τ k = τ .
We introduce the projection mapping π τ 0 , … , τ k : C → R d ( k + 1 )
π τ 0 , … , τ k ( ϕ ) = ( ϕ ( − τ 0 ) , … , ϕ ( − τ k ) ) ,   ϕ ∈ C ,
and the measure
ν ( t ) ( B ) = μ t ∘ π τ 0 , … , τ k − 1 ( B ) = μ t { ϕ ∈ C : π τ 0 , … , τ k ( ϕ ) ∈ B } ,   t ≥ 0 , B ∈ B ( R d ( k + 1 ) ) .
Observe that ν ( t ) is the distribution of ( x ( t − τ 0 ) , … , x ( t − τ k ) ) . By using the change-of-variables formula we obtain
⟨ L g , μ t ⟩ = ∫ R d ∫ R d k ∑ i = 1 d F i ( x , y ) ∂ g ∂ x i ( x ) + 1 2 ∑ i , j = 1 d a i j ( x , y ) ∂ 2 g ∂ x i ∂ x j ( x ) ν ( t ) ( d x , y ) ,
where a i j = ( σ σ T ) i j . Next, if f ν is the density of the measure ν ( t ) , assuming that it exists, with respect to the Lebesgue measure on R d ( 1 + k ) , i.e., ν ( t ) ( d x , d y ) = f ν ( x , y , t ) d x d y , then f, the density of x ( t ) , exists and it is the marginal density obtained from f ν by
f ( x , t ) = ∫ R d k f ν ( x , y , t ) d y .
Consequently, Equation (88) rewritten as
  ∫ R d g ( x ) f ( x , t ) d x = ∫ R d g ( x ) f ( x , 0 ) d x   + ∫ 0 t ∫ R d ∫ R d k ∑ i = 1 d F i ( x , y ) ∂ g ∂ x i ( x ) + 1 2 ∑ i , j = 1 d a i j ( x , y ) ∂ 2 g ∂ x i ∂ x j ( x ) f ν ( x , y , r ) d x d y d r ,
is the weak form of the Fokker–Planck-type evolution equation
∂ ∂ t f ( x , t ) = − ∑ i = 1 d ∂ ∂ x i ∫ R d k F i ( x , y ) f ν ( x , y , t ) d y + 1 2 ∑ i , j = 1 d ∂ 2 ∂ x i ∂ x j ∫ R d a i j ( x , y ) f ν ( x , y , t ) d y .
This is the central and desired result of this rather long and technical section.

5. Conclusions

It is clear from the above considerations that the dynamic origin of the (weak or strong) second law of thermodynamics is far from obvious. If the dynamics are given by typical (time-reversal-invariant) ordinary differential equations the behaviour of the Gibbs entropy is unclear (8) while in the same circumstance the conditional entropy is constant (10). The presence of noise does not alter the indeterminate behaviour of the Gibbs entropy but does induce a monotonic approach of the conditional entropy to its equilibrium value of zero (9).
The inclusion of temporal delays in the dynamics does not clarify things, but does increase the computational complexity of the situation. The Gibbs entropy might be monotone increasing (46) (strong form of the second law), whereas the conditional entropy may display a non-monotone approach (44) to equilibrium (47) (weak form of the second law).
We have emphasized the somewhat primitive state of the development of the underlying theory of the evolution of densities in infinite dimensional (delayed) dynamical systems, and why correction of this must necessarily precede a satisfactory understanding of the effects of delayed dynamics on entropy behaviours. There is much to be done!

Why Bother?

One might wonder, given all of the technical problems involved in the treatment of density evolution in delayed systems, why is one bothering? The reason is straightforward. Biological processes are rife with delays modifying the dynamics, and models in many fields of the biological sciences contain significant delays at a variety of levels, e.g., ranging from gene regulation [44,45], through immunology [46], up to the cellular–clinical treatment level [47,48,49,50]. If we are ever to build a successful non-equilibrium thermodynamics for biological processes it will be essential to solve the problems pointed out in this study.

Author Contributions

M.C.M.: conceptualization, methodology, writing and editing of the manuscript. M.T.-K.: conceptualization, methodology, writing and editing of the manuscript. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Mackey, M.; Tyran-Kamińska, M. Noise and conditional entropy evolution. Physica A 2006, 365, 360–382. [Google Scholar] [CrossRef] [Scilit]
  2. Mackey, M.; Tyran-Kamińska, M. Temporal behavior of the conditional and Gibbs’ entropies. J. Stat. Phys. 2006, 124, 1443–1470. [Google Scholar] [CrossRef] [Scilit]
  3. Mackey, M.; Tyran-Kaminska, M. Temporal entropy evolution in stochastic and delayed dynamics. BioPhysMath 2024, 3, 1–38. [Google Scholar] [CrossRef] [Scilit]
  4. Mackey, M.; Tyran-Kamińska, M. How can we describe density evolution under delayed dynamics? Chaos 2021, 31, 043114. [Google Scholar] [CrossRef] [Scilit]
  5. Gibbs, J. Elementary Principles in Statistical Mechanics; Dover: New York, NY, USA, 1962. [Google Scholar]
  6. Ruelle, D. Positivity of entropy production in nonequilibrium statistical mechanics. J. Stat. Phys. 1996, 85, 1–23. [Google Scholar] [CrossRef] [Scilit]
  7. Ruelle, D. Extending the definition of entropy to nonequilibrium steady states. Proc. Nat. Acad. Sci. USA 2003, 100, 3054–3058. [Google Scholar] [CrossRef] [Scilit]
  8. Nicolis, G.; Daems, D. Probabilistic and thermodynamic aspects of dynamical systems. Chaos 1998, 8, 311–320. [Google Scholar] [CrossRef] [Scilit]
  9. Lasota, A.; Mackey, M.C. Chaos, Fractals and Noise: Stochastic Aspects of Dynamics; Springer: Berlin/Heidelberg, Germany; New York, NY, USA, 1994. [Google Scholar]
  10. Csiszár, I. I-divergence geometry of probability distributions and minimization problems. Ann. Probab. 1975, 3, 146–158. [Google Scholar] [CrossRef] [Scilit]
  11. Boltzmann, L. Weitere Studien über das Wärmegleichgewicht unter Gasmolekülen. Sitzungsberichte Kais. Akad. Wiss. Math.-Naturwissenschaftliche Cl. Abt. II 1872, 66, 275–370. [Google Scholar]
  12. Uffink, J. Boltzmann’s Work in Statistical Physics. In The Stanford Encyclopedia of Philosophy; Zalta, E., Ed.; Metaphysics Research Lab, Stanford University: Stanford, CA, USA, 2022. [Google Scholar]
  13. Jaynes, E.T. Gibbs vs. Boltzmann entropies. Am. J. Phys. 1965, 33, 391–398. [Google Scholar] [CrossRef] [Scilit]
  14. Jaynes, E. Violation of Boltzmann’s H theorem in real gases. Phys. Rev. A 1971, 4, 747. [Google Scholar] [CrossRef] [Scilit]
  15. Uffink, J. Compendium of the Foundations of Classical Statistical Physics. 2006. Available online: https://philsci-archive.pitt.edu/2691/1/UffinkFinal.pdf (accessed on 10 April 2026).
  16. Eddington, A. New Pathways in Science: Messenger Lectures; Cambridge University Press: Cambridge, UK, 1934. [Google Scholar]
  17. Gardiner, C. Handbook of Stochastic Methods; Springer: Berlin/Heidelberg, Germany, 1983. [Google Scholar]
  18. Risken, H. The Fokker-Planck Equation; Springer: Berlin/Heidelberg, Germany; New York, NY, USA, 1984. [Google Scholar]
  19. Van Kampen, N. Stochastic Processes in Physics and Chemistry; Elsevier: Amsterdam, The Netherlands, 1992; Volume 1. [Google Scholar]
  20. Daems, D.; Nicolis, G. Entropy production and phase space volume contraction. Phys. Rev. E 1999, 59, 4000–4006. [Google Scholar] [CrossRef] [Scilit]
  21. Zakai, M.; Snyders, J. Stationary probability measures for linear differential equations driven by white noise. J. Differ. Equ. 1970, 8, 27–33. [Google Scholar] [CrossRef] [Scilit]
  22. Erickson, R. Constant coefficient linear differential equations driven by white noise. Ann. Math. Stat. 1971, 42, 820–823. [Google Scholar] [CrossRef] [Scilit]
  23. Losson, J.; Mackey, M.C.; Taylor, R.; Tyran-Kamińska, M. Density Evolution Under Delayed Dynamics: An Open Problem; Fields Institute Monographs; Springer: New York, NY, USA, 2020; Volume 38. [Google Scholar]
  24. Loos, S. Stochastic Systems with Time Delay: Probabilistic and Thermodynamic Descriptions of Non-Markovian Processes Far from Equilibrium; Springer Nature: Berlin/Heidelberg, Germany, 2021. [Google Scholar]
  25. Guillouzic, S.; L’Heureux, I.; Longtin, A. Small delay approximation of stochastic delay differential equations. Phys. Rev. E 1999, 59, 3970–3982. [Google Scholar] [CrossRef] [Scilit]
  26. Guillouzic, S.; L’Heureux, I.; Longtin, A. Rate processes in a delayed, stochastically driven, and overdamped system. Phys. Rev. E 2000, 61, 4906–4914. [Google Scholar] [CrossRef] [Scilit]
  27. Frank, T. Multivariate Markov processes for stochastic systems with delays: Application to the stochastic Gompertz model with delay. Phys. Rev. E 2002, 66, 011914-1–011914-8. [Google Scholar] [CrossRef] [Scilit]
  28. Frank, T.; Beek, P.; Friedrich, R. Fokker-Planck perspective on stochastic delay systems: Exact solutions and data analysis of biological systems. Phys. Rev. E 2003, 68, 021912. [Google Scholar] [CrossRef] [Scilit]
  29. Patanarapeelert, K.; Frank, T.; Friedrich, R.; Beek, P.; Tang, I. Theoretical analysis of destabilization resonances in time-delayed stochastic second-order dynamical systems and some implications for human motor control. Phys. Rev. E 2006, 73, 021901. [Google Scholar] [CrossRef] [Scilit]
  30. Holubec, V.; Ryabov, A.; Loos, S.; Kroy, K. Equilibrium stochastic delay processes. New J. Phys. 2022, 24, 023021. [Google Scholar] [CrossRef] [Scilit]
  31. Rosinberg, M.; Munakata, T.; Tarjus, G. Stochastic thermodynamics of Langevin systems under time-delayed feedback control: Second-law-like inequalities. Phys. Rev. E 2015, 91, 042114. [Google Scholar] [CrossRef] [Scilit]
  32. Rosinberg, M.; Tarjus, G.; Munakata, T. Fluctuations of dynamical observables in linear diffusions with time delay: A Riccati-based approach. Phys. Rev. E 2025, 111, 064101. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  33. Hale, J.; Lunel, S.V. Introduction to Functional Differential Equations; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2013; Volume 99. [Google Scholar]
  34. Kolmanovskii, V.; Myshkis, A. Introduction to the Theory and Applications of Functional Differential Equations; Springer: Berlin/Heidelberg, Germany, 1999; Volume 463. [Google Scholar]
  35. Mohammed, S.E.A. Stochastic Functional Differential Equations; Pitman: Boston, MA, USA, 1984. [Google Scholar]
  36. Küchler, U.; Mensch, B. Langevin’s stochastic differential equation extended by a time-delayed term. Stochastics Stochastics Rep. 1992, 40, 23–42. [Google Scholar] [CrossRef] [Scilit]
  37. Hayes, N. Roots of the transcendental equation associated with a certain difference-differential equation. J. Lond. Math. Soc. 1950, 1, 226–232. [Google Scholar] [CrossRef] [Scilit]
  38. Mackey, M.; Nechaeva, I. Solution moment stability in stochastic differential delay equations. Phys. Rev. E 1995, 52, 3366. [Google Scholar] [CrossRef] [Scilit]
  39. Cooke, K.; Grossman, Z. Discrete delay, distributed delay and stability switches. J. Math. Anal. Appl. 1982, 86, 592–627. [Google Scholar] [CrossRef] [Scilit]
  40. Campbell, S. Stability and bifurcation in the harmonic oscillator with multiple delayed feedback loops. Dyn. Contin. Discret. Impuls. Syst. 1999, 5, 225–235. [Google Scholar]
  41. Ruan, S. Absolute stability, conditional stability and bifurcation in Kolmogorov-type predator-prey systems with discrete delays. Q. Appl. Math. 2001, 59, 159–173. [Google Scholar] [CrossRef] [Scilit]
  42. Malakhovski, E.; Mirkin, L. On stability of second-order quasi-polynomials with a single delay. Automatica 2006, 42, 1041–1047. [Google Scholar] [CrossRef] [Scilit]
  43. Huang, X.; Röckner, M.; Wang, F.Y. Nonlinear Fokker-Planck equations for probability measures on path space and path-distribution dependent SDEs. Discret. Contin. Dyn. Syst. 2019, 39, 3017–3035. [Google Scholar] [CrossRef] [Scilit]
  44. Falfus, M.; Mackey, M.C.; Tyran-Kamińska, M. The combined effects of Feller diffusion and transcriptional/translational bursting in simple gene networks. J. Math. Anal. Appl. 2019, 470, 931–953. [Google Scholar] [CrossRef] [Scilit]
  45. Gedeon, T.; Humphries, A.R.; Mackey, M.C.; Walther, H.O.; Wang, Z. Operon dynamics with state dependent transcription and/or translation delays. J. Math. Biol. 2022, 84, 2. [Google Scholar] [CrossRef] [Scilit]
  46. Li, Z.; Liu, J.; Zhou, L.; Shan, C.; Fan, M. Model formulation and oscillatory patterns in immune-pathogen dynamics during Brucellosis infection. Math. Biosci. 2025, 390, 109543. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  47. Brunetti, M.; Mackey, M.C.; Craig, M. Understanding normal and pathological hematopoietic stem cell biology using mathematical modelling. Curr. Stem Cell Rep. 2021, 7, 109–120. [Google Scholar] [CrossRef] [Scilit]
  48. Cassidy, T.; Humphries, A.R.; Craig, M.; Mackey, M.C. Characterizing chemotherapy-induced neutropenia and monocytopenia through mathematical modelling. Bull. Math. Biol. 2020, 82, 104. [Google Scholar] [CrossRef] [Scilit]
  49. Mackey, M.C.; Glisovic, S.; Leclerc, J.M.; Pastore, Y.; Krajinovic, M.; Craig, M. The timing of cyclic cytotoxic chemotherapy can worsen neutropenia and neutrophilia. Br. J. Clin. Pharmacol. 2021, 87, 687–693. [Google Scholar] [CrossRef] [Scilit]
  50. Mackey, M.C. Periodic hematological disorders: Quintessential examples of dynamical diseases. Chaos 2020, 30, 063123. [Google Scholar] [CrossRef] [Scilit] [PubMed]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.