Next Article in Journal
Branching Random Walks with Ageing
Previous Article in Journal
Positive Solutions for Nabla Fractional Three-Point Boundary Value Problems
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Truncated EM Method of Jump Diffusions with Markovian Switching: A Case Study of Music Signals

1
School of Music, Xinyang University, Xinyang 464000, China
2
School of Mathematics Science, Shanxi Normal University, Taiyuan 030031, China
3
School of Mathematics and Statistics, Beijing Institute of Technology, Beijing 100081, China
4
School of Computer Science and Technology, Zhejiang University of Water Resources and Electric Power, Hangzhou 310018, China
*
Author to whom correspondence should be addressed.
Mathematics 2026, 14(6), 1087; https://doi.org/10.3390/math14061087
Submission received: 22 January 2026 / Revised: 26 February 2026 / Accepted: 27 February 2026 / Published: 23 March 2026
(This article belongs to the Section D1: Probability and Statistics)

Abstract

This paper investigates the strong convergence of jump-diffusion processes with Markovian switching using the truncated Euler–Maruyama (TEM) method. Under the assumption that the drift and diffusion coefficients satisfy a Khasminskii-type condition and the jump coefficient meets a linear growth condition, we derive the convergence rate. Furthermore, we demonstrate that the TEM method effectively preserves both the mean square stability and the asymptotic boundedness of the underlying jump-diffusion process. A case study involving music signals is provided to illustrate the theoretical findings.

1. Introduction

Stochastic hybrid systems are widely employed to model systems subject to frequent and unpredictable structural changes, such as flexible manufacturing systems, air traffic management, power grids, mathematical finance, and risk management. A typical stochastic hybrid system is characterized by a hybrid state space: one component takes continuous values in a Euclidean space, while the other takes discrete values. Due to this structure, such systems have found diverse applications across numerous disciplines. For further details, we refer to [1,2,3,4].
An important class of stochastic hybrid systems is the following jump-diffusion model with Markovian switching:
X ( t ) = x 0 + 0 t b ( X ( s ) , Λ ( s ) ) d s + 0 t σ ( X ( s ) , Λ ( s ) ) d B ( s ) + 0 t R d { 0 } c ( X ( s ) , Λ ( s ) , u ) N ( d s , d u ) ,
where Λ ( t ) is a continuous-time Markov chain representing the environmental state or system mode. Such processes are increasingly used to model stochastic systems subject to random impulses and frequent regime switches, typically captured by a Markov chain. A typical application of (1) arises in risk theory within insurance and finance, where X ( t ) represents a surplus process in a Markov-modulated market. Applications have also been documented in a broad spectrum of fields, including option pricing [5] and flexible manufacturing systems [6].
Given that many problems involving diffusions with Markovian switching and Lévy jumps cannot be solved explicitly, obtaining approximate solutions—either in explicit form or in a form amenable to numerical computation—is of significant theoretical and practical importance. Although numerical methods for stochastic differential equations (SDEs) have been extensively studied (see, e.g., [7,8,9,10]), considerably less attention has been devoted to numerical schemes for diffusion or jump-diffusion processes with Markovian switching. In this context, Yuan and Mao [11] were the first to investigate numerical solutions for SDEs with Markovian switching. Subsequently, Ye and Li [12] studied numerical methods for a class of jump diffusions with Markovian switching, establishing the convergence of the Euler–Maruyama (EM) numerical solutions to the exact solutions and providing an error estimate. More recently, Yin, Song, and Zhang [13] proposed a numerical algorithm for such systems and proved its convergence via a martingale problem formulation.
In this paper, we propose a jump-adapted numerical scheme for system (1) based on the truncated Euler method. Unlike the methods in [13] and [12], which employ a constant step size, our algorithm incorporates a sequence of jump times generated by a Poisson random measure. Another key distinction concerns the mode of convergence: whereas [13] established weak convergence, we prove strong convergence of the scheme. Moreover, inspired by the techniques in [12], we also investigate the order of strong convergence.
The remainder of the paper is structured as follows: Section 2 briefly reviews the existence and uniqueness of solutions to Equation (1) and describes the modified Euler-type algorithm for numerical solutions. Section 3 establishes the L p ( p 2 ) convergence of the numerical solution under this algorithm and derives the corresponding error order. Section 4 provides a numerical example to evaluate the performance of the algorithm introduced in Section 3.

2. The Truncated EM Method

