Xiaojie Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xiaojie Wang has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Ruisheng Qi
School of Mathematics and Statistics Northeastern University at Qinhuangdao Qinhuangdao China
6 shared publications - Meng Cai
School of Statistics and Mathematics, Central University of Finance and Economics, Beijing, China
4 shared publications - Ruisheng Qi
School of Mathematics and Statistics Northeastern University at Qinhuangdao Qinhuangdao China
4 shared publications - Ruishu Liu
School of Mathematics and Statistics, HNP-LAMA, Central South University, Changsha, China
4 shared publications - Siqing Gan
School of Mathematics and Statistics HNP-LAMA Central South University 410083 Changsha China
4 shared publications - Yue Wu
Department of Mathematics and Statistics, University of Strathclyde, Glasgow, UK
4 shared publications
Latest Publications
- Open Access
An explicit scheme for stochastic Allen-Cahn equations with space-time white noise near the sharp interface limit
This article investigates time-discrete approximations of Allen-Cahn type SPDEs driven by space-time white noise near the sharp interface limit $ε\to 0$, where the small parameter $ε$ is the diffuse interface thickness. We propose an explicit and easily implementable exponential integrator with a modified nonlinearity for the considered problem. Uniform-in-time and uniform-in-$ε$ moment bounds of the scheme are established and the convergence in total variation distance of order $O(T\cdot\text{Poly}(ε^{-1})τ^γ),γ<\tfrac12$ is established, between the law of the numerical scheme and that of the SPDE over $[0,T]$. In contrast to the exponential dependence due to standard arguments, the obtained error bound depends on $ε^{-1}$ and $T$ polynomially. By incorporating carefully chosen method parameters, we only require a mild and $ε$-independent restriction on the time step-size $τ$, getting rid of the severe restriction $τ=O(ε^σ),σ\geq1$ in the literature. Also, a uniform-in-time error bound of order $O(τ^γ),γ<\tfrac12$, is obtained for a fixed $ε=1$, which improves the existing ones in the literature and matches the classical weak convergence rate in the globally Lipschitz setting. The error analysis is highly nontrivial due to the low regularity of the considered problem, the super-linear growth of the drift, the non-smooth observables inherent in the total variation metric and the presence of the small interface parameter $ε\to0$. These difficulties are addressed by introducing a new strategy of nonlinearity modification and establishing refined regularity estimates for the associated Kolmogorov equation to an auxiliary process with non-smooth test functions. Numerical experiments confirm the theoretical convergence and the ability of interface-capturing for the proposed scheme.Open AccessAn explicit scheme for stochastic Allen-Cahn equations with space-time white noise near the sharp interface limit
This article investigates time-discrete approximations of Allen-Cahn type SPDEs driven by space-time white noise near the sharp interface limit $ε\to 0$, where the small parameter $ε$ is the diffuse interface thickness. We propose an explicit and easily implementable exponential integrator with a modified nonlinearity for the considered problem. Uniform-in-time and uniform-in-$ε$ moment bounds of the scheme are established and the convergence in total variation distance of order $O(T\cdot\text{Poly}(ε^{-1})τ^γ),γ<\tfrac12$ is established, between the law of the numerical scheme and that of the SPDE over $[0,T]$. In contrast to the exponential dependence due to standard arguments, the obtained error bound depends on $ε^{-1}$ and $T$ polynomially. By incorporating carefully chosen method parameters, we only require a mild and $ε$-independent restriction on the time step-size $τ$, getting rid of the severe restriction $τ=O(ε^σ),σ\geq1$ in the literature. Also, a uniform-in-time error bound of order $O(τ^γ),γ<\tfrac12$, is obtained for a fixed $ε=1$, which improves the existing ones in the literature and matches the classical weak convergence rate in the globally Lipschitz setting. The error analysis is highly nontrivial due to the low regularity of the considered problem, the super-linear growth of the drift, the non-smooth observables inherent in the total variation metric and the presence of the small interface parameter $ε\to0$. These difficulties are addressed by introducing a new strategy of nonlinearity modification and establishing refined regularity estimates for the associated Kolmogorov equation to an auxiliary process with non-smooth test functions. Numerical experiments confirm the theoretical convergence and the ability of interface-capturing for the proposed scheme. - Open Access
Multimodal sampling via Schrödinger-Föllmer samplers with temperatures
Generating samples from complex and high-dimensional distributions is ubiquitous in various scientific fields of statistical physics, Bayesian inference, scientific computing and machine learning. Very recently, Huang et al. (IEEE Trans. Inform. Theory, 2025) proposed new Schrödinger-Föllmer samplers (SFS), based on the Euler discretization of the Schrödinger-Föllmer diffusion evolving on the unit interval $[0, 1]$. There, a convergence rate of order $\mathcal{O}(\sqrt{h})$ in the $L^2$-Wasserstein distance was obtained for the Euler discretization with a uniform time step-size $h>0$. By incorporating a temperature parameter, different samplers are introduced in this paper, based on the Euler discretization of the Schrödinger-Föllmer process with temperatures. As revealed by numerical experiments, high temperatures are vital, particularly in sampling from multimodal distributions. Further, a novel approach of error analysis is developed for the time discretization and an enhanced convergence rate of order ${ \mathcal{O}(h)}$ is obtained in the $L^2$-Wasserstein distance, under certain smoothness conditions on the drift. This significantly improves the existing order-half convergence in the aforementioned paper. Unlike Langevin samplers, SFS is of gradient-free, works in a unit interval $[0, 1]$ and does not require any ergodicity. Numerical experiments confirm the convergence rate and show that, the SFS substantially outperforms vanilla Langevin samplers, particularly in sampling from multimodal distributions.Open AccessMultimodal sampling via Schrödinger-Föllmer samplers with temperatures
Generating samples from complex and high-dimensional distributions is ubiquitous in various scientific fields of statistical physics, Bayesian inference, scientific computing and machine learning. Very recently, Huang et al. (IEEE Trans. Inform. Theory, 2025) proposed new Schrödinger-Föllmer samplers (SFS), based on the Euler discretization of the Schrödinger-Föllmer diffusion evolving on the unit interval $[0, 1]$. There, a convergence rate of order $\mathcal{O}(\sqrt{h})$ in the $L^2$-Wasserstein distance was obtained for the Euler discretization with a uniform time step-size $h>0$. By incorporating a temperature parameter, different samplers are introduced in this paper, based on the Euler discretization of the Schrödinger-Föllmer process with temperatures. As revealed by numerical experiments, high temperatures are vital, particularly in sampling from multimodal distributions. Further, a novel approach of error analysis is developed for the time discretization and an enhanced convergence rate of order ${ \mathcal{O}(h)}$ is obtained in the $L^2$-Wasserstein distance, under certain smoothness conditions on the drift. This significantly improves the existing order-half convergence in the aforementioned paper. Unlike Langevin samplers, SFS is of gradient-free, works in a unit interval $[0, 1]$ and does not require any ergodicity. Numerical experiments confirm the convergence rate and show that, the SFS substantially outperforms vanilla Langevin samplers, particularly in sampling from multimodal distributions. - Open Access
Non-asymptotic Error Analysis of Explicit Modified Euler Methods for Superlinear and Non-contractive SODEs
A family of explicit modified Euler methods (MEMs) is constructed for long-time approximations of super-linear SODEs driven by multiplicative noise. The proposed schemes can preserve the same Lyapunov structure as the continuous problems. Under a non-contractive condition, we establish a non-asymptotic error bound between the law of the numerical approximation and the target distribution in Wasserstein-1 ($\mathcal{W}_1$) distance through a time-independent weak convergence rate for the proposed schemes. As a by-product of this weak error estimate, we obtain an $\mathcal{O}(τ|\ln τ|)$ convergence rate between the exact and numerical invariant measures.Open AccessNon-asymptotic Error Analysis of Explicit Modified Euler Methods for Superlinear and Non-contractive SODEs
A family of explicit modified Euler methods (MEMs) is constructed for long-time approximations of super-linear SODEs driven by multiplicative noise. The proposed schemes can preserve the same Lyapunov structure as the continuous problems. Under a non-contractive condition, we establish a non-asymptotic error bound between the law of the numerical approximation and the target distribution in Wasserstein-1 ($\mathcal{W}_1$) distance through a time-independent weak convergence rate for the proposed schemes. As a by-product of this weak error estimate, we obtain an $\mathcal{O}(τ|\ln τ|)$ convergence rate between the exact and numerical invariant measures. - Open Access
On modified Euler methods for McKean-Vlasov stochastic differential equations with super-linear coefficients
We introduce a new class of numerical methods for solving McKean-Vlasov stochastic differential equations, which are relevant in the context of distribution-dependent or mean-field models, under super-linear growth conditions for both the drift and diffusion coefficients. Under certain non-globally Lipschitz conditions, the proposed numerical approaches have half-order convergence in the strong sense to the corresponding system of interacting particles associated with McKean-Vlasov SDEs. By leveraging a result on the propagation of chaos, we establish the full convergence rate of the modified Euler approximations to the solution of the McKean-Vlasov SDEs. Numerical experiments are included to validate the theoretical results.
Open AccessOn modified Euler methods for McKean-Vlasov stochastic differential equations with super-linear coefficients
We introduce a new class of numerical methods for solving McKean-Vlasov stochastic differential equations, which are relevant in the context of distribution-dependent or mean-field models, under super-linear growth conditions for both the drift and diffusion coefficients. Under certain non-globally Lipschitz conditions, the proposed numerical approaches have half-order convergence in the strong sense to the corresponding system of interacting particles associated with McKean-Vlasov SDEs. By leveraging a result on the propagation of chaos, we establish the full convergence rate of the modified Euler approximations to the solution of the McKean-Vlasov SDEs. Numerical experiments are included to validate the theoretical results.
- 3 January 2025
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 102 (2) , 1-26
Strong Convergence Rates for a Full Discretization of Stochastic Wave Equation with Nonlinear Damping
- 3 January 2025
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 102 (2) , 1-26
Strong Convergence Rates for a Full Discretization of Stochastic Wave Equation with Nonlinear Damping
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems-Series B
- Vol. 30 (9) , 3222-3242
Order-one convergence of the backward euler method for random periodic solutions of semilinear SDEs
In this paper, we revisit the backward Euler method for numerical approximations of random periodic solutions of semilinear SDEs with additive noise. Improved $ L^p $-estimates of the random periodic solutions of the considered SDEs are obtained under a more relaxed condition compared to literature. The backward Euler scheme is proved to converge with an order one in the mean square sense, which also improves the existing order-half convergence. Numerical examples are presented to verify our theoretical analysis.
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems-Series B
- Vol. 30 (9) , 3222-3242
Order-one convergence of the backward euler method for random periodic solutions of semilinear SDEs
In this paper, we revisit the backward Euler method for numerical approximations of random periodic solutions of semilinear SDEs with additive noise. Improved $ L^p $-estimates of the random periodic solutions of the considered SDEs are obtained under a more relaxed condition compared to literature. The backward Euler scheme is proved to converge with an order one in the mean square sense, which also improves the existing order-half convergence. Numerical examples are presented to verify our theoretical analysis.
- Open Access
Order-one explicit approximations of random periodic solutions of semi-linear SDEs with multiplicative noise
This paper is devoted to order-one explicit approximations of random periodic solutions to multiplicative noise driven stochastic differential equations (SDEs) with non-globally Lipschitz coefficients. The existence of the random periodic solution is demonstrated as the limit of the pull-back of the discretized SDE. A novel approach is introduced to analyze mean-square error bounds of the proposed scheme that does not depend on a prior high-order moment bounds of the numerical approximations. Under mild assumptions, the proposed scheme is proved to achieve an expected order-one mean square convergence in the infinite time horizon. Numerical examples are finally provided to verify the theoretical results.
Open AccessOrder-one explicit approximations of random periodic solutions of semi-linear SDEs with multiplicative noise
This paper is devoted to order-one explicit approximations of random periodic solutions to multiplicative noise driven stochastic differential equations (SDEs) with non-globally Lipschitz coefficients. The existence of the random periodic solution is demonstrated as the limit of the pull-back of the discretized SDE. A novel approach is introduced to analyze mean-square error bounds of the proposed scheme that does not depend on a prior high-order moment bounds of the numerical approximations. Under mild assumptions, the proposed scheme is proved to achieve an expected order-one mean square convergence in the infinite time horizon. Numerical examples are finally provided to verify the theoretical results.
- 27 December 2024
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 94 (354) , 1815-1862
A strong order 1.5 boundary preserving discretization scheme for scalar SDEs defined in a domain
In this paper, we study the strong approximation of scalar stochastic differential equations (SDEs), which take values in a domain and have non-Lipschitz coefficients. By combining a Lamperti-type transformation with a semi-implicit discretization approach and a taming strategy, we construct a domain-preserving scheme that strongly converges under weak assumptions. Moreover, we show that this scheme has strong convergence order 1.5 1.5 under additional assumptions on the coefficients of the SDE. In our scheme, the domain preservation is a consequence of the semi-implicit discretization approach, while the taming strategy allows controlling terms of the scheme that admit singularities but are required to obtain the desired order. Our general convergence results are applied to various SDEs from applications, with sub-linearly or super-linearly growing and non-globally Lipschitz coefficients. Numerical experiments are presented to illustrate our theoretical findings.
- 27 December 2024
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 94 (354) , 1815-1862
A strong order 1.5 boundary preserving discretization scheme for scalar SDEs defined in a domain
In this paper, we study the strong approximation of scalar stochastic differential equations (SDEs), which take values in a domain and have non-Lipschitz coefficients. By combining a Lamperti-type transformation with a semi-implicit discretization approach and a taming strategy, we construct a domain-preserving scheme that strongly converges under weak assumptions. Moreover, we show that this scheme has strong convergence order 1.5 1.5 under additional assumptions on the coefficients of the SDE. In our scheme, the domain preservation is a consequence of the semi-implicit discretization approach, while the taming strategy allows controlling terms of the scheme that admit singularities but are required to obtain the desired order. Our general convergence results are applied to various SDEs from applications, with sub-linearly or super-linearly growing and non-globally Lipschitz coefficients. Numerical experiments are presented to illustrate our theoretical findings.
- Open Access
Strong convergence rates of Galerkin finite element methods for SWEs with cubic polynomial nonlinearity
In the present work, strong approximation errors are analyzed for both the spatial semi-discretization and the spatio-temporal fully discretization of stochastic wave equations (SWEs) with cubic polynomial nonlinearities and additive noises. The fully discretization is achieved by the standard Galerkin ffnite element method in space and a novel exponential time integrator combined with the averaged vector ffeld approach. The newly proposed scheme is proved to exactly satisfy a trace formula based on an energy functional. Recovering the convergence rates of the scheme, however, meets essential difffculties, due to the lack of the global monotonicity condition. To overcome this issue, we derive the exponential integrability property of the considered numerical approximations, by the energy functional. Armed with these properties, we obtain the strong convergence rates of the approximations in both spatial and temporal direction. Finally, numerical results are presented to verify the previously theoretical findings.
Open AccessStrong convergence rates of Galerkin finite element methods for SWEs with cubic polynomial nonlinearity
In the present work, strong approximation errors are analyzed for both the spatial semi-discretization and the spatio-temporal fully discretization of stochastic wave equations (SWEs) with cubic polynomial nonlinearities and additive noises. The fully discretization is achieved by the standard Galerkin ffnite element method in space and a novel exponential time integrator combined with the averaged vector ffeld approach. The newly proposed scheme is proved to exactly satisfy a trace formula based on an energy functional. Recovering the convergence rates of the scheme, however, meets essential difffculties, due to the lack of the global monotonicity condition. To overcome this issue, we derive the exponential integrability property of the considered numerical approximations, by the energy functional. Armed with these properties, we obtain the strong convergence rates of the approximations in both spatial and temporal direction. Finally, numerical results are presented to verify the previously theoretical findings.
- Open Access
Higher order numerical methods for SDEs without globally monotone coefficients
In the present work, we delve into further study of numerical approximations of SDEs with non-globally monotone coefficients. We design and analyze a new family of stopped increment-tamed time discretization schemes of Euler, Milstein and order 1.5 type for such SDEs. By formulating a novel unified framework, the proposed methods are shown to possess the exponential integrability properties, which are crucial to recovering convergence rates in the non-global monotone setting. Armed with such exponential integrability properties and by the arguments of perturbation estimates, we successfully identify the optimal strong convergence rates of the aforementioned methods in the non-global monotone setting. Numerical experiments are finally presented to corroborate the theoretical results.
Open AccessHigher order numerical methods for SDEs without globally monotone coefficients
In the present work, we delve into further study of numerical approximations of SDEs with non-globally monotone coefficients. We design and analyze a new family of stopped increment-tamed time discretization schemes of Euler, Milstein and order 1.5 type for such SDEs. By formulating a novel unified framework, the proposed methods are shown to possess the exponential integrability properties, which are crucial to recovering convergence rates in the non-global monotone setting. Armed with such exponential integrability properties and by the arguments of perturbation estimates, we successfully identify the optimal strong convergence rates of the aforementioned methods in the non-global monotone setting. Numerical experiments are finally presented to corroborate the theoretical results.