Let ( Ω , F , P ) be a probability space. Let { F t } t 0 be an increasing family of sub- σ -algebras of F and B ( t ) an F t -adapted R d -valued Brownian motion and also a martingale with respect to { F t } . Let ( X ( t ) , Λ ( t ) ) be a strong Markov process on R d × S with left-hand limits and right-continuous, where S : = { 1 , 2 , , m } , m < . The first component X ( t ) satisfies the following stochastic differential–integral equation:
X ( t ) = x 0 + 0 t b ( X ( s ) , Λ ( s ) ) d s + 0 t σ ( X ( s ) , Λ ( s ) ) d B ( s ) + 0 t R d { 0 } c ( X ( s ) , Λ ( s ) , u ) N ( d s , d u ) ,
where σ ( x , i ) is R d × d -matrix valued, b ( x , i ) and c ( x , i , u ) are R d -valued for x R d , u R d { 0 } and i S . Let N ( d t , d u ) (corresponding to a random point function p ( t ) ) be a stationary F t -Poisson point process independent of B ( t ) , and let N ˜ ( d t , d u ) = N ( d t , d u ) Π ( d u ) d t be the compensated Poisson random measure on [ 0 , ) × R d , where Π ( · ) is a deterministic characteristic measure on the measurable space ( R d { 0 } , B ( R d { 0 } ) ) , and 1 u 2 Π ( d u ) < . The second component Λ ( t ) , which is F t -adapted and independent of B ( t ) and N ( t , A ) , is a right-continuous irreducible Markov chain with finite state space S and Q-matrix Q = ( q i j ) i , j S such that
P { Λ ( t + Δ ) = j Λ ( t ) = i } = q i j Δ + o ( Δ ) if j i , 1 + q i i Δ + o ( Δ ) if j = i ,
provided that Δ 0 (cf. [14]). For x R d and σ = ( σ i j ) R d × d , define | x | = k = 1 d | x k | 2 1 / 2 , | σ | = i , j = 1 d | σ i j | 2 1 / 2 . For the existence and uniqueness of the strong Markov process ( X ( t ) , Λ ( t ) ) satisfying (2) and (3), we make the following assumptions.
Assumption 1. 
Assume that the coefficients b and σ satisfy the local Lipschitz condition: for any R > 0 there exists a constant L R > 0 such that
| b ( x , i ) b ( y , i ) | 2 + | σ ( x , i ) σ ( y , i ) | 2 + R d { 0 } | c ( x , i , u ) c ( y , i , u ) | 2 Π ( d u ) L R | x y | 2 .
For all ( i , x , y , u ) S × R d × R d × R d { 0 } with | x | | y | R .
Assumption 2. 
(Khasminskii-type condition) There exist constant L 2 > 0 , p 2 such that
x T b ( x , i ) + p 1 2 | σ ( x , i ) | 2 L 2 ( 1 + | x | 2 ) , x R d .
We state a known result (see, e.g., [15]) as a lemma for later use.
Lemma 1. 
Under Assumptions 1 and 2, SDEs (2) and (3) have a unique global solution X ( t ) . Moreover, for any p 2
sup 0 t T E | X ( t ) | p < , T > 0 .
In the remainder of this section, we will show that the strong Markov process ( X ( t ) , Λ ( t ) ) can be associated with an appropriate generator. In what follows, let ( · , · ) and ∇ denote the inner product and the gradient operator in R d , respectively. If A is a vector or matrix, A T denotes its transpose. For x R d , i S , set a ( x , i ) = σ ( x , i ) σ ( x , i ) T . Let C c 2 ( R d × S ) denote the family of all functions V ( x , i ) on R d × S that are twice continuously differentiable in x and have compact support. For V ( x , i ) C c 2 ( R d × S ) , define an operator A as follows:
A V ( x , i ) = L V ( x , i ) + Ω ˜ V ( x , i ) + Q V ( x , i ) .
Here the operators L, Ω ˜ and Q are further defined by:
L V ( x , i ) = 1 2 k , l = 1 d a k l ( x , i ) 2 x k x l V ( x , i ) + b ( x , i ) , x V ( x , i ) ,
Ω ˜ V ( x , i ) = R d { 0 } [ V ( x + c ( x , i , u ) , i ) V ( x , i ) ] Π ( d u ) ,
Q V ( x , i ) = j i q i j ( V ( x , j ) V ( x , i ) ) .
The essence of the truncated method lies in addressing super-linear coefficients. From the standpoint of finite-time convergence, linear coefficients do not pose difficulties for the EM scheme and therefore do not need to be truncated [16]. In our TEM method, we focus exclusively on truncating the super-linear terms, specifically the coefficients b and σ .
To construct the TEM scheme, we first choose a strictly increasing function f : R + R + satisfying f ( n ) , as n , and
sup | x | n , i S | b ( x , i ) | | σ ( x , i ) | f ( n ) , n 1 .
We denote by f 1 the inverse function of f. We observe that f 1 is a strictly increasing continuous function mapping from [ f ( 0 ) , ) to R + . We also choose a strictly decreasing function g : ( 0 , 1 ) ( 0 , ) and a number Δ * ( 0 , 1 ] such that
g ( Δ * ) f ( 2 ) , lim Δ 0 g ( Δ ) = and ( g ( Δ ) ) p Δ 1 Δ p / 4 , Δ ( 0 , 1 ] , p 2 .
For a given step size Δ ( 0 , 1 ) , we define a mapping π Δ from R d to the closed ball { x R d : | x | f 1 ( g ( Δ ) ) } by
π Δ ( x ) = | x | f 1 ( g ( Δ ) ) x | x | .
For a given step size Δ ( 0 , 1 ) , we define the truncated functions
b Δ ( x , i ) = b ( | x | f 1 ( g ( Δ ) ) ) x | x | , i and σ Δ ( x , i ) = σ ( | x | f 1 ( g ( Δ ) ) ) x | x | , i
for x R d , i S , where we set x | x | = 0 when x = 0 . It is easy to see that
| b Δ ( x , i ) | | σ Δ ( x , i ) | f ( f 1 ( g ( Δ ) ) ) = g ( Δ ) x R d , i S .
That is, the truncated functions b Δ and σ Δ remain bounded, even when the original coefficients b and σ are unbounded. Furthermore, for all Δ ( 0 , Δ * ] , where Δ * is given in (6), these truncated terms continue to satisfy a Khasminskii-type condition, as stated in the following lemma (see [16]).
Lemma 2. 
Let Assumption 2 hold. Then, for all Δ ( 0 , Δ * ] , there exist constant p > 2 , L 4 > 0 such that
x T b Δ ( x , i ) + p 1 2 | σ Δ ( x , i ) | 2 2 L 4 ( 1 + | x | 2 ) , x R d , i S .
Since N ( d t , d u ) and Λ ( t ) are independent, for given partition { t k } k 1 , { Λ ( t k ) , k = 1 , 2 , } is a discrete Markov chain with transition probability matrix ( P ( i , j ) ) i , j S , where P ( i , j ) = P ( Λ ( t k + 1 ) = j | Λ ( t k ) = i ) is the ( i , j ) -th entry of the matrix e ( t k + 1 t k ) Q . Thus we can simulate the discrete Markov chain { Λ ( t k ) } k 1 using the following recursion: Suppose that Λ ( t k ) = i 1 , and generate a random number ξ uniformly distributed in [ 0 , 1 ] . Define the next state as:
Λ ( t k + 1 ) = i 2 , if i 2 S { m } and j = 1 i 2 1 P ( i 1 , j ) ξ < j = 1 i 2 P ( i 1 , j ) , m , if j = 1 m 1 P ( i 1 , j ) ξ .
By repeating this procedure, a trajectory of { Λ ( t k ) } k 1 can be simulated.
We can now form the discrete-time TEM numerical approximations X Δ ( t k ) X ( t k ) for t k = k Δ by setting X Δ ( 0 ) = x 0 and computing
X Δ ( t k + 1 ) = X Δ ( t k ) + b Δ ( X Δ ( t k ) , Λ Δ ( t k ) ) Δ + σ Δ ( X Δ ( t k ) , Λ Δ ( t k ) ) Δ B k + j S c ( X Δ ( t k ) , Λ Δ ( t k ) , u j ) I { t k + 1 = τ j }
for k = 0 , 1 , , where Δ B k = B ( t k + 1 ) B ( t k ) . Here τ j = inf { t > 0 : N ( t , R d { 0 } ) j } are the jump times. Denote by N t = N ( t , T ) a homogeneous Poisson process with intensity λ = Π ( R d { 0 } ) . Clearly, τ ¯ j = τ j T , j = 1 , 2 , are also stopping times. Let us now form two versions of the continuous-time TEM solutions. The first one is defined by
X ¯ Δ ( t ) = k = 0 X Δ ( t k ) I [ t k , t k + 1 ) ( t ) , t 0 .
This is a simple step process, so its sample paths are not continuous. We refer to it as the continuous-time step-process TEM approximation. The other is defined by
X Δ ( t ) = x 0 + 0 t b Δ ( X ¯ Δ ( s ) , Λ Δ ( s ) ) d s + 0 t σ Δ ( X ¯ Δ ( s ) , Λ Δ ( s ) ) d B ( s ) + 0 t R d { 0 } c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) N ( d s , d u ) ,
for t 0 . We refer to this as the continuous-time continuous-sample TEM approximation. Observe that X Δ ( t k ) = X ¯ Δ ( t k ) for all k 0 .

3. Convergence of TEM Approximations

In this section, we present the convergence rate between the TEM approximation and the exact solution (for p 2 ). Additionally, we provide some lemmas required to prove the main results, with detailed proofs given separately for p = 2 and p > 2 .

3.1. Convergence in L 2

First, we state the following assumptions.
Assumption 3. 
For all ( x , i ) R d × S , there exists a constant L 2 > 0 such that
R d { 0 } | c ( x , i , u ) | 2 Π ( d u ) L 2 ( 1 + | x | 2 ) .
By (8), it is obvious that
sup 0 t T E | X Δ ( t ) | 2 < , T > 0 .
However, it is not obvious that
sup 0 < Δ Δ * sup 0 t T E | X Δ ( t ) | 2 < , T > 0 ,
and this is what we are going to establish in this subsection. Let us first present a lemma which shows that X Δ ( t ) and X ¯ Δ ( t ) are close to each other in the L 2 sense.
Lemma 3. 
For any Δ * given in (6) and Δ ( 0 , Δ * ] , we have
E | X Δ ( t ) X ¯ Δ ( t ) | 2 C Δ ( g ( Δ ) ) 2 , t 0 .
Consequently,
lim Δ 0 E | X Δ ( t ) X ¯ Δ ( t ) | 2 = 0 , t 0 .
Proof. 
Fix any Δ ( 0 , Δ * ] and t 0 . There is a unique integer k 0 such that t k t t k + 1 . Let V ( x , i ) = | x | 2 C 2 ( R d × S ) . For each i S , V ( · , i ) is continuous and nonnegative and tends to infinity as | x | . Using (8) and the properties of the Itô integral (see, e.g., [17]), we derive from (12) that
E | X Δ ( t ) X ¯ Δ ( t ) | 2 = E | X Δ ( t ) X Δ ( t k ) | 2 | x 0 | 2 + E t k t 2 | X Δ ( s ) X ¯ Δ ( s ) | | b Δ ( X ¯ Δ ( s ) , Λ Δ ( s ) ) | + | σ Δ ( X ¯ Δ ( s ) , Λ Δ ( s ) ) | 2 d s + E t k t R d { 0 } [ X Δ ( s ) + c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) 2 | X Δ ( s ) | 2 ] Π ( d u ) d s .
Denote the two integrals on the right-hand side by I 1 and I 2 respectively. Using (8), we bound I 1
I 1 = E t k t 2 | X Δ ( s ) X ¯ Δ ( s ) | | b Δ ( X ¯ Δ ( s ) , Λ Δ ( s ) ) | + | σ Δ ( X ¯ Δ ( s ) , Λ Δ ( s ) ) | 2 d s E t k t 2 | X Δ ( s ) X ¯ Δ ( s ) | ( g ( Δ ) + g 2 ( Δ ) ) d s C g 2 ( Δ ) E t k t 2 | X Δ ( s ) X ¯ Δ ( s ) | d s .
For I 2 , using Assumption 3 and the fact that X ¯ Δ ( s ) and X Δ ( s ) coincide at the grid points, we obtain
I 2 = E t k t R d { 0 } [ X Δ ( s ) + c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) 2 | X Δ ( s ) | 2 ] Π ( d u ) d s E t k t R d { 0 } | c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) | 2 + 2 | X Δ ( s ) | | c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) | Π ( d u ) d s E t k t ( 1 + | X ¯ Δ ( s ) | 2 d s C Δ .
Combining the estimates for I 1 and I 2 and applying Gronwall’s inequality, we obtain
E | X Δ ( t ) X ¯ Δ ( t ) | 2 C Δ ( g ( Δ ) ) 2 , t 0 ,
which completes the proof. □
Lemma 4. 
Let Assumptions 1 and 3 hold. Then
sup 0 < Δ Δ * sup 0 t T E | X Δ ( t ) | 2 C , T > 0 ,
where Δ * satisfies (6). Here and in the sequel, C denotes a generic positive constant dependent on T and x 0 but independent of Δ, and its value may change from line to line.
Proof. 
Fix any Δ ( 0 , Δ * ] and T 0 . Apply Itô’s formula to V ( x , i ) = | x | 2 . For 0 t T ,
E | X Δ ( t ) | 2 | x 0 | 2 + E 0 t 2 X Δ T ( s ) b Δ ( X ¯ Δ ( s ) , Λ Δ ( s ) ) + | σ Δ ( X ¯ Δ ( s ) , Λ Δ ( s ) ) | 2 d s + E t k t R d { 0 } X Δ ( s ) + c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) 2 | X Δ ( s ) | 2 Π ( d u ) d s = C | x 0 | 2 + I ¯ 1 + I ¯ 2 .
Using (8) and Lemma 2, I ¯ 1 can be bounded by C 0 t ( 1 + E | X Δ ( s ) | d s ) . For I ¯ 2 , using Assumption 3 as in (16) gives I ¯ 2 C Δ . Consequently,
E | X Δ ( t ) | 2 C 1 + C 2 0 t E | X Δ ( s ) | 2 d s .
Taking the supremum over t [ 0 , T ] and applying Gronwall’s inequality yields
sup 0 t T E | X Δ ( t ) | 2 C .
Since the constant C is independent of Δ , the required assertion (36) follows. □
Next, we present the first main result of this paper, namely, the convergence in L 2 between the TEM approximation X Δ ( T ) and the exact solution X ( T ) .
Theorem 1. 
Let Assumptions 1–3 hold. Then,
lim Δ 0 E | X Δ ( T ) X ( T ) | 2 = 0 a n d lim Δ 0 E | X ¯ Δ ( T ) X ( T ) | 2 = 0 .
Proof. 
For every 0 T T , by (2) and (12), we have
E sup 0 t T | X ( t ) X Δ ( t ) | 2 3 T E 0 T | b Δ ( X ¯ Δ ( s ) , Λ Δ ( s ) ) b ( X ( s ) , Λ ( s ) ) | 2 d s + 12 E 0 T | σ Δ ( X ¯ Δ ( s ) , Λ Δ ( s ) ) σ ( X ( s ) , Λ ( s ) ) | 2 d s + C ( T 2 + 1 ) E 0 T R d { 0 } c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) c ( X ( s ) , Λ ( s ) , u ) N ( d s , d u ) 2 .
We focus on the third term. Observing that N ˜ ( d t , d u ) = N ( d t , d u ) Π ( d u ) d t is the compensated Poisson random measure and the process
0 t R d { 0 } c ( X Δ ( s ) , Λ Δ ( s ) , u ) N ˜ ( d s , d u )
is a martingale (see [18]), we have
sup 0 t T E 0 t R d { 0 } c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) c ( X ( s ) , Λ ( s ) , u ) N ( d s , d u ) 2 E sup 0 t T 0 t R d { 0 } c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) c ( X ( s ) , Λ ( s ) , u ) N ( d s , d u ) 2 = E ( sup 0 t T | 0 t R d { 0 } c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) c ( X ( s ) , Λ ( s ) , u ) N ˜ ( d s , d u ) + 0 t R d { 0 } c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) c ( X ( s ) , Λ ( s ) , u ) Π ( d u ) d s | 2 ) 2 E sup 0 t T 0 t R d { 0 } c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) c ( X ( s ) , Λ ( s ) , u ) N ˜ ( d s , d u ) 2 + 2 E sup 0 t T 0 t R d { 0 } c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) c ( X ( s ) , Λ ( s ) , u ) Π ( d u ) d s 2 .
By applying the Doob martingale inequality to the first term and using Assumptions 1 and 3 to handle the second term, we obtain
E sup 0 t T 0 t R d { 0 } c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) c ( X ( s ) , Λ ( s ) , u ) N ˜ ( d s , d u ) 2 c p E 0 T R d { 0 } c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) c ( X ( s ) , Λ ( s ) , u ) N ˜ ( d s , d u ) 2 = C E 0 T R d { 0 } | c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) c ( X ( s ) , Λ ( s ) , u ) | 2 Π ( d u ) d s .
On the other hand, we can get
E sup 0 t T 0 t R d { 0 } [ c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) c ( X ( s ) , Λ ( s ) , u ) ] Π ( d u ) d s 2 E sup 0 t T 0 t R d { 0 } | c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) c ( X ( s ) , Λ ( s ) , u ) | 2 Π ( d u ) d s · Π ( R d { 0 } ) T C E 0 T R d { 0 } | c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) c ( X ( s ) , Λ ( s ) , u ) | 2 Π ( d u ) d s C E 0 T R d { 0 } | c ( X ¯ Δ ( s ) , Λ ( s ) , u ) c ( X ( s ) , Λ ( s ) , u ) | 2 Π ( d u ) d s + C E 0 T R d { 0 } | c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) c ( X ¯ Δ ( s ) , Λ ( s ) , u ) | 2 Π ( d u ) d s .
By Assumption 1, we have
E 0 T R d { 0 } | c ( X ¯ Δ ( s ) , Λ ( s ) , u ) c ( X ( s ) , Λ ( s ) , u ) | 2 Π ( d u ) d s C E 0 T | X ¯ ( s ) X ( s ) | 2 d s .
By Assumption 3, we can compute that
E 0 T R d { 0 } | c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) c ( X ¯ Δ ( s ) , Λ ( s ) , u ) | 2 Π ( d u ) d s = E E 0 T R d { 0 } | c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) c ( X ¯ Δ ( s ) , Λ ( s ) , u ) | 2 Π ( d u ) d s N T , τ 1 , , τ N T = E k 0 E t k t k + 1 R d { 0 } | c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) c ( X ¯ Δ ( s ) , Λ ( s ) , u ) | 2 Π ( d u ) d s N T , τ 1 , , τ N T = E [ k 0 E [ t k t k + 1 R d { 0 } | c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) c ( X ¯ Δ ( s ) , Λ ( s ) , u ) | 2 · I { Λ ( s ) Λ ( t k ) } Π ( d u ) d s N T , τ 1 , , τ N T ] ] 2 E [ k 0 E [ t k t k + 1 R d { 0 } ( | c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) | 2 + | c ( X ¯ Δ ( s ) , Λ ( s ) , u ) | 2 ) · I { Λ ( s ) Λ ( t k ) } Π ( d u ) d s N T , τ 1 , , τ N T ] ] C E k 0 E t k t k + 1 [ 1 + | X ¯ Δ ( t k ) | 2 ] I { Λ ( s ) Λ ( t k ) } d s N T , τ 1 , , τ N T .
Note that given { N T , τ 1 , , τ N T } , the terms 1 + | X ¯ Δ ( t k ) | 2 and I { Λ ( s ) Λ ( t k ) } are conditionally independent with respect to Λ ( t k ) ; thus
E t k t k + 1 [ 1 + | X ¯ Δ ( t k ) | 2 ] I { Λ ( s ) Λ ( t k ) } d s = t k t k + 1 E E ( 1 + | X ¯ Δ ( t k ) | 2 ) I { Λ ( s ) Λ ( t k ) } Λ ( t k ) d s = t k t k + 1 E E 1 + | X ¯ Δ ( t k ) | 2 Λ ( t k ) E I { Λ ( s ) Λ ( t k ) } Λ ( t k ) d s .
On the other hand, by the Markov property, we get
E I { Λ ( s ) Λ ( t k ) } Λ ( t k ) = i S I { Λ ( t k ) = i } P ( Λ ( s ) i Λ ( t k ) = i ) = i S I { Λ ( t k ) = i } ( q i i ( s t k ) + o ( s t k ) ) i S I { Λ ( t k ) = i } ( max ( q i i ) Δ + o ( Δ ) ) C Δ + o ( Δ ) .
Substituting (27) into (26) gives
E t k t k + 1 [ 1 + | X ¯ Δ ( t k ) | 2 ] I { Λ ( s ) Λ ( t k ) } d s t k t k + 1 E E ( 1 + | X ¯ Δ ( t k ) | 2 ) Λ ( t k ) ( C Δ + o ( Δ ) ) d s ( C Δ + o ( Δ ) ) t k t k + 1 E E 1 + | X ¯ Δ ( t k ) | 2 Λ ( t k ) d s = ( C Δ + o ( Δ ) ) t k t k + 1 E 1 + | X ¯ Δ ( t k ) | 2 d s .
By Lemma 1, there exists a positive constant C such that
E [ 1 + | X ¯ Δ ( t k ) | 2 ] 1 + E ( sup 0 t T | X ( t ) | 2 ) C ,
then
E t k t k + 1 [ 1 + | X ¯ Δ ( t k ) | 2 ] I { Λ ( s ) Λ ( t k ) } d s ( t k + 1 t k ) ( C Δ + o ( Δ ) ) .
Substitute (28) into (25)
E 0 T R d { 0 } | c ( X ¯ Δ ( s ) , Λ ( s ) , u ) c ( X ( s ) , Λ ( s ) , u ) | 2 Π ( d u ) d s C E k 0 E ( t k + 1 t k ) ( C Δ + o ( Δ ) ) N T , τ 1 , , τ N T = C E k 0 ( t k + 1 t k ) ( C Δ + o ( Δ ) ) C Δ + o ( Δ ) .
Here we use the fact that ( t k + 1 t k ) ( C Δ + o ( Δ ) ) are measurable with respect to the σ -algebra generated by { N T , τ 1 , , τ N T } .
Now substitute (24) and (29) into (23); we obtain that
E 0 T R d { 0 } | c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) c ( X ( s ) , Λ ( s ) , u ) | 2 Π ( d u ) d s 2 C 0 T E | X ¯ Δ ( s ) X ( s ) | 2 d s + C Δ + o ( Δ ) .
Similar to (30), we have
E 0 T | b Δ ( X ¯ Δ ( s ) , Λ Δ ( s ) ) b ( X ( s ) , Λ ( s ) ) | 2 d s 2 C 0 T E | X ¯ Δ ( s ) X ( s ) | 2 d s + C Δ + o ( Δ ) ,
and
E 0 T | σ Δ ( X ¯ Δ ( s ) , Λ Δ ( s ) ) σ ( X ( s ) , Λ ( s ) ) | 2 d s 2 C 0 T E | X ¯ Δ ( s ) X ( s ) | 2 d s + C Δ + o ( Δ ) .
Substituting (30)–(32) into (20) yields
E sup 0 t T | X Δ ( t ) X ( t ) | 2 C 0 T E | X ¯ Δ ( s ) X ( s ) | 2 d s + C 0 T E | X ¯ Δ ( s ) X ( s ) | 2 d s + C Δ + o ( Δ ) .
Note that
E | X ¯ Δ ( s ) X ( s ) | 2 2 E | X ¯ Δ ( s ) X Δ ( s ) | 2 + 2 E | X Δ ( s ) X ( s ) | 2 .
E | X ¯ Δ ( s ) X ( s ) | 2 2 E | X ¯ Δ ( s ) X Δ ( s ) | 2 + 2 E | X Δ ( s ) X ( s ) | 2 .
By Lemma 3 that E | X ¯ Δ ( s ) X Δ ( s ) | 2 C Δ ( g ( Δ ) ) 2 . Similarly, E | X ¯ Δ ( s ) X Δ ( s ) | 2 C Δ ( g ( Δ ) ) 2 . Substituting these and (34)–(35) into (33) gives
E sup 0 t T | X Δ ( t ) X ( t ) | 2 C 0 T ( E | X Δ ( t ) X ( t ) | 2 + E | X Δ ( t ) X ( t ) | 2 ) d t + C Δ + o ( Δ ) C 0 T E sup 0 s t | X Δ ( s ) X ( s ) | 2 d t + C Δ + o ( Δ ) .
An application of Gronwall’s inequality then yields
E sup 0 t T | X Δ ( t ) X ( t ) | 2 C Δ + o ( Δ ) .
The proof is complete. □

3.2. Strong Convergence in L p , p > 2

In this subsection we will show that
lim Δ 0 E sup 0 t T | X ( t ) X Δ ( t ) | q = 0 and lim Δ 0 E | X ¯ Δ ( t ) X ( t ) | q = 0 ,
for any T > 0 and 2 < q p . In the remainder of this subsection, we fix an arbitrary T > 0 . First, we state an additional assumption.
Assumption 4. 
For all ( x , i ) R d × S ,
R d { 0 } | x + c ( x , i , u ) | p | x | p 1 Π ( d u ) c ^ ( i ) < .
This section begins by establishing some lemmas, which will then lead to the statement of the main result. In what follows, we use c p to denote generic positive constants that may depend only on p and whose values may change from occurrence to occurrence.
Lemma 5. 
Let Assumption 1 hold. For any real number R   >   | x 0 | , define the stopping time
ρ R = inf { t 0 : | X ( t ) | R } .
Then
P ( ρ R T ) C R 2 .
Proof. 
A detailed proof can be found in [19]. □
Lemma 6. 
Let Assumptions 1 and 4 hold. Then for p > 2 ,
sup 0 < Δ Δ * sup 0 t T E | X Δ ( t ) | p C , T > 0 ,
where C denotes a generic positive constant that may depend on T, p and x 0 but is independent of Δ, and its values may change between occurrences.
Proof. 
Apply Itô’s formula to V ( x , i ) = | x | p . Fix any Δ ( 0 , Δ * ] and T 0 . For 0 t T ,
E | X Δ ( t ) | p c p | x 0 | p + E 0 t p | X Δ ( s ) | p 2 X Δ T ( s ) b Δ ( X ¯ Δ ( s ) , Λ Δ ( s ) ) + p 1 2 | σ Δ ( X ¯ Δ ( s ) , Λ Δ ( s ) ) | 2 d s + E 0 t p | X Δ ( s ) | p 2 ( X Δ ( s ) X ¯ Δ T ( s ) ) T b Δ ( X ¯ Δ ( s ) , Λ Δ ( s ) ) d s + E t k t R d { 0 } X Δ ( s ) + c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) p | X Δ ( s ) | p Π ( d u ) d s = c p | x 0 | p + I ˜ 1 + I ˜ 2 + I ˜ 3 .
By Lemma 2 and the Young inequality
a p 2 b p 2 p a p + 2 p b p / 2 , a , b 0 , p > 2 ,
we then have
I ˜ 1 + I ˜ 2 E 0 t p | X Δ ( s ) | p 2 ( L 3 ( 1 + | X ¯ Δ ( s ) | 2 ) d s + E 0 t ( p 2 ) | X Δ ( s ) | p d s + E 0 t | X Δ ( s ) X ¯ Δ ( s ) | p 2 | b Δ ( X ¯ Δ ( s ) , Λ Δ ( s ) ) | p / 2 d s C + C 0 T ( E | X Δ ( s ) | p + E | X ¯ Δ ( s ) | p ) d s + 2 0 t E | X Δ ( s ) X ¯ Δ ( s ) | p / 2 | b Δ ( X ¯ Δ ( s ) , Λ Δ ( s ) ) | p / 2 d s .
Combining (21), (22) and Assumption 4, we obtain that
I ˜ 3 = E t k t R d { 0 } [ X Δ ( s ) + c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) p | X Δ ( s ) | p ] Π ( d u ) d s E t k t R d { 0 } | X Δ ( s ) | p ( X Δ ( s ) + c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) ) p | X Δ ( s ) | p 1 Π ( d u ) d s E t k t | X Δ ( s ) | p | c ^ ( Λ Δ ( s ) ) | d s max i S | c ^ ( Λ Δ ( s ) ) | E t k t | X Δ ( s ) | p d s C E t k t | X Δ ( s ) | p d s
By Lemma 3 and inequalities (8) and (6), we have
E 0 T | X Δ ( s ) X ¯ Δ ( s ) | p / 2 | b Δ ( X ¯ Δ ( s ) , Λ Δ ( s ) ) | p / 2 d s ( g ( Δ ) ) p / 2 0 T E ( | X Δ ( s ) X ¯ Δ ( s ) | p / 2 ) d s ( g ( Δ ) ) p / 2 0 T ( E | X Δ ( s ) X ¯ Δ ( s ) | p ) 1 / 2 d s c p T ( g ( Δ ) ) p Δ p / 4 c p T .
We therefore have
E | X Δ ( t ) | p C + C 0 t E | X Δ ( s ) | p + E | X ¯ Δ ( s ) | p d s C + C 0 t sup 0 v s E | X Δ ( v ) | p d s .
As this holds for any t [ 0 , T ] , while the right-hand side is non-decreasing in t, we then see
sup 0 v t E | X Δ ( v ) | p C + C 0 t sup 0 v s E | X Δ ( v ) | p d s .
Applying Gronwall’s inequality yields
sup 0 t T E | X Δ ( t ) | p C .
As this holds for any Δ ( 0 , Δ * ] while C is independent of Δ , we see the required assertion (36). □
Lemma 7. 
Let Assumptions 1 and 2 hold. For any real number R   >   | x 0 | and Δ ( 0 , Δ * ) , define the stopping time
ρ Δ , R = inf { t 0 :   | X Δ ( t ) | R } .
Then, there exists a constant C which is independent of Δ and R, such that
P ( ρ Δ , R T ) C R 2 .
Proof. 
We simply write ρ Δ , R = ρ . By Itô’s formula, we have that for 0 t T ,
E | X Δ ( t ρ ) | 2 | x 0 | 2 + E 0 t ρ 2 X Δ T ( s ) b Δ ( X ¯ Δ ( s ) , Λ Δ ( s ) ) + | σ Δ ( X ¯ Δ ( s ) , Λ Δ ( s ) ) | 2 d s + E 0 t ρ R d { 0 } X Δ ( s ) + c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) 2 | X Δ ( s ) | 2 Π ( d u ) d s = | x 0 | 2 + E 0 t ρ 2 X ¯ Δ T ( s ) b Δ ( X ¯ Δ ( s ) , Λ Δ ( s ) ) + | σ Δ ( X ¯ Δ ( s ) , Λ Δ ( s ) ) | 2 d s + E 0 t ρ 2 ( X Δ ( s ) X ¯ Δ ( s ) ) T b Δ ( X ¯ Δ ( s ) , Λ Δ ( s ) ) d s + E 0 t ρ R d { 0 } | c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) | 2 + 2 | X Δ ( s ) | | c ( X ¯ Δ ( s ) , Λ Δ ( s ) , u ) | Π ( d u ) d s .
By Lemma 2, we then derive that
E | X Δ ( t ρ ) | 2 | x 0 | 2 + E 0 t ρ 2 C ( 1 + | X ¯ Δ ( s ) | 2 ) d s E 0 t ρ 2 | X Δ ( s ) X ¯ Δ ( s ) | | b Δ ( X ¯ Δ ( s ) , Λ Δ ( s ) ) | d s | x 0 | 2 + 2 C T + 4 C 0 t E | X Δ ( s ρ ) | 2 d s + 4 C 0 T E | X Δ ( s ) X ¯ Δ ( s ) | 2 d s + 2 E 0 T | X Δ ( s ) X ¯ Δ ( s ) | | b Δ ( X ¯ Δ ( s ) , Λ Δ ( s ) ) | d s .
But, by Lemma 3, we have
0 T E | X Δ ( s ) X ¯ Δ ( s ) | 2 d s C ,
while by Lemma 3 and inequalities (6) and (8), we derive
E 0 T | X Δ ( s ) X ¯ Δ ( s ) | | b Δ ( X ¯ Δ ( s ) , Λ Δ ( s ) ) | d s g ( Δ ) E 0 T E | X Δ ( s ) X ¯ Δ ( s ) | 2 1 / 2 d s T g ( Δ ) c p Δ ( g ( Δ ) ) 2 1 / 2 C ( g ( Δ ) Δ 1 / 4 ) 2 C .
We hence have
E | X Δ ( t ρ ) | 2 C + 4 C 0 t E | X Δ ( s ρ ) | 2 d s .
Gronwall’s inequality shows that
E | X Δ ( T ρ ) | 2 C .
This implies the required assertion (39) easily. □
We are now ready to state the main convergence result for p 2 .
Theorem 2. 
Let Assumptions 1 and 2 hold. Then, for any 2 < q p ,
lim Δ 0 E | X Δ ( T ) X ( T ) | q = 0 a n d lim Δ 0 E | X ¯ Δ ( T ) X ( T ) | q = 0 .
Proof. 
The proof of this theorem is similar to that of Theorem 3.5 in Mao (2015) [16]; therefore, redundant details are omitted. □

4. Numerical Example

In this section, we discuss a numerical example integrated with music elements to illustrate the theory established in the previous sections. By incorporating music-related parameters and scenario settings, we demonstrate the feasibility and efficiency of computer simulations based on the TEM method for jump-diffusion processes with Markovian switching while highlighting the method’s adaptability in interdisciplinary scenarios.
Example 1. 
Take the dimension d = 1 , and consider the following jump-diffusion model with Markovian switching integrated with music elements:
d X ( t ) = b ( Λ ( t ) ) X ( t ) d t + σ · M ( t ) X ( t ) d B ( t ) + R { 0 } β ( Λ ( t ) ) · γ ( u ) X ( t ) N ( d t , d u ) ,
where σ > 0 is a constant diffusion intensity coefficient; B ( t ) is a one-dimensional Brownian motion, describing the continuous random fluctuations of the system; N ( d t , d u ) is a stationary Poisson point process independent of B ( t ) , and its compensated Poisson random measure is N ˜ ( d t , d u ) = N ( d t , d u ) Π ( d u ) d t ; and Π ( · ) is a deterministic characteristic measure defined on the measurable space ( Γ , B ( Γ ) ) , where Γ is a compact set excluding the origin and B ( Γ ) is the Borel σ -algebra on Γ . Since the jump coefficient takes the linear form c ( x , i , u ) = β ( i ) γ ( u ) x , Assumption 4 reduces to ( | 1 + β ( i ) γ ( u ) | p 1 ) Π ( d u ) c ^ ( i ) . If we set γ ( u ) = u and Π is a Gamma process measure satisfying u p Π ( d u ) < , then c ^ ( i ) can be explicitly constructed via convex inequalities.
Λ ( t ) is a two-state Markov chain independent of B ( t ) and N ( t , A ) with state space S = { 1 , 2 } , corresponding to two core states of music: State 1 represents the “melody-dominated mode”, and State 2 represents the “rhythm-dominated mode”. Its Q-matrix is defined as
q 12 q 12 q 21 q 21 ,
where q 12 = 0.3 (switching rate from melody-dominated to rhythm-dominated mode) and q 21 = 0.2 (switching rate from rhythm-dominated to melody-dominated mode), which is consistent with the natural transition characteristics of the two modes in music. The drift coefficient is bound to the state: b ( 1 ) = 1 (in the melody-dominated state, the system mean shows an increasing trend, simulating the driving force of melody progression) and b ( 2 ) = 0.5 (in the rhythm-dominated state, the system mean shows a mild decreasing trend, simulating the restrictive effect of rhythmic stability).
M ( t ) is the music dynamic intensity factor, whose value depends on the musical segment characteristics corresponding to time t. Let M ( t ) = sin ( 2 π f t + ϕ ) , where f = 0.01 (simulating the basic beat frequency of music) and ϕ = 0 (initial phase). The value range of M ( t ) is [ 1 , 1 ] , which is used to adjust the intensity of the diffusion term and reflect the periodic fluctuation in music intensity over time. β ( 1 ) = 0.015 and β ( 2 ) = 0.008 are the basic jump amplitude coefficients in the two states, respectively. The jump amplitude coefficient in State 1 (melody-dominated) is larger, simulating the sudden pitch changes in the melody, and the jump amplitude coefficient in State 2 (rhythm-dominated) is smaller, simulating the regular pulses of rhythm. γ ( u ) is the correlation function between jumps and music elements. Let Γ = { 1 , 2 , 3 } correspond to three typical jump events in music (such as strong beats, weak beats, and grace notes). Define γ ( 1 ) = 0.8 (strong beat jumps with the largest impact), γ ( 2 ) = 0.4 (weak beat jumps with medium impact) and γ ( 3 ) = 0.1 (grace note jumps, with the smallest impact amplitude); the characteristic measure satisfies
Π ( { 1 } ) = 4 × 0.25 , Π ( { 2 } ) = 4 × 0.5 , Π ( { 3 } ) = 4 × 0.25 , and Π ( R { 1 , 2 , 3 } ) = 0 ,
which is consistent with the occurrence probability distribution of strong beats, weak beats, and grace notes in music.
Select the truncation-related function g ( Δ ) = Δ 1 / 4 . At this time, all conditions in Equation (6) hold for any Δ * ( 0 , 1 ] . Therefore, the truncation threshold is defined as f 1 ( g ( Δ ) ) = Δ 1 / 20 , and the truncation functions are:
b Δ ( x , i ) = b ( i ) x , | x | Δ 1 / 20 , b ( i ) Δ 1 / 20 · x | x | , | x | > Δ 1 / 20 ,
σ Δ ( x , i ) = σ · M ( t ) x , | x | Δ 1 / 20 , σ · M ( t ) Δ 1 / 20 · x | x | , | x | > Δ 1 / 20 .
The initial value is set to x 0 = 1 . For different time step sizes Δ and total duration T = 100 (simulating the duration of a complete piece of music), the numerical solution X k + 1 is calculated by the following recursive formula:
X Δ ( t k + 1 ) = X Δ ( t k ) + b Δ ( X Δ ( t k ) , Λ ( t k ) ) Δ + σ Δ ( X Δ ( t k ) , Λ ( t k ) ) Δ B k + j : N ( Δ t k , Δ t k + 1 ] × { u } β ( Λ ( t k ) ) γ ( u ) X Δ ( t k ) ,
where Δ t k = t k + 1 t k = Δ and Δ B k = B ( t k + 1 ) B ( t k ) .
Based on the above settings, numerical simulations are performed using the TEM method, and the following results are obtained.
1. Figure 1 ( Δ = 0.001 ) shows the trajectory of the numerical solution when the step size is extremely small. Since the step size is small enough, although the truncation threshold Δ 1 / 20 is large, the truncation operation is rarely triggered, and the numerical solution is almost equivalent to the result of the standard EM method. In the trajectory, the combination of the periodic fluctuation brought by M ( t ) and the Markov state switching (melody/rhythm dominance) makes the trajectory show the characteristics of increasing fluctuation in the melody segment and stable fluctuation in the rhythm segment. It can accurately capture the time nodes and impact amplitudes of jump events (strong beats/weak beats/grace notes), which is highly consistent with the system dynamics driven by real music, and the trajectory is smooth and consistent with the continuous characteristics of the theoretical solution.
2. Figure 2 ( Δ = 0.01 ) shows the trajectory of the numerical solution when the step size is relatively large. Due to the increased step size, the capture accuracy of Markov state switching decreases, the periodic characteristics of M ( t ) are not fully reflected, and the time positioning of jump events is deviated, resulting in more intense fluctuations and obvious deviations from the theoretical solution.

5. Conclusions and Discussion

The core idea of the TEM method is to control the explosive growth of numerical solutions through reasonable truncation, which is still applicable in models integrated with music elements.
When the step size Δ is small enough, the truncation operation is rarely triggered. The method can accurately restore the impact of music elements (beat fluctuation, state switching, and jump events) on the system, and the numerical solution converges to the true solution of the stochastic differential equation. When the step size increases, the fluctuation and deviation of the numerical solution intensify, which verifies the importance of step size selection for the numerical simulation of jump-diffusion processes containing dynamic music elements.
This example shows that the TEM method is not only applicable to traditional jump-diffusion processes with Markovian switching but can also effectively adapt to extended models integrated with interdisciplinary elements such as music, providing a reliable numerical tool for fields such as music signal processing and music-driven dynamic system analysis.

Author Contributions

Conceptualization, P.L.; Methodology, Y.Z.; Validation, P.Y. and Y.Z.; Writing—Original Draft Preparation, P.L. and Y.Z.; Writing—Review and Editing, Y.Z. and P.Y.; Project Administration, P.L. and P.Y.; Funding Acquisition, Y.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This research study was supported by School of Computer Science and Technology, Zhejiang University of Water Resources and Electric Power, under Grant No. Z20250122. This research was supported by the Joint Fund of Zhejiang Provincial Natural Science Foundation of China under Grant No.LGEZ26F030002, Scientific Research Foundation of Zhejiang University of Water Resources and Electric Power under Grant No. JBGS2025009.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Acknowledgments

The authors are deeply grateful to Jun Li and Zuozheng Zhang for their careful reading of the manuscript and for providing valuable suggestions, and the authors would like to thank the referees and editors for their helpful suggestions, which improved the quality of this paper.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Buffington, J.; Elliott, J. American options with regime switching. Int. J. Theor. Appl. Fin. 2002, 5, 497–514. [Google Scholar] [CrossRef]
  2. Gershwin, S. Hierarchical flow control: A framework for scheduling and planning discete events in manufacturing systems. Proc. IEEE. 1979, 77, 195–209. [Google Scholar] [CrossRef]
  3. Tomlin, C.; Pappas, G.; Sastry, S. Conflict resolution for air traffic management; a case study in multi-agent hybrid systems. IEEE Trans. Autom. Control 1998, 14, 509–521. [Google Scholar] [CrossRef]
  4. Massachusetts Institute of Technology; Laboratory for Information and Decision Systems; Trygar, T.A. Stochastic Stability Research for Complex Power Systems. 1980. Available online: http://hdl.handle.net/1721.1/1333 (accessed on 21 January 2026).
  5. Yao, D.; Zhang, Q.; Zhou, X. A regime-switching model for European options. In Stochastic Processes, Optimization, and Control Theory: Applications in Financial Engineering, Queueing Networks, and Manufacturing Systems; Springer: Boston, MA, USA, 2006; pp. 281–300. [Google Scholar]
  6. Arapostathis, A.; Ghosh, K.; Marcus, S.I. Optiaml control of switching diffusions with application to flexible manufacturing systems. SIAM J. Control Optim. 1993, 31, 1183–1204. [Google Scholar]
  7. Higham, D.J.; Kloeden, P.E. Numerical methods for nonlinear stochastic differential equations with jumps. Numer. Math. 2005, 101, 101–119. [Google Scholar] [CrossRef]
  8. Kloeden, P.E. An introducion to numerical methods for stochastic differencial equations. Acta Numer. 1999, 197–246. [Google Scholar] [CrossRef]
  9. Milstein, G.N. Numerical Integration of Stochastic Differential Equations; Kluwer: New York, NY, USA, 1995. [Google Scholar]
  10. Protter, P.; Talay, D. The Eluer scheme for Levy driven stochastic differencial equations. Ann. Probab. 1997, 25, 397–423. [Google Scholar] [CrossRef]
  11. Yuan, C.; Mao, X. Convergence of the Euler-Maruyama method for stochastic differencial equations with Markovian switching. Math Comput Simulat. 2004, 64, 223–235. [Google Scholar] [CrossRef]
  12. Ye, J.; Li, K. Numerical Solutions of Jump Diffusions with Markovian Switching. arXiv Numer. Anal. 2011. [Google Scholar] [CrossRef]
  13. Yin, G.; Song, Q.; Zhang, Z. Numerical solutions for jump-diffusions with regime switching. Stochastics 2005, 77, 61–79. [Google Scholar] [CrossRef]
  14. Chen, M. From Markov Chains to Non-Equilibrium Particle Systems; World Scientific: Singapore, 1992. [Google Scholar]
  15. Xi, F. On the stability of jump-diffusions with Markovian switching. J. Math. Anal. Appl. 2008, 341, 588–600. [Google Scholar] [CrossRef]
  16. Mao, X. The truncated Euler-Maruyama method for stochastic differential equations. J. Comput. Appl. Math. 2015, 290, 370–384. [Google Scholar] [CrossRef]
  17. Mao, X. Stochastic Differential Equations and Applications, 2nd ed.; Horwood: Chichester, UK, 2007. [Google Scholar]
  18. Ikeda, N.; Watanabe, S. Stochastic Differential Equations and Diffusion Processes; North-Holland Publishing Company: Amsterdam, The Netherland, 1981. [Google Scholar]
  19. Xi, F.; Zhu, C. On Feller and Strong Feller Properties and Exponential Ergodicity of Regime-Switching Jump Diffusion Processes with Countable Regimes. Siam J. Control Optim. 2017, 55, 1789–1818. [Google Scholar] [CrossRef]
Figure 1. The trajectory of the approximate solution when Δ = 0.001.
Figure 1. The trajectory of the approximate solution when Δ = 0.001.
Mathematics 14 01087 g001
Figure 2. The trajectory of the approximate solution when Δ = 0.01.
Figure 2. The trajectory of the approximate solution when Δ = 0.01.
Mathematics 14 01087 g002
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.

Share and Cite

MDPI and ACS Style

Li, P.; Yu, P.; Zhen, Y. The Truncated EM Method of Jump Diffusions with Markovian Switching: A Case Study of Music Signals. Mathematics 2026, 14, 1087. https://doi.org/10.3390/math14061087

AMA Style

Li P, Yu P, Zhen Y. The Truncated EM Method of Jump Diffusions with Markovian Switching: A Case Study of Music Signals. Mathematics. 2026; 14(6):1087. https://doi.org/10.3390/math14061087

Chicago/Turabian Style

Li, Ping, Ping Yu, and Yuhang Zhen. 2026. "The Truncated EM Method of Jump Diffusions with Markovian Switching: A Case Study of Music Signals" Mathematics 14, no. 6: 1087. https://doi.org/10.3390/math14061087

APA Style

Li, P., Yu, P., & Zhen, Y. (2026). The Truncated EM Method of Jump Diffusions with Markovian Switching: A Case Study of Music Signals. Mathematics, 14(6), 1087. https://doi.org/10.3390/math14061087

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop