Post-processed frozen-flow methods for the long time sampling of ergodic dynamics on Riemannian manifolds


Abstract

In this work, we propose a novel intrinsic approach to the approximation of ergodic SDEs on Riemannian manifolds, which include Riemannian Langevin dynamics. In opposition to the standard extrinsic approaches such as penalization methods and projection methods, our methodology does not use embeddings or coordinates and only relies on natural geometric operations: geodesics, parallel transport,… We give a criterion for high order of accuracy for the invariant measure, develop new intrinsic numerical methods designed solely for sampling the invariant measure, and derive high order conditions using a new algebraic operation on exotic Lie-Butcher series. In the spirit of the Leimkuhler-Matthews method, our approach prioritizes long time sampling efficiency over finite time accuracy, and outperforms the previous extrinsic and intrinsic approaches in terms of cost for a given accuracy, which we illustrate with several numerical experiments.

Keywords:  geometric numerical integration, stochastic differential equations, Riemannian manifolds, Riemannian Langevin, ergodicity, Lie-group methods, frozen-flow, Butcher series, exotic series, post-Lie algebra, Hopf algebra, order conditions.
AMS subject classification (2020):  16T05, 41A58, 60H35, 37M25, 65L06, 70H45.

1 Introduction↩︎

The aim of this paper is the design of high-order sampling methods of ergodic stochastic dynamics on Riemannian manifolds. More precisely, let \((\mathcal{M},g)\) be a smooth, complete, connected \(D\)-dimensional Riemannian manifold endowed with a metric \(g\) and let \(\nabla\) be its associated Levi-Civita connection. Let \(E_1,\dots,E_D\) be a global orthonormal frame basis (for simplicity), that is, for all \(x\) in \(\mathcal{M}\), the set \(\{E_1(x),\dots,E_D(x)\}\) is an orthonormal basis of the tangent space \(T_x \mathcal{M}\). Given a smooth and Lipschitz vector field \(F : x \mapsto \underset{d=1}{\overset{D}{\sum}} f^d(x) E_d(x)\), we consider stochastic differential equations on \(\MM\) of the following form: \[\label{equation:SDE} \mathrm{d}X(t) = F(X(t))\mathrm{d}t + \sqrt{2}\sum_{d=1}^D E_d(X(t)) \circ \mathrm{d}W_d(t) , \quad X(0) = X_0 \in \mathcal{M}.\tag{1}\] Equation 1 can be understood as a SDE with additive noise, as it rewrites (see [1]) as \[\mathrm{d}X(t) = (F+\nabla_{E_n}E_n)(X(t))\mathrm{d}t + \sqrt{2} \mathrm{d}B_\mathcal{M}(t),\] where \(B_\MM(t)\) is a Brownian motion on \(\MM\) and we use the Einstein summation notation. The class of SDEs 1 includes the celebrated Riemannian Langevin dynamics \[\label{equation:Langevin} \mathrm{d}X(t) = -\nabla V(X(t))\mathrm{d}t + \sqrt{2}\mathrm{d}B_\mathcal{M}(t),\tag{2}\] when \(F\) derives from a potential, that is, when for a smooth function \(V\colon \MM\rightarrow\R\), one has \[\label{equation:correction} F = -\nabla V - \nabla_{E_n}E_n, \quad f^d = - E_d[V] - \left\langle\nabla_{E_n}E_n \vert E_d \right\rangle.\tag{3}\]

Under growth assumptions on \(F\) (see, for instance, the Bakry-Emery criterion [2] for the Langevin case 2 ), the flow \(X(t)\) of 1 is ergodic, that is, its long-time behaviour is described by a deterministic measure \(\mathrm{d}\mu_\infty=\rho_\infty \mathrm{d}\vol_\MM\), that is absolutely continuous with respect to the Riemannian volume form \(\mathrm{d}\vol_\MM\), in the sense that for a large class of smooth functions \(\varphi\) and for all initial condition \(X_0 \in \MM\), one has \[\underset{T \to \infty}{\lim} \frac{1}{T} \int_0^T \varphi(X(t))\mathrm{d}t = \displaystyle{ \int_{\mathcal{M}} } \varphi(y) \mathrm{d}\mu_\infty(y) \text{ almost surely.}\] In the case of Riemannian Langevin dynamics 2 , the invariant measure is given by the Gibbs density \(\rho_\infty\propto e^{-V}\).

In this paper, we design new numerical methods that have a high order of accuracy for sampling the invariant measure of 1 . We consider one-step numerical integrators \({(X_n)}_{n = 0,\dots,N}\), on a discretization \(t_n = nh\) of a time interval \([0,T]\) for a time step \(h=T/N\), given by a random perturbation of the identity: \[\label{equation:method} X_{n+1} = \Psi_h(X_n), \quad X_0 \in \MM.\tag{4}\] We also consider post-processed methods \[\label{equation:post-process} X_0 \in \MM, \quad X_{n+1} = \Psi_h(X_n), \quad \overline{X}_N = \overline{\Psi}_h(X_N),\tag{5}\] where the post-processor \(X \mapsto \overline{X}\) is a random perturbation of the identity map on \(\MM\), that is applied only once at the very end of the trajectory. Assuming ergodicity of the numerical method 4 for a measure \(\mathrm{d}\mu^h_\infty=\rho^h_\infty \mathrm{d}\vol_\MM\), we propose methods of high order of accuracy \(p > 1\) for the invariant measure of 1 , that is, that satisfy for \(h\) small enough, \[\abs{ \displaystyle{ \int_{\mathcal{M}} } \varphi \mathrm{d}\mu^h_\infty - \displaystyle{ \int_{\mathcal{M}} } \varphi \mathrm{d}\mu_\infty} \leq C h^p.\] A crucial difficulty of the approach is that the integrators have to evolve on \(\MM\) in order for the measure \(\mathrm{d}\mu^h_\infty\) to be absolutely continuous w.r.t.\(\mathrm{d}\vol_\MM\). Moreover, our approach focuses on intrinsic integrators, that are, numerical methods that evolve on \(\MM\) and that do not depend on an embedding of \(\MM\) in a higher-dimensional Euclidean space or on a choice of coordinates. Among the existing extrinsic approaches, we mention the popular projection methods (see [3], [4] and references therein), which are conveniently implemented by embedding \(\MM\) in a vector space of higher dimension, but often face severe timestep restrictions. We also mention the existing intrinsic approaches for SDEs on manifolds [5][8], that either focus on order one of accuracy or strong convergence, or are defined on specific manifolds only (i.e., Lie groups). Our approach relies on the class of frozen-flow methods recently introduced in [9], on which we add post-processors [10]. This class of methods can be seen as a stochastic extension of the Crouch-Grossman and commutator-free Lie group methods [11][15]. In opposition to [5], [6], our approach generalises the Lie group methods to any smooth manifold and focuses only on the approximation for the invariant measure. An important feature of the new integrators is that they do not rely on the use of embeddings or on local coordinates. Their formulation, convergence analysis, order theory, and implementation are entirely intrinsic.

To derive methods of high order for the invariant measure, it is sufficient to use methods of weak order \(p\) as they will have at least order \(p\) for the invariant measure [16]. However, there exists many efficient methods of low weak order and high order for the invariant measure in a variety of (Euclidean) contexts [17][21]. Among these, the celebrated Leimkuhler-Matthews method [18] is of weak order one and second order for the invariant measure for solving 1 when \(\MM=\R^D\): \[\begin{align} H_n = X_n+ \frac{\sqrt{2h}}{2} \xi^d_n E_d,\quad X_{n+1} = X_n+ h F(H_n) + \frac{\sqrt{2h}}{2}\xi^d_n E_d,\quad \overline{X_N} = X_N +\frac{\sqrt{2h}}{2} \overline{\xi}^d_n E_d. \end{align}\] Our intrinsic approach with frozen-flow methods allows us to derive in particular a straightforward generalisation of the Leimkuhler-Matthews method to the Riemannian setting,

where only one evaluation of the vector field \(F\) is needed (see Section 2.3 for the details). We recall that, in comparison, the extrinsic approach with projection methods from [4] requires four evaluations of \(F\), has a technical implementation, and faces stability issues.

The derivation of the order conditions for the invariant measure relies on exotic Lie-Butcher series and on the Weitzenböck connection algebra. The exotic Lie-Butcher series were introduced in [9] for deriving weak high-order estimates. They generalise naturally the exotic Butcher series [22][25] and the Lie-Butcher series [13], [15], [26]. While such formalism is necessary for dealing with the intricate calculations of order conditions, we emphasize that the algebraic objects considered here are interesting beyond their numerical use. We mention in particular the works [9], [25], [27] that study the geometric and algebraic properties of exotic forests and the works [28][32] that draw strong links between planar trees and computations in specific connection algebras. The numerical integrators considered here rely on elementary geometric operations (geodesic, parallel transport) for a specific curvature-free connection, called the Weitzenböck connection. This choice allows us to use planar trees for the calculations, to which we add the exotic feature for representing the Laplace-Beltrami operator in terms of forests. Thanks to this algebraic formalisation, we provide a methodology for the design of intrinsic integrators of any high-order for the invariant measure. More precisely, we define the integration by parts of planar exotic forests, thus generalising [22], [24], [25] to the manifold setting, and we describe the order conditions for the invariant measure by a character on a modified shuffle algebra of exotic forests. Contrary to the Euclidean case where such theory naturally leads to modified equations of any order and stochastic backward error analysis for the invariant measure, there are profound algebraic differences on manifolds that make intrinsic stochastic backward error analysis challenging.

The paper is organised the following way. We present in Section 2 the main results of the paper. After presenting the notation and main assumptions, we give a convenient characterisation of the high-order for the invariant measure, generalising the Euclidean works [10], [33], [34]. Then, we apply this criterion to derive new simple methods of second order for the invariant measure. The proof of the criterion for high order for the invariant measure is presented in Section 3. In Section 4, we apply the exotic Lie-Butcher series formalism for the derivation of order conditions for the invariant measure, and we extend the integration by parts on exotic forests to the planar context. We present numerical experiments on a variety of classical manifolds in Section 5 and we present outlooks and future works in Section 6.

2 Preliminaries, characterization of the invariant measure and new numerical methods↩︎

2.1 Notation and main assumptions↩︎

For \(v \in T\MM\), let \(\abs{v}=\sqrt{g(v,v)}\) be its Riemannian norm. For \(o \in \MM\). Then we denote by \(r = d(o,\cdot)\) the Riemannian distance map. It is 1-Lipschitz and \(r^2\) is smooth on \(\MM \setminus Cut_o\). For all \(\varphi \in C^\infty\), \(\mathrm{d}\varphi\) is its differential and \(\abs{\mathrm{d}\varphi}\) its Riemannian norm. We denote by \(v[\varphi](x)\) the differential \(\mathrm{d}\varphi(x) \cdot v\) of \(\varphi\) in the direction of \(v \in T_x \MM\) at the point \(x \in \MM\). Let denote the set of test function by \(C_P^\infty(\MM)\), the set of smooth functions whose derivatives of all orders have polynomial growth and satisfy estimates of the form \[\abs{E_{d_q}[\dots E_{d_1}[\varphi]\dots]}(x) \leq C(1+{r(x)}^K) , \quad \text{ for } q=0,1,\dots\]

Let \(F : x \mapsto \underset{d=1}{\overset{D}{\sum}} f^d(x) E_d(x)\) be a vector field and its unique decomposition in the orthonormal frame, then \(F\) is an element of \(\mathfrak{X}_P(\mathcal{M})\) if \(f^d \in C_P^\infty(\MM)\) and if its components are Lipschitz, that is, \(\abs{\mathrm{d}f^d} \leq C\). Equipped with the Jacobi bracket \({[-,-]}_J\), the space \((\mathfrak{X}_P(\mathcal{M}),{[-,-]}_J)\) is a Lie algebra.

Definition 1. The Weitzenböck affine connection \(\vartriangleright : \mathfrak{X}_P(\mathcal{M}) \times \mathfrak{X}_P(\mathcal{M}) \to \mathfrak{X}_P(\mathcal{M})\), is given by \[(X \vartriangleright Y) = (X [Y^d]) E_d.\] We extend this notation to functions by \(X \vartriangleright \varphi=X[\varphi]\).

Remark 1. The choice of the Weitzenböck connection was already implicitly made in [15]. It can be shown that its associated curvature vanishes. If one further assumes that the torsion \(T\) is constant, then \((\mathfrak{X}_P(\mathcal{M}),\vartriangleright, -T)\) is a post-Lie algebra [31].

In the spirit of [9], [31], [35], let the differential operators on \(\MM\) be given by the tensor algebra \(T(\mathfrak{X}_P(\mathcal{M}))\) whose product is denoted by \(\cdot\). Differential operators act on functions \(\varphi\) by: \[(X_1 \cdots X_n)\vartriangleright \varphi = x^{i_1}_1 \cdots x^{i_n}_n E_{i_1} [ \ldots E_{i_n}[\varphi] \ldots ],\] where \(X_j=\sum_{i_j=1}^D x^{i_j}_j E_{i_j}\) is the unique decomposition of the vector field \(X_j\) in the frame basis.

Remark 2. The Laplace-Beltrami operator is expressed by \[\Delta \varphi = \underset{d=1}{\overset{D}{\sum}} \left( E_d\cdot E_d - \nabla_{E_d}E_d \right)\vartriangleright\varphi .\]

The product \(\vartriangleright\) extends to \(T(\mathfrak{X}_P(\mathcal{M}))\) by the so-called Guin-Oudom process [36], [37], which extends straightforwardly in a curvature-free setting (see [9]). The space of differential operators \((T(\mathfrak{X}_P(\mathcal{M})),\cdot, \Delta_{\sqcup\mathchoice{\mkern-4.8mu}{\mkern-4.5mu}{\mkern-4.5mu}{\mkern-4.5mu}\sqcup})\) is a Hopf algebra when equipped with the deshuffle coproduct [31], [35]. In the context of a connection with constant torsion, \((T(\mathfrak{X}_P(\mathcal{M})),\cdot, \Delta_{\sqcup\mathchoice{\mkern-4.8mu}{\mkern-4.5mu}{\mkern-4.5mu}{\mkern-4.5mu}\sqcup}, \vartriangleright)\) yields a post-Hopf algebra [38]. Note that taking into account the action of differential operators on functions would naturally yield post-Hopf algebroid structures [9], [39].

The generator \(\mathcal{L}\) of the SDE 1 is defined by \[\label{equation:generator} \mathcal{L} \varphi = \underset{d=1}{\overset{D}{\sum}} (f^d E_d + (E_d\cdot E_d)) \vartriangleright\varphi.\tag{6}\] In the case of the Langevin equation 2 , the generator is expressed as \[\label{equation:generator32Langevin} \mathcal{L} \varphi = - \nabla V [\varphi] + \Delta \varphi.\tag{7}\] To ensure that the equation 1 is well-posed and that the solution does not blow up, we shall assume the following.

Assumption 1. The vector fields \(E_1,\dots,E_D\) are smooth and bounded. The vector field \(F\) belongs to \(\mathfrak{X}_P(\mathcal{M})\). The generator satisfies \[\label{equation:elliptic} \mathcal{L}r^2 \leq \nu + \lambda r^2\qquad{(1)}\] on \(\mathcal{M}\setminus \mathrm{Cut}_o\) for some constants \(\lambda \in\mathbb{R}\) and \(\nu \geq 1\).

There exist various criteria which ensure that inequality ?? is satisfied. The first criterion is compactness, which can be used for classical manifolds such as the sphere \(\mathbb{S}^n\) and the Lie group \(SO_q(\mathbb{R})\). This condition being seldom satisfied, a second classical criterion is the Bakry-Émery criterion from [2]. This criterion applies to the case of equation 1 , where the generator writes as 7 . One says that the potential \(V\) satisfies the criterion if there exists \(\kappa \in \mathbb{R}\) such that \[\Ric + \Hess (V) \geq \kappa.\] The term \(\Ric\) designs the Ricci tensor on \((\mathcal{M},g)\) and is defined as the trace of the Riemann tensor. Note that this handy criterion has been adapted in [40] for equation 1 with a lower bound of the operator \(\Ric-\nabla F\). The moment conditions from [41] implies stochastic completeness.

Under Assumption 1, the equation 1 generates a Markovian semigroup on \(C_P^\infty(\MM)\). For all \(\varphi \in C_P^\infty(\MM)\), the function \(u : (t,x) \mapsto \mathbb{E} \left[ \varphi(X(t))\vert X(0) = x \right]\) satisfies the Kolmogorov equation \[\label{equation:Kolmogorov} \partial_t u = \mathcal{L}(u), \quad u(0,x) = \varphi(x).\tag{8}\] To the contrary to [9], we are interested in the behaviour in long time of the solution of 1 .

Definition 2. A process \(X\) is ergodic if there exists \(\mathrm{d}\mu_\infty\) a unique invariant measure with density function \(\rho_\infty\) with respect to \(\mathrm{d}\vol_\MM\), such that for all \(\varphi \in C_P^\infty(\MM)\) and for all initial condition \(X(0) \in \MM\), it follows that \[\underset{T \to \infty}{\lim} \frac{1}{T} \underset{0}{\overset{T}{\int}} \varphi(X(s))\mathrm{d}s = \displaystyle{ \int_{\mathcal{M}} } \varphi(y) \mathrm{d}\mu_\infty(y) \text{ almost surely,}\] where \(\mathrm{d}\vol_\mathcal{M}\) is the Riemannian measure on \(\MM\) defined in [42].

Definition 3. A numerical method 4 is ergodic if there exists \(\mathrm{d}\mu^h\) a unique invariant measure with density function \(\rho^h\) with respect to \(\mathrm{d}\vol_\MM\), such that for all \(\varphi \in C_P^\infty(\MM)\) and for all initial condition \(X(0) \in \MM\), it follows that \[\underset{N \to \infty}{\lim} \frac{1}{N+1} \underset{n=0}{\overset{N}{\sum}} \varphi(X_n) = \displaystyle{ \int_{\mathcal{M}} } \varphi(y) \rho^h(y) \mathrm{d}\vol_\mathcal{M}(y) \text{ almost surely.}\] The method is of order \(p \geq 1\) for the invariant measure if there exists \(h_0 > 0\) and \(C >0\) which depends on \(h_0\) and \(\varphi\) such that for all \(h \in (0,h_0)\), \[\label{equation:error} \abs{e(\varphi,h)} \leq C h^p \text{ with } e(\varphi,h) = \underset{N \to \infty}{\lim} \frac{1}{N+1} \underset{n=0}{\overset{N}{\sum}} \varphi(X_n) - \displaystyle{ \int_{\mathcal{M}} } \varphi(y) \mathrm{d}\mu_\infty(y).\qquad{(2)}\]

In the spirit of [34], the ergodicity of the stochastic process is a prerequisite of our analysis.

Assumption 2. Under Assumption 1, there exists a unique invariant measure \(\mathrm{d}\mu_\infty\) with density \(\rho_\infty\) with respect to \(\mathrm{d}\vol_\MM\) is the unique solution of the equation \[\mathcal{L}^*\mathrm{d}\mu_\infty = 0,\] with \(\mathcal{L}^*\) the adjoint of \(\mathcal{L}\) in \(L^2(\mathcal{M})\).

In the case of the Riemannian Langevin equation 2 , Assumption 2 is automatically satisfied and the density \(\rho_\infty\) is explicitly given by the Gibbs measure: \[\label{equation:Gibbs} \rho_\infty = e^{-V} / Z, \quad Z = \displaystyle{ \int_{\MM} } e^{-V} \mathrm{d}\vol_\MM.\tag{9}\]

Assumption 3. For all function \(g \in C_P^\infty(\MM)\) with zero mean on \(\MM\), there exists a unique function \(\mu \in C_P^\infty(\MM)\) such that \(\mathcal{L}^* \mu = g\) and \(\displaystyle{ \int_{\mathcal{M}} } \mu(y) \mathrm{d}\mu_\infty(y) = 0\).

The following assumption from [9], automatically satisfied on \(\mathbb{R}^d\), ensures the regularity of the semigroup 8 .

Assumption 4. For all function \(\varphi \in C_p^\infty(\mathcal{M})\), the map \[u : (t,x) \mapsto \mathbb{E} \left[ \varphi(X(t))\vert X_0 =x \right]\] belongs to \(C^\infty((0,T),C_P^\infty(\mathcal{M}))\), that is, for all \(k \geq 0\) there exist constants \(C > 0\) and \(\kappa \geq 0\) such that for all \(x \in \MM\) \[\underset{t \in (0,T)}{\sup} \abs{\partial^k_t u(t,x)} \leq C(1+r^\kappa_w(x))\abs{\varphi}_{C^{2N+2}}.\]

Hence, taking the limit as \(t \to \infty\) of the time integration of Equation 8 leads to, under Assumption 4, \[\label{equation:lim95u} \underset{t \to \infty}{\lim} u(t,x) = \varphi(x) + \int_0^\infty \mathcal{L} u(s,x) \mathrm{d}s.\tag{10}\] The following assumption is an ergodicity condition concerning convergence to the invariant measure. We introduce the following norm and seminorm: \[\left\Vert\psi \right\Vert_{C^k} = \underset{\underset{0 \leq \abs{j}\leq k}{j=(j_1,\dots,j_D)}}{\sup} \underset{x \in \mathcal{M}}{\sup} \abs{\partial_j \psi(x)} \text{ and } \abs{\psi}_{C^k} = \underset{\underset{1 \leq \abs{j}\leq k}{j=(j_1,\dots,j_D)}}{\sup} \underset{x \in \mathcal{M}}{\sup} \abs{\partial_j \psi(x)}.\]

Assumption 5. Equation 1 admits a spectral gap \(\lambda >0\): for every integer \(k \geq 0\) there exists a polynomial \(P_k\) such that for all \(t \geq 0\) and all \(\varphi \in C^\infty_P(\MM)\): \[\left\Vert u(t,\cdot) - \displaystyle{ \int_{\mathcal{M}} } \varphi(y) \rho_\infty(y) \mathrm{d}\vol_\mathcal{M}(y) \right\Vert_{C^k} \leq P_k(t) e^{-\lambda t} \left\Vert\varphi \right\Vert_{C^k}.\]

The Taylor expansion of the semigroup 8 satisfies the following.

Proposition 3. Under Assumption 4, for all function \(\varphi \in C^\infty_P(\MM)\) and \(h\) small enough, the following expansion holds \[u(h,x) = \varphi(x) + \underset{j=1}{\overset{p}{\sum}} \frac{h^j}{j!} \mathcal{L}^j \varphi(x) + h^{p+1} R^h_p(\varphi,x),\] where the remainder satisfies \(\abs{R^h_p(\varphi,x)} \leq C(1+r^\kappa_w(x))\).

Proof. A Taylor expansion yields: \[u(h,x) = \varphi(x) + \underset{j=1}{\overset{p}{\sum}} \frac{h^j}{j!} \mathcal{L}^j \varphi(x) + \int_0^t \frac{{(h-t)}^p}{p!} \partial_t^{p+1} u(t,x) \mathrm{d}t.\] Hence, the remainder satisfies \[\begin{align} \abs{R_p^h(\varphi,x)} = \abs{ \frac{h^{-1}}{p!} \int_0^t {(\frac{{(h-t)}}{h})}^p \partial_t^{p+1} u(t,x) \mathrm{d}t } \leq \frac{h^{-1}}{p!} \int_0^t C (1+{r(x)}^\kappa) \mathrm{d}t \leq \frac{C}{p!} (1+{r(x)}^\kappa), \end{align}\] where we use Assumption 4. ◻

Introduce the Taylor-Talay-Tubaro expansion [16] of the numerical scheme 4 and an assumption on its moments.

Assumption 6. For all function \(\varphi \in C^\infty_P(\mathcal{M})\) and \(h\) small enough, the expansion holds \[\mathbb{E} \left[ \varphi(X_1) | X_0 = x \right] = \varphi(x) + \underset{j=1}{\overset{p}{\sum}} h^j A_j \varphi(x) + h^{p+1} R^h_p(\varphi,x),\] where \(A_j\) is a linear differential operator of order \(2j\) and \(R^h_p(\varphi,x)\) is a remainder satisfying \[\abs{R^h_p(\varphi,x)} \leq C(1+r^\kappa_w(x))\abs{\varphi}_{C^{2p+2}}.\] In the case of a post-processed method 5 , the expansion is of the same form, \[\mathbb{E} \left[ \varphi(\overline{X}) | X \right] = \varphi(X) + \underset{j=1}{\overset{p}{\sum}} h^j \overline{A_j} \varphi(X) + h^{p+1} \overline{R}^h_p(\varphi,X),\] where \(\overline{R}^h_p(\varphi,x)\) satisfies \[\abs{\overline{R}^h_p(\varphi,x)} \leq C(1+r^\kappa_w(x))\abs{\varphi}_{C^{2p+2}}.\]

Remark 4. For most of the existing numerical methods that have a Taylor-Talay-Tubaro expansion, the differential operators \(A_j\) have a specific form. They typically write with the vector fields \(F\) and \((E_d)\) and their iterated covariant derivatives, that is, they write with the coordinates of the jet space over \(F\) and the frame \((E_d)\). In the specific case of stochastic Runge-Kutta methods, the \(A_j\) are equivariant with respect to orthogonal change of variables, which results in the \(A_j\) being naturally described by tree structures (see [22], [27]). The extension of such universal equivariance property to the frozen-flow methods used here is matter for future work.

Definition 4. Under Assumption 6, a method is consistent if \(A_1 = \mathcal{L}\). In the following, the consistency of the method is always considered true.

Assumption 7. The method 4 has finite moments, that is, for all \(\kappa >0\) and all \(T \in \mathbb{R}_+\) there exists a constant \(C(T) > 0\) such that: \[\underset{n=0 \dots N}{\sup} {\mathbb{E} \left[ {r(X_n)}^\kappa | X_0 = x \right] } \leq C(T).\]

2.2 High-order characterization of the invariant measure↩︎

Let us now state one of the central results of this work. We introduce new sufficient conditions to approximate the invariant measure, adapted from [34]. This result is key for designing the high-order numerical schemes 4 presented in Subsection 2.3. Proofs of Theorems 5 and 7, adapted from [10], [33], are posponed to Section 3.

Theorem 5. Consider the SDE 1 on \(\mathcal{M}\) satisfying Assumptions 13 and 5 and solved by an ergodic numerical method 4 satisfying Assumptions 2 and [assumption:3462] and \[A_j^* \mathrm{d}\mu_\infty = 0 \text{ for } j=2 \dots p.\] Then the method 4 is of order \(p\) for the invariant measure for equation 2 . More precisely, the error of the invariant measure \(e(\varphi,h)\) satisfies for all \(\varphi \in C_P^\infty\) and all \(h \in [0,h_0]\) for a small \(h_0\): \[e(\varphi,h) = h^p \int_{0}^{\infty} \displaystyle{ \int_{\mathcal{M}} } u(t,x) A_{p+1}^* \mathrm{d}\mu_\infty(x) \mathrm{d}t + \mathcal{O}(h^{p+1}).\]

Proposition 6. Under Assumptions 1467, and 2, if the Taylor expansion [assumption:3462] satisfies the same expression that in [9] \[A_j = \frac{1}{j!} \mathcal{L}^j, \quad j = 1,\dots,p,\] then the integrator is of order \(p\) for the invariant measure.

This characterization is extended to post-processed method 5 , in the spirit of [10].

Theorem 7. Under the same hypotheses as Theorem 5, consider a numerical consistent ergodic method of the form 5 that satisfies \[A_{j+1}^* \mathrm{d}\mu_\infty = \overline{A_j}^* \mathrm{d}\mu_\infty = 0 \text{ for } j= 1 \dots p-1, \quad {\left(A_{p+1}+[\mathcal{L},\overline{A_p}]\right)}^*\mathrm{d}\mu_\infty=0.\] Then the method is at least of order \(p+1\) for the invariant measure of equation 2 .

2.3 Post-processed frozen-flow methods of high order for sampling ergodic dynamics↩︎

In this section, we leverage Theorem 5 to derive a system of conditions whose resolution yields three new order-2 methods for accurately sampling the invariant measure. Higher orders can be obtained by extending the Taylor expansion to the desired degree. Our analysis focuses on frozen-flow schemes, which generalize classical Lie group methods [12], [13]. See Section 4 for details of the Butcher series formalism used on the Talay-Tubaro expansion.

Definition 5. For all \(p,q \in \MM\), \(\exp\left(t g^d(q) E_d\right) \cdot p\) is the solution of the ODE \[Y'(t) = g^d(q) E_d(Y(t)), \quad Y(0) = p.\]

Remark 8. The Euler method \(X_{n+1} = X_n + h f^d(X_n) + \sqrt{2h} \xi^d_n\) on \(\mathbb{R}^d\) becomes on \(\MM\) the frozen-flow Euler method: \[\label{equation:frozenEuler} X_{n+1} = \exp \left( \left( h f^d(X_n) + \sqrt{2h} \xi^d_n \right) E_d \right) X_n.\qquad{(3)}\] In general, the method ?? does not coincide with the Riemannian Langevin method: \[X_{n+1} = \exp^{Riem} \left( -h \nabla V (X_n) + \sqrt{2h} \xi^d_{n} E_d \right) X_n,\] for equation 2 , based on the Levi-Civita connection and proposed in [7].

Following [10] and the frozen-flow methods [9], we consider the following class of methods and we define with the same way the class for the post-processor 5 \[\overline{X}_N = \overline{\Psi}_h(X_N).\]

\[\begin{align} H_n^i = & \exp \left( \left( h Z^0_{i,j,K} f^d(H_n^j) + \sqrt{h} Z_{i,K}^d \xi^{d}_n \right) E_d \right) \cdots \notag \\ & \cdots \exp \left( \left( h Z^0_{i,j,1} f^d(H_n^j) + \sqrt{h} Z_{i,1}^d \xi^{d}_n \right) E_d \right) X_n, \notag \\ X_{n+1} = & \exp \left( \left( h z^0_{i,K} f^d(H_n^i) + \sqrt{h} z^d_{K} \xi^{d}_n \right) E_d \right) \cdots \label{equation:post-processed} \\ & \cdots \exp \left( \left( h z^0_{i,1} f^d(H_n^i) + \sqrt{h} z^d_{1} \xi^{d}_n \right) E_d \right) X_n, \notag \end{align}\tag{11}\] where the \(\xi^{d}_n,\overline{\xi^{d}_N}\) are independent standard Gaussian random variables and where the \(Z^0_{i,j,k},z^0_{i,k},z^d_{k},Z^d_{i,k},\overline{z_{k}^{d}},\overline{z^0_{i,k}},\overline{Z_{i,k}^{d}},\overline{Z^0_{i,j,k}}\) are fixed real numbers.

Remark 9. As a forest of ordre \(p\) contains at most \(2p\) trees, one only needs to consider approximations of Gaussian random variables with finite moments of all order and the same \(2p\) first moments that includes vanishing odd moments.

Definition 6. For a finite subset \(S \subset {\{1,\dots,K\}}^n\) of multi-indices and for \(f: S \to \mathbb{R}\), the factorial sum is given by \[\underset{\mathbf{k} \in S}{^!\sum} f(\mathbf{k}) = \underset{\mathbf{k} \in S}{\sum} \frac{1}{\mathbf{k}!} f(\mathbf{k}) , \quad (k_1,\ldots,k_n)! = k_1 ! \cdots k_n ! .\]

We now express the general method as an exotic S-serie (see Definition 9), with the coefficient map of the numerical methods \(a_w\), and the algebraic formalism of Section 4.

Proposition 10. The expression of the first-order coefficients of a method of the form 11 are given by \[A_1 \varphi (x) = \underset{k}{{\sum}} z^0_{i,k} f^i(x) E_i[\varphi](x) + \underset{k_2 \leq k_1}{{^!\sum}} z_{k_1}^{d_1} z_{k_2}^{d_1} E_{d_1} [ E_{d_1}[\varphi]](x) .\] For the second order, the expression of coefficients of \(A_2\) are given in Table [table:tableau95Coefficient95general].

*ccrccc \(\pi\) & Differential op.\(\mathbb{F}^F(\pi)\) & Coeff.\(a_w(\pi)\) of \(A_2\) & Coeff.\(\left[ \mathcal{L}, \overline{A_1} \right]\)
\(\tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[b] at (0.0, 1.0) { } } ; }\) & \(f^j E^j[f^i] E_i[\varphi]\) & \(\underset{k}{{\sum}} z^0_{i,k} Z^0_{i,j,k}\) & \(0\)
\(\tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (-0.5, 1.0) { 1 } } child {node[lc] at (0.5, 1.0) { 1 } } ; }\) & \(E_{d_1} [ E_{d_1}[f^i]]E_i[\varphi]\) & \(\underset{k}{{\sum}} \underset{k_2 \leq k_1}{{^!\sum}} z^0_{i,k} Z_{i,k_2}^{d_1} Z_{i,k_1}^{d_1}\) & \(C_{ \left[ \mathcal{L}, \overline{A_1} \right]}\)
\(\tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; \node[b] at (1.0, 0.4) { } ; }\) & \(f^j f^i E_j[E_i[\varphi]]\) & \(\underset{k_2 \leq k_1}{{^!\sum}} z^0_{j,k_2} z^0_{i,k_1}\) & \(0\)
\(\tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 1 } } ; \node[lc] at (1.0, 0.0) { 1 } ; }\) & \(E_{d_1}[f^i] E_i[E_{d_1}[\varphi]]\) & \(\underset{k}{{\sum}} \underset{k_2 \leq k_1}{{^!\sum}} (z_{i,k}^{d_1} z^0_{i,k_2}) z_{k_1}^{d_1}\) & \(0\)
\(\tikz[planar forest ] { \node[lc] at (0.0, 0.0) { 1 } ; \node[b] at (1.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 1 } } ; }\) & \(E_{d_1}[f^i] E_{d_1}[E_i[\varphi]]\) & \(\underset{k}{{\sum}} \underset{k_2 \leq k_1}{{^!\sum}} z_{k_2}^{d_1} (z_{i,k}^{d_1} z^0_{i,k_1})\) & \(2 C_{ \left[ \mathcal{L}, \overline{A_1} \right]}\)
\(\tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[lc] at (2.0, 0.4) { 1 } ; }\) & \(f^i E_i[E_{d_1}[E_{d_1}[\varphi]]]\) & \(\underset{k_3 \leq k_2 \leq k_1}{{^!\sum}} z^0_{i,k_3} z_{k_2}^{d_1} z_{k_1}^{d_1}\) & \(-C_{ \left[ \mathcal{L}, \overline{A_1} \right]}\)
\(\tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[b] at (1.0, 0.4) { } ; \node[lc] at (2.0, 0.4) { 1 } ; }\) & \(f^i E_{d_1}[E_i[E_{d_1}[\varphi]]]\) & \(\underset{k_3 \leq k_2 \leq k_1}{{^!\sum}} z_{k_3}^{d_1} z^0_{i,k_2} z_{k_1}^{d_1}\) & \(0\)
\(\tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[b] at (2.0, 0.4) { } ; }\) & \(f^i E_{d_1}[E_{d_1}[E_i[\varphi]]]\) & \(\underset{k_3 \leq k_2 \leq k_1}{{^!\sum}} z_{k_3}^{d_1} z_{k_2}^{d_1} z^0_{i,k_1}\) & \(C_{ \left[ \mathcal{L}, \overline{A_1} \right]}\)
\(\tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 2 } ; \node[lc] at (1.0, 0.4) { 2 } ; \node[lc] at (2.0, 0.4) { 1 } ; \node[lc] at (3.0, 0.4) { 1 } ; }\) & \(E_{d_2}[E_{d_2}[E_{d_1}[E_{d_1}[\varphi]]]]\) & \(\underset{k_4 \leq k_3 \leq k_2 \leq k_1}{{^!\sum}} z_{k_4}^{d_2}z_{k_3}^{d_2}z_{k_2}^{d_1}z_{k_1}^{d_1}\) & \(0\)
\(\tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 2 } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[lc] at (2.0, 0.4) { 2 } ; \node[lc] at (3.0, 0.4) { 1 } ; }\) & \(E_{d_2}[E_{d_1}[E_{d_2}[E_{d_1}[\varphi]]]]\) & \(\underset{k_4 \leq k_3 \leq k_2 \leq k_1}{{^!\sum}} z_{k_4}^{d_2}z_{k_3}^{d_1}z_{k_2}^{d_2}z_{k_1}^{d_1}\) & \(0\)
\(\tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0, 0.4) { 2 } ; \node[lc] at (2.0, 0.4) { 2 } ; \node[lc] at (3.0, 0.4) { 1 } ; }\) & \(E_{d_1}[E_{d_2}[E_{d_2}[E_{d_1}[\varphi]]]]\) & \(\underset{k_4 \leq k_3 \leq k_2 \leq k_1}{{^!\sum}} z_{k_4}^{d_1}z_{k_3}^{d_2}z_{k_2}^{d_2}z_{k_1}^{d_1}\) & \(0\)*

Remark 11. The use of a post-processor only modifies the order conditions by the coefficient \(C_{ \left[ \mathcal{L}, \overline{A_1} \right]} = \underset{k}{{\sum}} \overline{z}^0_{i,k} - \underset{k_2 \leq k_1}{{^!\sum}} \overline{z}_{k_1}^{d_1} \overline{z}_{k_2}^{d_1}.\) If \(\overline{A_1} \propto \mathcal{L}\), we thus recover the order conditions without post-processor.

Since we only express our conditions in terms of exotic forests, to simplify the notation, we add the coefficients of \(\left[ \mathcal{L}, \overline{A_1} \right]\), in the post-processed case, in thoses of \(A_2\).

Using the Butcher series formalism of Section 4, we obtain a set of conditions that ensures the order 2 for the invariant measure of equation 2 .

Theorem 12. Under the assumptions of Theorems 5 and 7, a method 4 or a post-processed method 5 is of order 2 for the invariant measure for equation 2 if the following 5 order conditions are satisfied: \[a_w({ \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[b] at (0.0, 1.0) { } } ; }}) = a_w({ \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (-0.5, 1.0) { 1 } } child {node[lc] at (0.5, 1.0) { 1 } } ; }}) , \quad a_w({ \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[lc] at (2.0, 0.4) { 1 } ; }}) = a_w({ \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 2 } ; \node[lc] at (1.0, 0.4) { 2 } ; \node[lc] at (2.0, 0.4) { 1 } ; \node[lc] at (3.0, 0.4) { 1 } ; }}) , \quad a_w({ \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 1 } } ; \node[lc] at (1.0, 0.0) { 1 } ; }}) + a_w({ \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 2 } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[lc] at (2.0, 0.4) { 2 } ; \node[lc] at (3.0, 0.4) { 1 } ; }}) = a_w({ \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[b] at (1.0, 0.4) { } ; \node[lc] at (2.0, 0.4) { 1 } ; }}) ,\] \[a_w({ \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[b] at (0.0, 1.0) { } } ; }}) + a_w({ \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[b] at (2.0, 0.4) { } ; }}) = a_w({ \tikz[planar forest ] { \node[lc] at (0.0, 0.0) { 1 } ; \node[b] at (1.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 1 } } ; }}) + a_w({ \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0, 0.4) { 2 } ; \node[lc] at (2.0, 0.4) { 2 } ; \node[lc] at (3.0, 0.4) { 1 } ; }}) , \quad a_w({ \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; \node[b] at (1.0, 0.4) { } ; }}) + a_w({ \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0, 0.4) { 2 } ; \node[lc] at (2.0, 0.4) { 2 } ; \node[lc] at (3.0, 0.4) { 1 } ; }}) = a_w({ \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 1 } } ; \node[lc] at (1.0, 0.0) { 1 } ; }}) + a_w({ \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[b] at (2.0, 0.4) { } ; }}) .\]

**Proof.* Table 1 gives the reduction of exotic forests of order 2. Therefore, the S-series \[A_2 \varphi = S_h(a_w) \vartriangleright \varphi\] can be expressed as a linear combination of irreducible forests, whose coefficients provide the second-order conditions. The details are postponed to Subsection 4.2. ◻*

Remark 13. Recall from [24], for \(\MM = \mathbb{R}^D\), the forests are not ordered and there are one condition for the first order and three for the second one.

Remark 14. For the second order, there are 5 equations with 11 variables and for the third order, there are 40 equations and with 95 variables. We recall from [9] that for the weak error, there are 8 equations for the order 2 and 73 for the order 3, so the invariant measure allows for a significant reduction of the number of order conditions.

We propose the following new post-processed frozen-flow method to solve equation 2 . In the Euclidean setting, Method 1 rewrites as the Leimkuhler-Matthews method [18] with the post-processor formulation from [10].

Figure 1: Post-processed frozen-flow method for equation 2

Corollary 1. Method 1 is explicit, of order 2 for the invariant measure of equation 2 and weak order one, and uses one evaluation of \(F\) and three exponential maps per step.

We propose two alternative schemes without post-processors to solve equation 2 , for the sake of comparison.

Figure 2: Stochastic frozen-flow Heun method for equation 2
Figure 3: 2-steps frozen-flow Runge-Kutta method for equation 2

Corollary 2. Methods 2 and 3 are of first order for the weak error and of second order for the invariant measure of equation 2 .

3 High order analysis for the invariant measure↩︎

In this subsection, we generalize the analysis of [33] to Riemannian manifolds and prove Theorem 5 and Theorem 7.

Let \({(P_t)}_{t\geq0}\) be the semigroup associated to the Markov process \({(X(t,x))}_{t\geq0,x\in\mathcal{M}}\), in other words, \({(P_t)}_{t\geq0}\) gives to \(\psi\) a smooth function on \(\mathcal{M}\), the unique solution \(u\) of the Kolmogorov equation 8 . In the spirit of backard analysis [33], [43], let us build a modified generator \(\tilde{\mathcal{L}_\tau}\) such that the solution of the problem \[\partial_t v(t,x) = \tilde{\mathcal{L}_\tau} v , \quad v(0,x) = \varphi(x),\] at the time \(t = \tau\), coincides with the numerical flow, that is \[\exp \left( \tau \tilde{\mathcal{L}_\tau} \right) = \id + \underset{n \geq 1}{\sum} \tau^n A_n.\] Thus the expansion yields \[\tilde{\mathcal{L}_\tau} = \underset{k = 0}{\overset{n}{\sum}} \tau^k L_k + R_n , \quad R_n = \underset{k \geq n+1}{{\sum}} \tau^k L_k .\] Define \(\pi_n : P \mapsto n! {\left({\partial_\tau}^n P\right)}_{| \tau = 0}\), then \[\begin{align} A_n & = \pi_n \left( \exp \left( \tau \tilde{\mathcal{L}_\tau} \right) \right) = \underset{k \geq 0}{\sum} \frac{1}{k!} \pi_n \left( \tau^k \tilde{\mathcal{L}_\tau}^k \right) \\ & = \underset{k = 1}{\overset{n}{\sum}} \frac{1}{k!} \pi_{n-k} \left( \tilde{\mathcal{L}_\tau}^k \right) = \underset{k = 1}{\overset{n}{\sum}} \frac{1}{k!} \pi_{n-k} \left( { \left( L_0 + \tau L_1 + \cdots + \tau^n L_n + R_n \right) }^k \right) \\ & = \underset{k = 1}{\overset{n}{\sum}} \frac{1}{k!} \pi_{n-k} \left( \underset{j = 0}{\overset{nk}{\sum}} \tau^j \underset{i_1+ \cdots +i_k = j}{\sum} L_{i_1} \cdots L_{i_k} \right) \\ & = \underset{k = 1}{\overset{n}{\sum}} \frac{1}{k!} \underset{i_1+ \cdots +i_k = n-k}{\sum} L_{i_1} \cdots L_{i_k} , \end{align}\] where we use \(\pi_p (R_n) = 0\) when \(p \leq n\). Thus \(\left(L_n\right)_{n \in\mathbb{N}}\) satisfies the recurrence relation \[L_0 = A_1 = \mathcal{L} , \quad L_n = A_{n+1} - \underset{k = 2}{\overset{n+1}{\sum}} \frac{1}{k!} \underset{i_1+ \cdots +i_k = n+1-k}{\sum} L_{i_1} \cdots L_{i_k}.\]

Proposition 15. Let \(\varphi\) be in \(C_P^\infty(\mathcal{M})\). Under Assumptions 5 and [assumption:3462], there exists a sequence \(\left(v_l\right)_{l \in\mathbb{N}}\), such that for all \(n \geq 0\): \[\partial_t v_n(t,x) - \mathcal{L} v_n(t,x) = \underset{l=1}{\overset{n}{\sum}} L_l v_{n-l}(t,x), \quad v_0(0,x) = \varphi(x), \quad v_n(0,x) \equiv 0 \text{ for } n > 0.\] Let \(v^N(t,x) = \underset{n=0}{\overset{N}{\sum}} \tau^n v_n(t,x)\), the we have \[\left\Vert\mathbb{E} \left[ v^N(t,X_1) \right] -v^N(t+\tau,x) \right\Vert_\infty \leq C_N \tau^{N+1} \underset{n=0,\dots N}{\underset{s \in (0,\tau)}{\sup}}\left\Vert v_n(t_j+s,x) \right\Vert_{C^{4N+2}}.\]

Proof. For \(N=0\), set \(v_0 :(t,x) \mapsto u(t,x)\). By induction, assume \(v_0,\dots,v_N\) are defined and denote \(F_{N+1}(t,x) = \underset{l=1}{\overset{n+1}{\sum}} L_l v_{n+1-l}(t,x)\). Then the Duhamel formula ensures that \[v_{N+1}(t,x) = \int_0^t P_{t-s} F_{N+1}(s,x)\mathrm{d}s.\] Assumption 5 implies for all \(n \geq 0\), \(v_n\) is smooth and \[\label{equation:44613} \left\Vert v_n(t) \right\Vert_{C^k} \leq C \left\Vert\varphi \right\Vert_{C^{k+4n}}.\tag{12}\] The case \(n=0\) is ensured by Assumption 5. Suppose that equation 12 is true for \(0,\dots,n\). As \(L_l\) is of order \(2+2\), then for all \(l=1,\dots,n+1\), \[\left\Vert L_l v_{n+1-l}(t) \right\Vert_{C^k} \leq C \left\Vert v_{n+1-l}(t) \right\Vert_{C^{k+2l+2}}\] and by induction \(\left\Vert v_{n+1-l}(t) \right\Vert_{C^{k+2l+2}} \leq C \left\Vert\varphi \right\Vert_{C^{(k+2l+2)+4(n+1-l)}}\), that is \[\left\Vert F_{n+1}(t) \right\Vert_{C^k} \leq C \left\Vert\varphi \right\Vert_{C^{k+4(n+1)}}.\] Thus, from Assumption 5, we obtain \[\left\Vert P_{t-s} F_{n+1}(s) \right\Vert_{C^{k}} \leq P_k(t-s) e^{-\lambda (t-s) } \left\Vert F_{n+1}(s) \right\Vert_{C^{k}},\] and \[\left\Vert v_{n+1}(t) \right\Vert_{C^k} \leq C \left\Vert\varphi \right\Vert_{C^{k+4(n+1)}}.\] Hence the proof by induction.

Fix \(t \geq 0\) and set \(w_n : (s,x) \mapsto v_n(t+s,x)\). Then \(w_n\) satisfies \[\partial_s w_n(s,x) - \mathcal{L} w_n(s,x) = \underset{l=1}{\overset{n}{\sum}} L_l w_{n-l}(s,x), \quad w_n(0,x) = v_n(t,x).\] Hence \(\partial_s w_n(s,x) = \underset{l=0}{\overset{n}{\sum}} L_l w_{n-l}(s,x)\), \[\partial_s^2 w_n(s,x) = \underset{l=0}{\overset{n}{\sum}} L_l \underset{k=0}{\overset{n-l}{\sum}} L_k w_{n-l-k}(s,x) = \underset{k=0}{\overset{n}{\sum}} \underset{l_1+l_2=k}{\sum} L_{l_1} L_{l_2} w_{n-k}(s,x),\] and by induction, it follows \[\partial_s^m w_n(s,x) = \underset{l_1+ \cdots +l_{m+1}=n}{\sum} L_{l_1} \dots L_{l_m} w_{l_{m+1}}(s,x).\] Noticing that \(L_l\) are differentials operators of order \(2l+2>0\), the inegality holds \[\left\Vert\partial_s^m w_n(s,x) \right\Vert_\infty \leq C \underset{k=0,\dots,n}{\sup} \abs{w_k(s)}_{C^{2n+2m}}.\] A Taylor expansion yields, for the order \(2N-n\), \[\begin{align} w_n(\tau,x) = & \underset{m=0}{\overset{2N-n}{\sum}} \frac{\tau^m}{m!} \partial_s^m w_n(0,x) + \int_0^\tau \frac{{(\tau-s)}^{2N-n}}{(2N-n)!} \partial_s^{2N-n+1} w_n(s,x) \mathrm{d}s \\ = & \underset{m=0}{\overset{2N-n}{\sum}} \frac{\tau^m}{m!} \underset{l_1+ \cdots +l_{m+1}=n}{\sum} L_{l_1} \dots L_{l_m} w_{l_{m+1}}(0,x) + R_{2N,n}(\tau,x), \end{align}\] where \[\left\Vert R_{2N,n}(\tau) \right\Vert_\infty \leq C \tau^{2N-n+1} \underset{k=0,\dots 2N}{\underset{s \in (0,\tau)}{\sup}}\left\Vert w_k(s,x) \right\Vert_{C^{4N+2}} \leq C \tau^{N+1}.\] On one hand, we have \[\begin{align} v^N(t+\tau,x) = & \underset{n=0}{\overset{N}{\sum}} \underset{m=0}{\overset{2N-n}{\sum}} \frac{\tau^{m+n}}{m!} \underset{l_1+ \cdots +l_{m+1}=n}{\sum} L_{l_1} \dots L_{l_m} w_{l_{m+1}}(0,x) + R_{2N}(\tau,x) \\ = & \underset{p=0}{\overset{2N}{\sum}} \tau^p \underset{m=0}{\overset{p}{\sum}} \frac{1}{m!} \underset{l_1+ \cdots +l_{m}=p-m-l_{m+1}}{\sum} L_{l_1} \dots L_{l_m} w_{l_{m+1}}(0,x) + R_{2N}(\tau,x) \\ = & \underset{p=0}{\overset{2N}{\sum}} \tau^p \underset{q=0}{\overset{p}{\sum}} \left( \underset{m=0}{\overset{p-q}{\sum}} \frac{1}{m!} \underset{l_1+ \cdots +l_{m}=p-q-m}{\sum} L_{l_1} \dots L_{l_m} \right) w_{q}(0,x) + R_{2N}(\tau,x) \\ = & \underset{p=0}{\overset{2N}{\sum}} \tau^p \underset{q=0}{\overset{p}{\sum}} A_{p-q} w_{q}(0,x) + R_{2N}(\tau,x). \end{align}\] On the other hand, we have \[\begin{align} \underset{n=0}{\overset{N}{\sum}} \tau^n A_n v^N(t+\tau,x) = & \underset{n=0}{\overset{N}{\sum}} \tau^n A_n \left( \underset{q=0}{\overset{N}{\sum}} \tau^q v_q(t+\tau,x) \right) \\ = & \underset{n=0}{\overset{N}{\sum}} \underset{q=0}{\overset{N}{\sum}} \tau^{n+q} A_n v_q(t+\tau,x) \\ = & \underset{q=0}{\overset{N}{\sum}} \underset{p=0}{\overset{N+q}{\sum}} \tau^{p} A_{p-q} v_q(t+\tau,x) \\ = & \underset{p=0}{\overset{2N}{\sum}} \tau^p \underset{p-q\leq N}{\underset{q=0}{\overset{p}{\sum}}} A_{p-q} w_{q}(0,x) + R_{2N}(\tau,x). \end{align}\] Thus, the modified flow satisfies \[\begin{align} v^N(t+\tau,x) - \underset{n=0}{\overset{N}{\sum}} \tau^n A_n v^N(t+\tau,x) = & \underset{p=0}{\overset{2N}{\sum}} \tau^p \underset{p-q > N}{\underset{q=0}{\overset{p}{\sum}}} A_{p-q} w_{q}(0,x) + R_{2N}(\tau,x) \\ = & \underset{p=N+1}{\overset{2N}{\sum}} \tau^p \underset{q=0}{\overset{p-(N+1)}{\sum}} A_{p-q} w_{q}(0,x) + R_{2N}(\tau,x), \end{align}\] and \[\begin{align} \abs{v^N(t+\tau,x) - \underset{n=0}{\overset{N}{\sum}} \tau^n A_n v^N(t+\tau,x)} & \leq C \tau^{N+1} \underset{n=0,\dots N}{\sup}\left\Vert v_n(t,x) \right\Vert_{C^{4N}} \\ & + C \tau^{N+1} \underset{k=0,\dots 2N}{\underset{s \in (0,\tau)}{\sup}}\left\Vert w_k(s,x) \right\Vert_{C^{4N+2}} . \end{align}\] Applying Assumption 6 with \(\varphi = v^N(t)\) gives \[\begin{align} \left\Vert\mathbb{E} \left[ v^N(t,X_1) \right] -v^N(t+\tau,x) \right\Vert_\infty \leq & \left\Vert\mathbb{E} \left[ v^N(t,X_1) \right] - \underset{n=0}{\overset{N}{\sum}} \tau^n A_n v^N(t+\tau,x) \right\Vert_\infty \\ + & \left\Vert\underset{n=0}{\overset{N}{\sum}} \tau^n A_n v^N(t+\tau,x) - v^N(t+\tau,x) \right\Vert_\infty \\ \leq & C_N \tau^{N+1} \underset{n=0,\dots N}{\underset{s \in (0,\tau)}{\sup}}\left\Vert v_n(t_j+s,x) \right\Vert_{C^{4N+2}}. \end{align}\] Hence the result. ◻

We construct a sequence of measure which weakly converges to the invariant measure of the numerical method 4 .

Lemma 1. Under Assumptions 235 and 6, let \(\left(v_n\right)_{n \in\mathbb{N}}\) and \(\left(v^{N}\right)_{N \in\mathbb{N}}\) be defined as in Proposition 15. There exists \(\left(\rho_n\right)_{n \in\mathbb{N}}\) such that \(\rho_0 = \rho_\infty\) and for all \(N \geq 1\): \[\displaystyle{ \int_{\mathcal{M}} } \rho_N(y) \mathrm{d}\vol_\mathcal{M}(y) = 0, \quad \mathcal{L}^* \rho_{N} \mathrm{d}\vol_\mathcal{M} = \underset{n=1}{\overset{N}{\sum}} L_n^* \rho_{N-n} \mathrm{d}\vol_\mathcal{M}.\]

Proof. Let us show by induction the existence of the sequence \(\left(\rho_n\right)_{n \in\mathbb{N}}\). For \(n=0\), set \(\rho_0 = \rho_\infty\). Suppose having constructed \(\rho_0,\dots,\rho_N\) that satisfy these conditions. Then, set \(G_{N+1}= \underset{n=1}{\overset{N}{\sum}} L_n^* \rho_{N-n} \mathrm{d}\vol_\mathcal{M}\). The function \(G_{N+1}\) is smooth and its integral is \[\displaystyle{ \int_{\mathcal{M}} } G_{N+1}(x) \mathrm{d}\vol_\mathcal{M}(x) = - \underset{n=1}{\overset{N}{\sum}} \displaystyle{ \int_{\mathcal{M}} } \rho_{N-n}(x) L_n \mathbb{1}(x) \mathrm{d}\vol_\mathcal{M}(x)=0,\] as \(L_n\) is a differential operator of order \(2n+2\). By Assumption 3, there exists \(\rho_{N+1} \in C_P^\infty(\mathcal{M})\) such that \(\mathcal{L}^* \rho_{N+1} \mathrm{d}\vol_\mathcal{M} = G_{N+1}\) and \(\displaystyle{ \int_{\mathcal{M}} } \rho_{N+1}(y) \mathrm{d}\mu_\infty (y) =0\), which concludes the induction. ◻

Proposition 16. Under Assumptions 235, and 6, let \(\left(v_n\right)_{n \in\mathbb{N}}\) and \(\left(F_n\right)_{n \in\mathbb{N}}\) be defined as in Proposition 15. For all \(n,k \geq 0\), there exists a polynomial \(P_{k,n}\) such that \[\left\Vert v_n(t,x) - \displaystyle{ \int_{\mathcal{M}} } \varphi(y) \rho_n(y) \mathrm{d}\vol_\mathcal{M}(y) \right\Vert \leq P_{k,n}(t)e^{-\lambda t} \left\Vert\varphi - \left\langle\varphi \right\rangle \right\Vert_{C^{k+4n}}.\]

Proof. For \(n=0\), \(v_0=u\) and \(\rho_0=\rho_\infty\) and by Assumption 5, for all integer \(k\), we have \[\left\Vert u- \left\langle\varphi \right\rangle \right\Vert_{C^k} \leq P_k(t)e^{-\lambda t} \left\Vert\varphi - \left\langle\varphi \right\rangle \right\Vert_{C^k}.\] Suppose that the induction is true for \(0 ,\dots, n\). Setting \[{c_{n+1}(t) = \underset{m=0}{\overset{n+1}{\sum}} \displaystyle{ \int_{\mathcal{M}} } v_{n+1-m}(t,x) \rho_m(x) \mathrm{d}\vol_\mathcal{M}(x)} , \quad\] then \(c_{n+1}\) is derivable and its derivative is \[\begin{align} c_{n+1}'(t) = & \underset{m=0}{\overset{n+1}{\sum}} \displaystyle{ \int_{\mathcal{M}} } \partial_t v_{n+1-m}(t,x) \rho_m(x) \mathrm{d}\vol_\mathcal{M}(x) \\ = & \underset{m=0}{\overset{n+1}{\sum}} \displaystyle{ \int_{\mathcal{M}} } \partial_t v_{m}(t,x) \rho_{n+1-m}(x) \mathrm{d}\vol_\mathcal{M}(x) \\ = & \underset{m=0}{\overset{n+1}{\sum}} \displaystyle{ \int_{\mathcal{M}} } \underset{l=0}{\overset{m}{\sum}} L_{m-l} v_l(t,x) \rho_{n+1-m}(x) \mathrm{d}\vol_\mathcal{M}(x) \\ = & \underset{m=0}{\overset{n+1}{\sum}} \underset{l=0}{\overset{m}{\sum}} \displaystyle{ \int_{\mathcal{M}} } v_l(t,x) L_{m-l}^* \rho_{n+1-m}(x) \mathrm{d}\vol_\mathcal{M}(x) \\ = & \underset{l=0}{\overset{n+1}{\sum}} \displaystyle{ \int_{\mathcal{M}} } v_l(t,x) \left( \underset{m=l}{\overset{n+1}{\sum}} L_{m-l}^* \rho_{n+1-m}(x) \right) \mathrm{d}\vol_\mathcal{M}(x) \\ = & \underset{l=0}{\overset{n+1}{\sum}} \displaystyle{ \int_{\mathcal{M}} } v_l(t,x) \left( \underset{r=0}{\overset{n+1-l}{\sum}} L_{r}^* \rho_{n+1-r-l}(x) \right) \mathrm{d}\vol_\mathcal{M}(x). \end{align}\] Although, by definition of \(\rho_{n}\), we have \(\underset{r=0}{\overset{n+1-l}{\sum}} L_{r}^* \rho_{n+1-r-l} \mathrm{d}\vol_\mathcal{M} = 0\), so \(c_{n+1}\) is constant and \[\displaystyle{ \int_{\mathcal{M}} } \partial_t v_{n+1}(t,x) \mathrm{d}\mu_\infty (x) = - \underset{m=1}{\overset{n+1}{\sum}} \displaystyle{ \int_{\mathcal{M}} } \partial_t v_{n+1-m}(t,x) \rho_{m}(x) \mathrm{d}\vol_\mathcal{M}(x).\] In addition, the computation of the mean \(F_{n+1}\) with respect to the measure \(\rho_\infty\) ensures \[\begin{align} \left\langle F_{n+1}(t) \right\rangle = & \displaystyle{ \int_{\mathcal{M}} } F_{n+1}(t,x) \mathrm{d}\mu_\infty (x) \\ = & \displaystyle{ \int_{\mathcal{M}} } \left(\partial_t v_{n+1}(t,x) - \mathcal{L} v_{n+1}(t,x)\right) \mathrm{d}\mu_\infty (x) \\ = & - \underset{m=1}{\overset{n+1}{\sum}} \displaystyle{ \int_{\mathcal{M}} } \partial_t v_{n+1-m}(t,x) \rho_{m}(x) \mathrm{d}\vol_\mathcal{M}(x), \end{align}\] by Proposition 15 and \(\mathcal{L}^* \mathrm{d}\mu_\infty = 0\). By computing the expression of \(v_{n+1}\), we find \[\begin{align} v_{n+1}(t,x) = & \int_0^t \left\langle F_{n+1}(s) \right\rangle \mathrm{d}s + \int_0^t P_{t-s} \left( F_{n+1}(s,x) \left\langle F_{n+1}(s) \right\rangle \right) \mathrm{d}s \\ = & - \underset{m=1}{\overset{n+1}{\sum}} \displaystyle{ \int_{\mathcal{M}} } v_{n+1-m}(t,x) \rho_{m}(x) \mathrm{d}\vol_\mathcal{M}(x) + \displaystyle{ \int_{\mathcal{M}} } \varphi(x) \rho_{n+1}(x)\mathrm{d}\vol_\mathcal{M}(x) \\ + & \int_0^t P_{t-s} \left( F_{n+1}(s,x) \left\langle F_{n+1}(s) \right\rangle \right) \mathrm{d}s. \end{align}\] We have \[\begin{align} \underset{m=1}{\overset{n+1}{\sum}} & \displaystyle{ \int_{\mathcal{M}} } v_{n+1-m}(t,x) \rho_{m}(x) \mathrm{d}\vol_\mathcal{M}(x) = \\ & \underset{m=1}{\overset{n+1}{\sum}} \displaystyle{ \int_{\mathcal{M}} } \left( v_{n+1-m}(t,x) - \displaystyle{ \int_{\mathcal{M}} } \varphi(y) \rho_{n+1-m}(y) \mathrm{d}\vol_\mathcal{M}(y) \right) \rho_{m}(x) \mathrm{d}\vol_\mathcal{M}(x), \end{align}\] as the mean of \(\rho_m\) is zero. Moreover, the inequality holds \[\begin{align} \left\Vert F_{n+1}(s) - \left\langle F_{n+1}(s) \right\rangle \right\Vert_{C^k} \leq & \underset{l=1}{\overset{n+1}{\sum}} \left\Vert L_l v_{n+1}(s) - \left\langle L_l v_{n+1}(s) \right\rangle \right\Vert_{C^k} \\ \leq & C_k \underset{l=1}{\overset{n+1}{\sum}} \left\Vert v_{n+1-l}(s) - \left\langle v_{n+1-l}(s) \right\rangle \right\Vert_{C^{k+2l+2}} \\ \leq & C_k \underset{l=0}{\overset{n}{\sum}} \left\Vert v_{l}(s) - \left\langle v_{l}(s) \right\rangle \right\Vert_{C^{k+2(n+1-l)+2}}, \end{align}\] and, the proof is concluded by \[\begin{align} \Vert v_{n+1}(t,x) & - \displaystyle{ \int_{\mathcal{M}} } \varphi(x) \rho_{n+1}(x)\mathrm{d}\vol_\mathcal{M}(x) \Vert_{C^k} \\ \leq & \underset{m=1}{\overset{n+1}{\sum}} \left\Vert v_{n+1-m}(t,x) - \displaystyle{ \int_{\mathcal{M}} } \varphi(y) \rho_{n+1-m}(y) \mathrm{d}\vol_\mathcal{M}(y) \right\Vert_{C^k} \displaystyle{ \int_{\mathcal{M}} } \abs{\rho_{m}(x)} \mathrm{d}\vol_\mathcal{M}(x) \\ + & \int_0^t p_k(t-s) e^{-\lambda (t-s)} \left\Vert F_{n+1}(s) - \left\langle F_{n+1}(s) \right\rangle \right\Vert_{C^k} \mathrm{d}s \\ \leq & P_{k,n+1}(t) e_{-\lambda t} \left\Vert\varphi - \left\langle\varphi \right\rangle \right\Vert_{C^{4+4(n+1)}}, \end{align}\] by induction and Assumption 5. ◻

To be able to prove Theorem 5, we recall a lemma from [34], that is the central result for the proof of the theorem.

Lemma 2. Under the same assumptions of Lemma 1 and Proposition 16, setting \(\rho_N^h = \underset{n=0}{\overset{N}{\sum}} h^n \rho_{n}\), there exists \(C_N >0\) such that \[\abs{ \displaystyle{ \int_{\mathcal{M}} } \varphi(y) \rho^h(y) \mathrm{d}\vol_\mathcal{M}(y) - \displaystyle{ \int_{\mathcal{M}} } \varphi(y) \rho_N^h(y) \mathrm{d}\vol_\mathcal{M}(y) } \leq C_N \left\Vert\varphi \right\Vert_{C^{8N+10}} h^{N+1}.\]

**Proof.* We bound the difference between \(\mathbb{E} \left[ \varphi(X_p) \right]\) and the mean of \(\varphi\) with respect to the measure \(\rho_N^h\), \[\begin{align} \mathbb{E} \left[ \varphi(X_p) \right] - & v^{N+1}(t_p,x) = \mathbb{E} \left[ v^{N+1}(0,X_p) \right] - v^{N+1}(t_p,x) \\ = & \mathbb{E} \left[ \underset{j=0}{\overset{p-1}{\sum}} \mathbb{E} \left[ v^{N+1}(t_j,X_{p-j}) - v^{N+1}(t_{j+1},X_{p-(j+1)}) \vert X_{p-(j+1)} \right] \right] \\ = & \mathbb{E} \left[ \underset{j=0}{\overset{p-1}{\sum}} \mathbb{E} \left[ v^{N+1}(t_j,X_1(X_{p-(j+1)})) - v^{N+1}(t_{j+1},X_{p-(j+1)}) \vert X_{p-(j+1)} \right] \right]. \end{align}\] However, we recall Proposition 15, \[\begin{array}{l} \mathbb{E} \left[ v^{N+1}(t_j,X_1(X_{p-(j+1)})) - v^{N+1}(t_{j+1},X_{p-(j+1)}) \vert X_{p-(j+1)} \right] \\ \leq C_N \tau^{N+2} \underset{n=0,\dots N}{\underset{s \in (0,\tau)}{\sup}}\left\Vert v_n(t_j+s,x) \right\Vert_{C^{4N+6}}. \end{array}\] It follows that \[\begin{align} \mathbb{E} \left[ \varphi(X_p) \right] - v^{N+1}(t_p,x) \leq & C_N \tau^{N+2} \underset{j=0}{\overset{p-1}{\sum}} \underset{n=0,\dots N}{\underset{s \in (0,\tau)}{\sup}}\left\Vert v_n(t_j+s,x) \right\Vert_{C^{4N+6}} \\ \leq & C_N \tau^{N+2} \underset{j=0}{\overset{p-1}{\sum}} Q_N(t_j) e^{-\lambda t_j} \left\Vert\varphi \right\Vert_{C^{8N+10}} \\ \leq & C_N \tau^{N+1} \left\Vert\varphi \right\Vert_{C^{8N+10}}. \end{align}\] Since \(v^{N+1}(t_p,x) = v^{N}(t_p,x) + \tau^{N+1} v_{N+1}(t_p,x)\) and \(\left\Vert v_{N+1}(t_p,x) \right\Vert_{C^0} \leq C_N \left\Vert\varphi \right\Vert_{C^{4(N+1)}}\), we find \[\abs{ \mathbb{E} \left[ \varphi(X_p) \right] - v^{N}(t_p,x) } \leq C_N \tau^{N+1} \left\Vert\varphi \right\Vert_{C^{8N+10}}.\] Hence \[\begin{align} & \abs{ \mathbb{E} \left[ \varphi(X_p) \right] - \displaystyle{ \int_{\mathcal{M}} } \varphi(y) \rho_N^h(y) \mathrm{d}\vol_\mathcal{M}(y) } \\ & \leq \abs{ \mathbb{E} \left[ \varphi(X_p) \right] - v^{N}(t_p,x) } + \abs{ v^{N}(t_p,x) - \displaystyle{ \int_{\mathcal{M}} } \varphi(y) \rho_N^h(y) \mathrm{d}\vol_\mathcal{M}(y) } \\ & \leq C_N \tau^{N+1} \left\Vert\varphi \right\Vert_{C^{8N+10}} + \underset{n=0}{\overset{N}{\sum}} P_{0,N}(t_p) e^{-\lambda t_p} \left\Vert\varphi \right\Vert_{C^{0+4n}} \\ & \leq \left( C_N \tau^{N+1} + P_N(t_p) e^{-\lambda t_p} \right) \left\Vert\varphi \right\Vert_{C^{8N+10}}. \end{align}\] Hence the result by taking the limit in \(p\). ◻*

With this analysis, we now prove the Theorem 5.

Proof of Theorem 5. Under Assumptions 3, we set the sequence \(\left(\rho_n\right)_{n \in\mathbb{N}}\) defined in Lemma 1. The error is defined by \[e(\varphi,h) = \underset{N \to \infty}{\lim} \frac{1}{N+1} \underset{n=0}{\overset{N}{\sum}}\varphi(X_n) - \displaystyle{ \int_{\mathcal{M}} } \varphi(y) \mathrm{d}\mu_\infty (y)\] and since \(\left(X_n\right)_{n \in\mathbb{N}}\) is ergodic, we have \[\underset{N \to \infty}{\lim} \frac{1}{N+1} \underset{n=0}{\overset{N}{\sum}} \varphi(X_n) = \displaystyle{ \int_{\mathcal{M}} } \varphi(y) \rho^h(y) \mathrm{d}\vol_\mathcal{M}(y).\] Our aim is to show that \[\begin{align} \displaystyle{ \int_{\mathcal{M}} } \varphi(y) \rho^h(y) \mathrm{d}\vol_\mathcal{M}(y) = & \displaystyle{ \int_{\mathcal{M}} } \varphi(y) \mathrm{d}\mu_\infty (y) \\ + & h^r \int_{0}^{\infty} \displaystyle{ \int_{\mathcal{M}} } u(t,x) A_{r+1}^* \mathrm{d}\mu_\infty(x) + \mathcal{O}(h^{r+1}). \end{align}\] Lemma 1 gives a sequence \(\left(\rho_n\right)_{n \in\mathbb{N}}\) such that \(\rho_0 = \rho_\infty\), and for all \(N \geq 1\) \[\displaystyle{ \int_{\mathcal{M}} } \rho_N(y) \mathrm{d}\vol_\mathcal{M}(y) = 0 \text{ and } \mathcal{L}^* \mathrm{d}\mu_N = \underset{l=1}{\overset{N}{\sum}} L_l^* \mathrm{d}\mu_{N-l}.\] Moreover, we have \[\abs{ \displaystyle{ \int_{\mathcal{M}} } \varphi(y) \rho^h(y) \mathrm{d}\vol_\mathcal{M}(y) - \displaystyle{ \int_{\mathcal{M}} } \varphi(y) \rho_N^h(y) \mathrm{d}\vol_\mathcal{M}(y) } \leq C h^{N+1}.\] For all \(n=1,\dots,r-1\), \(\mathcal{L}^*\mathrm{d}\mu_n = A_n^* \mathrm{d}\mu_\infty = L_n^* \mathrm{d}\mu_\infty = 0\) and \(\rho_n = 0\) stands by induction. Thus the inequality of Lemma 2 ensures that \[\abs{ \displaystyle{ \int_{\mathcal{M}} } \varphi(y) \rho^h(y) \mathrm{d}\vol_\mathcal{M}(y) - \displaystyle{ \int_{\mathcal{M}} } \varphi(y) \rho_r^h(y) \mathrm{d}\vol_\mathcal{M}(y) } \leq C_r \left\Vert\varphi \right\Vert_{C^{8r+10}} h^{r+1}.\] However \(\rho_r^h(y) = \rho_\infty + h^r \rho_r\) and \[\abs{ e(\varphi,h) - h^r \displaystyle{ \int_{\mathcal{M}} } \varphi(y) \rho_r(y) \mathrm{d}\vol_\mathcal{M}(y) } \leq C_r \left\Vert\varphi \right\Vert_{C^{8r+10}} h^{r+1}.\] The integration of equation 8 , ensures \(u(t,x) = \varphi(x) + \int_0^t \mathcal{L} u (s,x) \mathrm{d}s\) and by ergodicity \[\underset{t \to \infty}{\lim}u(t,x) = \displaystyle{ \int_{\mathcal{M}} } \varphi(y) \mathrm{d}\mu_\infty (y).\] So by using that the mean of \(\rho_r\) is zero and that, by ergodicity and equation 10 , \[\varphi(x) = \displaystyle{ \int_{\mathcal{M}} } \varphi(y) \mathrm{d}\mu_\infty (y) - \int_0^\infty \mathcal{L}u(s,x) \mathrm{d}s,\] we obtain \[\begin{align} \displaystyle{ \int_{\mathcal{M}} } \varphi(x) \rho_r(x) \mathrm{d}\vol_\mathcal{M}(x) = & - \displaystyle{ \int_{\mathcal{M}} } \int_0^\infty \mathcal{L}u(s,x) \rho_r(x) \mathrm{d}s \mathrm{d}\vol_\mathcal{M}(x) \\ = & - \int_0^\infty \displaystyle{ \int_{\mathcal{M}} } u(s,x) \mathcal{L}^*\mathrm{d}\mu_r(x) \mathrm{d}\vol_\mathcal{M}(x) \mathrm{d}s \\ = & \int_0^\infty \displaystyle{ \int_{\mathcal{M}} } u(s,x) A_{r+1}^*\mathrm{d}\mu_\infty(x) \mathrm{d}s, \end{align}\] where \(\mathcal{L}^*\mathrm{d}\mu_r = A_{r+1}^* \mathrm{d}\mu_\infty\) as in the induction. ◻

We conclude this section by the proof of Theorem 7.

Proof of Theorem 7. Theorem 7 is proven by applying Theorem 5 with \(\varPhi = \varphi \circ G\) where \(\varphi\) is a test function and \(G\) is the post-processor. First, we compute the term of error of the composition. \[\begin{align} \displaystyle{ \int_{\MM} } \varPhi(y) \rho_\infty(y) \mathrm{d}\vol_\MM (y) = & \displaystyle{ \int_{\MM} } \varphi(y) \rho_\infty(y) \mathrm{d}\vol_\mathcal{M}(y) + \underset{j=1}{\overset{p-1}{\sum}} h^j \displaystyle{ \int_{\MM} } \overline{A_j} \varphi(y) \rho_\infty(y) \mathrm{d}\vol_\mathcal{M}(y) \\ + & h^p \displaystyle{ \int_{\MM} } \overline{A_p} \varphi(y) \rho_\infty(y) \mathrm{d}\vol_\mathcal{M}(y) + \mathcal{O}(h^{p+1}), \end{align}\] however by Assumption 2, the sum is zero. Hence by equation 10 , it follows \[\begin{align} \displaystyle{ \int_{\MM} } \overline{A}_p \varphi(y) \mathrm{d}\mu_\infty (y) = & \left( \displaystyle{ \int_{\MM} } \left( \displaystyle{ \int_{\MM} } \varphi(z) \mathrm{d}\mu_\infty (z) \right) \overline{A}_p^* \mathrm{d}\mu_\infty(y) \right) \\ & - \displaystyle{ \int_{\mathcal{M}} } \left( \int_{0}^{\infty} \mathcal{L} u(y,t) \mathrm{d}t \right) \overline{A}_p^* \mathrm{d}\mu_\infty(y) \\ = & - \int_{0}^{\infty} \displaystyle{ \int_{\mathcal{M}} } u(y,t) \left(- \left[ \mathcal{L}, \overline{A}_p \right]^*\right) \mathrm{d}\mu_\infty (y) \mathrm{d}t \\ = & - \int_{0}^{\infty} \displaystyle{ \int_{\mathcal{M}} } u(y,t) A_{p+1}^* \mathrm{d}\mu_\infty(y) \mathrm{d}t \end{align}\] where hypotheses \({(A_{p+1}+[\mathcal{L},\overline{A_p}])}^*\mathrm{d}\mu_\infty=0\) and \(\mathcal{L}^*\mathrm{d}\mu_\infty = 0\) are used. We remark that is it the term of order \(p\) in the error of Theorem 5. Now, Theorem 5 can be applied with \(\varPhi = \varphi \circ G\) and a computation shows that \[\begin{align} \underset{N \to \infty}{\lim} \frac{1}{N+1} \underset{n=0}{\overset{N}{\sum}} \varphi(\overline{X}_n) - \displaystyle{ \int_{\mathcal{M}} } \varphi(y) \mathrm{d}\mu_\infty (y) = & \mathcal{O}(h^{p+1}). \end{align}\] Thus \(\left(\overline{X}_n\right)_{n \in\mathbb{N}}\) is of order \(p+1\). ◻

4 Intrinsic order conditions for the invariant measure↩︎

In this section, we use the algebraic framework of exotic Lie-Butcher series introduced in [9] to derive the order conditions for sampling the invariant measure. After recalling the notion of planar exotic forests, we present a new operation \(\mathop{\mathrm{IBP}}\) on forests, derived from the Riemannian integration by parts, to express the adjoint of the operators \(A_n\) and generalise [22], [24]. The approach is successfully applied through Theorem 5 and Theorem 7 to derive the conditions of Theorem 12. We then discuss the form of the exotic Lie-Butcher series describing the adjoint of the operators \(A_n\) with irreducible forests.

4.1 Planar exotic forests↩︎

We recall the structure of planar exotic forests, in the spirit of [9] which generalize standard B-series [43][45] to SDEs on manifolds.

Definition 7. A decorated tree \((\pi,\alpha)\) with the decoration set \(D\) is a connected oriented graph \(\pi = (V,E)\) with the vertices \(V\) and the edges \(E\subset V\times V\), in which each node has exactly one outgoing edge except for one node, called the root, that has none. The map \(\alpha : V \to D\) decorates each vertex. A decorated tree is called planar if for all node \(v \in V\), the set \(\Pi(v)\) of predecessors of \(v\) is ordered. An ordered, possibly empty, list of planar decorated trees is called a planar decorated forest.

An exotic forest is a planar decorated forest with the decorations \(D = \{\bullet\} \cup \mathbb{N}\), \(\mathbb{N} = \{1,2,\ldots\}\) which follows the following rules: if an integer is used as decoration then it must decorate exactly two leaves. Two exotic trees \((\pi_1,\alpha_1)\) and \((\pi_2,\alpha_2)\) are identical if \(\pi_1=\pi_2\) and if there exists an application \(\psi : D \mapsto D\) such that \(\psi(\bullet) = \bullet\), \(\mathchoice{\setbox 1{\displaystyle \psi}_{\scriptstyle \mathbb{N}} {\psi\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\,\mathbb{N}}} {\setbox 1{\textstyle \psi}_{\scriptstyle \mathbb{N}} {\psi\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\,\mathbb{N}}} {\setbox 1{\scriptstyle \psi}_{\scriptscriptstyle \mathbb{N}} {\psi\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\,\mathbb{N}}} {\setbox 1{\scriptscriptstyle \psi}_{\scriptscriptstyle \mathbb{N}} {\psi\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\,\mathbb{N}}}\) induces an automorphism of \(\mathbb{N}\) and \(\alpha_1 = \psi \circ \alpha_2\). Define \(V_{ \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }}\) as the set of nodes of \(\pi\) decorated by \(\tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }\) and \(V_L = \{ \{v,w\} \subset V | \alpha_w(v) = \alpha_w(w) \}\) as the set of pairly decorated nodes, that we call lianas. The set of exotic forests is \(EF\), the associated vector space is \(\mathcal{EF}=\Span_\R(EF)\).

The order of a forest \(\pi\in EF\) is defined by \[\abs{\pi} =\abs{ V_{ \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }} } + \abs{V_L}.\] We denote \(\mathcal{EF}_{k}\) the vector space spanned by exotic forests of order equal to \(k\), and \(\mathcal{EF}_{\leq k}\) the vector space spanned by exotic forests of order lower than or equal to \(k\).

Example 17. The forests of order 1 are \(\tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }\) and \(\tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0,0.4) { 1 } ; }\). The space \(\mathcal{EF}_{2}\) is generated by the following 11 forests: \[\tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[b] at (0.0, 1.0) { } } ; }, \quad \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (-0.5, 1.0) { 1 } } child {node[lc] at (0.5, 1.0) { 1 } } ; }, \quad \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; \node[b] at (1.0, 0.4) { } ; }, \quad \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 1 } } ; \node[lc] at (1.0, 0.0) { 1 } ; }, \quad \tikz[planar forest ] { \node[lc] at (0.0, 0.0) { 1 } ; \node[b] at (1.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 1 } } ; }, \quad \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[lc] at (2.0, 0.4) { 1 } ; }, \quad \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[b] at (1.0, 0.4) { } ; \node[lc] at (2.0, 0.4) { 1 } ; }, \quad \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[b] at (2.0, 0.4) { } ; }, \quad \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 2 } ; \node[lc] at (1.0, 0.4) { 2 } ; \node[lc] at (2.0, 0.4) { 1 } ; \node[lc] at (3.0, 0.4) { 1 } ; }, \quad \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 2 } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[lc] at (2.0, 0.4) { 2 } ; \node[lc] at (3.0, 0.4) { 1 } ; }, \quad \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0, 0.4) { 2 } ; \node[lc] at (2.0, 0.4) { 2 } ; \node[lc] at (3.0, 0.4) { 1 } ; }.\] There are 95 forests of order 3.

Definition 8. Let the map \(\mathbb{F}^F : \mathcal{EF}\to T(\mathcal{\mathfrak{X}}_P(\MM))\) be defined for \(\pi \in EF\) and \(\varphi\in C_P^\infty(\MM)\) by \[\mathbb{F}^F (\pi) \vartriangleright \varphi = \underset{v \in V}{\underset{i_v = 1}{\overset{D}{\sum}}} \left( \underset{\{v,w\} \in V_L}{\prod} \delta_{i_v=i_w} \right) \left( \underset{v \in V_{ \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }}}{\prod} E_{I_{\Pi(v)}} \left[ f^{i_v} \right] \right) E_{I_{R}} [\varphi],\] where \(R\) is the set of roots of \(\pi\), \(\Pi(v)\) is the set of predecessors of \(v\), both ordered from right to left, \(i_v\) is the indice associated to the node \(v\) then and \(E_I[g] = E_{i_p}[\ldots E_{i_1}[g] \ldots]\) if the set of indices is \(I = (i_p,\ldots,i_1)\). If \(\{v,w\}\) is a liana, i.e., they share the same integer as decoration, then the Kronecker symbol \(\delta_{i_v=i_w}\) ensures that they share the same indice, i.e., \(i_v=i_w\).

From [9], the operator \(\mathbb{F}^F: (\mathcal{EF},\cdot) \to (T(\mathcal{\mathfrak{X}}_P(\MM)),\cdot)\) is a Hopf algebra morphism. In particular, \(\mathbb{F}^F\) satisfies \[\mathbb{F}^F(\pi_1\cdot \pi_2)=\mathbb{F}^F(\pi_1)\cdot \mathbb{F}^F(\pi_2).\]

Definition 9. Given a one form \(a \in EF^*\), called a coefficient map, an exotic Lie S-series is the following formal power series in \(h\) in \(T(\mathcal{\mathfrak{X}}_P(\MM))\), \[S_h(a) \vartriangleright \varphi = \underset{\pi \in EF}{\sum} h^{\abs{\pi}} a(\pi) \mathbb{F}^F(\pi) \vartriangleright \varphi.\]

In the following, we denote by \(a_w\) the coefficient map of the numerical flow, that is the unique coefficient map \(a_w : \mathcal{EF}\to \mathbb{R}\) such that \[\mathbb{E} \left[ \varphi(X_1)\vert X_0 = x \right] = S_h(a_w) \vartriangleright \varphi .\]

4.2 Integration by parts for the invariant measure↩︎

The derivation of the order conditions for the invariant measure is performed using multiple integration by parts of the Taylor-Talay-Tubaro expansion against the invariant measure. In this context, the use of an orthonormal frame proves crucial to ensure that the operations rewrite with planar exotic forests.

Proposition 18. For \(\varphi,\psi \in C_P^\infty(\MM)\), the following integration by parts with respect to the Gibbs measure 9 holds: \[\displaystyle{ \int_{\MM} } E_i[\varphi] \psi \mathrm{d}\mu_\infty = - \displaystyle{ \int_{\MM} } \varphi E_i[\psi] \mathrm{d}\mu_\infty - \displaystyle{ \int_{\MM} } \varphi \psi f^i \mathrm{d}\mu_\infty,\] where \(F = f^j E_j\) is given by 3 .

Proof. We recall the general integration by part’s formula [42], [46], for \(X = x^i E_i \in \mathfrak{X}_P(\MM)\), \[\displaystyle{ \int_{\mathcal{M}} } X[\varphi] \mathrm{d}\vol_\mathcal{M} = - \displaystyle{ \int_{\mathcal{M}} } \varphi \Div(X) \mathrm{d}\vol_\mathcal{M} = - \displaystyle{ \int_{\mathcal{M}} } \varphi \left( x^i \Div(E_i) + E_i [x^i] \right) \mathrm{d}\vol_\mathcal{M}.\] Then, by applying the formula to the invariant measure with \(X = \psi \rho_\infty E_i\), we have \[\begin{align} \displaystyle{ \int_{\mathcal{M}} } E_i[\varphi] \psi \mathrm{d}\mu_\infty = & - \displaystyle{ \int_{\mathcal{M}} } \varphi \left( \psi \Div(E_i) + E_i[\psi] - \psi E_i[V] \right) \mathrm{d}\mu_\infty \\ = & - \displaystyle{ \int_{\mathcal{M}} } \varphi E_i[\psi] \mathrm{d}\mu_\infty - \displaystyle{ \int_{\mathcal{M}} } \varphi \psi \left(\Div(E_i) - E_i[V]\right) \mathrm{d}\mu_\infty. \end{align}\] Proposition 18 holds if \(\Div(E_i) - E_i[V] = f^i\). Recall the correction term 3 that is \(f^i = -E_i[V] -g(\nabla_{E_d}E_d , E_i)\) in the orthonormal basis \(\{E_1,\dots,E_D\}\). Hence, Proposition 18 holds if \(\Div (E_i) = - g(\nabla_{E_d}E_d , E_i)\). However, by definition of the operator \(\Div(H) = g(\nabla_{E_d}H , E_p)\) for all \(H\in \mathfrak{X}_P(\MM)\), the Koszul formula [42], [46] ensures that \[\begin{align} 2 g(\nabla_{E_d} E_i, E_d) = & E_d \bigl(g(E_i,E_d)\bigr) + E_i \bigl(g(E_d,E_d)\bigr) - E_d \bigl(g(E_d,E_i)\bigr) \\ + & g([E_d,E_i],E_d) - g([E_i,E_d], E_d) - g([E_d,E_d], E_i) \\ = & 2 g([E_d,E_i],E_d). \end{align}\] Similarly, one finds \(2 g(\nabla_{E_d}E_d , E_i) = - 2 g([E_d,E_i],E_d)\). Hence the result. ◻

Example 19. Proposition 18 yields for \(\varphi = E_d[\phi]\) and \(\psi \equiv 1\). \[\displaystyle{ \int_{\mathcal{M}} } ((E_d \cdot E_d) \vartriangleright \phi) \mathrm{d}\mu_\infty = - \displaystyle{ \int_{\mathcal{M}} } f^d (E_d \vartriangleright \phi) \mathrm{d}\mu_\infty.\] We thus recover \[\mathcal{L}^* \mathrm{d}\mu_\infty = {\left( f^d E_d + (E_d \cdot E_d) \right)}^* \mathrm{d}\mu_\infty = 0.\]

Remark 20. In general, Proposition 18 does not yield elementary differentials that can be represented as exotic forests. For \(\psi = f^i\), the terms \(E_i[f^i]\) and \(f^i f^i\) appear, which cannot be represented by exotic forests. Such terms are called aromas and yield the larger space of exotic aromatic forests in the Euclidean case [4], [25], [27]. The use of aromas is out of the scope of the present paper.

Let us now identify the exotic forests whose integration by part does not write with on exotic forests.

Definition 10. The set of irreducible forests \(\mathop{\mathrm{I_{R}}}\) is the set of exotic forest whose first tree is not a numbered node. If \(\pi \notin \mathop{\mathrm{I_{R}}}\) and its first root is numbered by \(\tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\), we write \(\pi = \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\tilde{\pi}\) where \(\tilde{\pi}\) is a decorated forest. We denote \(\mathop{\mathrm{\mathcal{I}_\mathcal{R}}}= \Span_\R (\mathop{\mathrm{I_{R}}})\).

The integration by parts of planar exotic forests is defined as the following, which generalises the non-planar map in [24].

Definition 11. Define the linear operator \(\mathop{\mathrm{IBP}}: \mathcal{EF}\to \mathcal{EF}\) by \(\mathchoice{\setbox 1{\displaystyle \mathop{\mathrm{IBP}}}_{\scriptstyle \mathop{\mathrm{I_{R}}}} {\mathop{\mathrm{IBP}}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\,\mathop{\mathrm{I_{R}}}}} {\setbox 1{\textstyle \mathop{\mathrm{IBP}}}_{\scriptstyle \mathop{\mathrm{I_{R}}}} {\mathop{\mathrm{IBP}}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\,\mathop{\mathrm{I_{R}}}}} {\setbox 1{\scriptstyle \mathop{\mathrm{IBP}}}_{\scriptscriptstyle \mathop{\mathrm{I_{R}}}} {\mathop{\mathrm{IBP}}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\,\mathop{\mathrm{I_{R}}}}} {\setbox 1{\scriptscriptstyle \mathop{\mathrm{IBP}}}_{\scriptscriptstyle \mathop{\mathrm{I_{R}}}} {\mathop{\mathrm{IBP}}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\,\mathop{\mathrm{I_{R}}}}} \equiv 0\) and else \[\label{equation:IBP95def} \mathop{\mathrm{IBP}}(\pi ) = - \mathchoice{\setbox 1{\displaystyle \tilde{\pi}}_{\scriptstyle \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\to \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }} {\tilde{\pi}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\, \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\to \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }}} {\setbox 1{\textstyle \tilde{\pi}}_{\scriptstyle \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\to \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }} {\tilde{\pi}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\, \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\to \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }}} {\setbox 1{\scriptstyle \tilde{\pi}}_{\scriptscriptstyle \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\to \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }} {\tilde{\pi}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\, \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\to \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }}} {\setbox 1{\scriptscriptstyle \tilde{\pi}}_{\scriptscriptstyle \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\to \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }} {\tilde{\pi}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\, \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\to \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }}} - \underset{v \in V_{ \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }}}{\sum} \mathchoice{\setbox 1{\displaystyle \tilde{\pi}}_{\scriptstyle \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\curvearrowright v} {\tilde{\pi}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\, \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\curvearrowright v}} {\setbox 1{\textstyle \tilde{\pi}}_{\scriptstyle \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\curvearrowright v} {\tilde{\pi}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\, \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\curvearrowright v}} {\setbox 1{\scriptstyle \tilde{\pi}}_{\scriptscriptstyle \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\curvearrowright v} {\tilde{\pi}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\, \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\curvearrowright v}} {\setbox 1{\scriptscriptstyle \tilde{\pi}}_{\scriptscriptstyle \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\curvearrowright v} {\tilde{\pi}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\, \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\curvearrowright v}},\qquad{(4)}\] where \(\mathchoice{\setbox 1{\displaystyle \tilde{\pi}}_{\scriptstyle \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\to \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }} {\tilde{\pi}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\, \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\to \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }}} {\setbox 1{\textstyle \tilde{\pi}}_{\scriptstyle \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\to \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }} {\tilde{\pi}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\, \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\to \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }}} {\setbox 1{\scriptstyle \tilde{\pi}}_{\scriptscriptstyle \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\to \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }} {\tilde{\pi}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\, \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\to \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }}} {\setbox 1{\scriptscriptstyle \tilde{\pi}}_{\scriptscriptstyle \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\to \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }} {\tilde{\pi}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\, \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\to \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }}}\) is the exotic forest obtained by substituting the unique node \(\tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\) of \(\tilde{\pi}\) by \(\tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }\) and \(\mathchoice{\setbox 1{\displaystyle \tilde{\pi}}_{\scriptstyle \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\curvearrowright v} {\tilde{\pi}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\, \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\curvearrowright v}} {\setbox 1{\textstyle \tilde{\pi}}_{\scriptstyle \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\curvearrowright v} {\tilde{\pi}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\, \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\curvearrowright v}} {\setbox 1{\scriptstyle \tilde{\pi}}_{\scriptscriptstyle \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\curvearrowright v} {\tilde{\pi}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\, \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\curvearrowright v}} {\setbox 1{\scriptscriptstyle \tilde{\pi}}_{\scriptscriptstyle \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\curvearrowright v} {\tilde{\pi}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\, \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\curvearrowright v}}\) is the exotic forest obtained by left-grafting a node \(\tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\) on the node \(v\) of \(\tilde{\pi}\).

Remark 21. It is well known that Rota-Baxter algebras [47] are linked to the representation of integration by parts operations. The IBP operation does not exactly yield a Rota-Baxter structure thanks to the perturbation \(\mathchoice{\setbox 1{\displaystyle \tilde{\pi}}_{\scriptstyle \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\to \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }} {\tilde{\pi}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\, \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\to \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }}} {\setbox 1{\textstyle \tilde{\pi}}_{\scriptstyle \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\to \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }} {\tilde{\pi}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\, \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\to \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }}} {\setbox 1{\scriptstyle \tilde{\pi}}_{\scriptscriptstyle \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\to \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }} {\tilde{\pi}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\, \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\to \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }}} {\setbox 1{\scriptscriptstyle \tilde{\pi}}_{\scriptscriptstyle \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\to \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }} {\tilde{\pi}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\, \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { n } ; }\to \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }}}\) in equation ?? .

Examples 22. A direct application of Definition 11 yields: \[\begin{align} & \mathop{\mathrm{IBP}}( \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }+ \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0,0.4) { 1 } ; }) = - \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }, \quad \mathop{\mathrm{IBP}}( \tikz[planar forest ] { \node[lc] at (0.0, 0.0) { 1 } ; \node[b] at (1.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 1 } } ; }) = -( \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (-0.5, 1.0) { 1 } } child {node[lc] at (0.5, 1.0) { 1 } } ; }+ \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[b] at (0.0, 1.0) { } } ; }), \quad \mathop{\mathrm{IBP}}( \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0, 0.4) { 2 } ; \node[lc] at (2.0, 0.4) { 2 } ; \node[lc] at (3.0, 0.4) { 1 } ; }) = - \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[b] at (2.0, 0.4) { } ; }, \\ & \mathop{\mathrm{IBP}}( \tikz[planar forest ] { \node[lc] at (0.0, 0.0) { 2 } ; \node[lc] at (1.0, 0.0) { 1 } ; \node[b] at (2.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 1 } } ;\node[b] at (3.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 2 } } ; }) = -( \tikz[planar forest ] { \node[lc] at (0.0, 0.0) { 1 } ; \node[b] at (1.0, 0.0) { } child {node[lc] at (-0.5, 1.0) { 2 } } child {node[lc] at (0.5, 1.0) { 1 } } ;\node[b] at (2.5, 0.0) { } child {node[lc] at (0.0, 1.0) { 2 } } ; }+ \tikz[planar forest ] { \node[lc] at (0.0, 0.0) { 1 } ; \node[b] at (1.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 1 } } ;\node[b] at (2.5, 0.0) { } child {node[lc] at (-0.5, 1.0) { 2 } } child {node[lc] at (0.5, 1.0) { 2 } } ; }+ \tikz[planar forest ] { \node[lc] at (0.0, 0.0) { 1 } ; \node[b] at (1.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 1 } } ;\node[b] at (2.0, 0.0) { } child {node[b] at (0.0, 1.0) { } } ; }). \end{align}\]

We now derive an explicit expression of the adjoint operator \(A_j^*\) with irreducible forests. Since \(\mathop{\mathrm{IBP}}\) removes only the first numbered root, we iterate \(\mathop{\mathrm{IBP}}\) until the output is a linear combination of irreducible forests.

Definition 12. The linear reduction operator \(\mathop{\mathrm{RED}}\) on \(\mathcal{EF}\) is given by the following limit of stationary sequence: \[\mathop{\mathrm{RED}}= \underset{n \to \infty}{\lim} {\left( \id_{\mathop{\mathrm{\mathcal{I}_\mathcal{R}}}} + \mathop{\mathrm{IBP}}\right)}^n.\]

Examples 23. A direct application of Definition 12 yields: \[\begin{align} & \mathop{\mathrm{RED}}( \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }+ \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0,0.4) { 1 } ; }) = 0, \quad \mathop{\mathrm{RED}}( \tikz[planar forest ] { \node[lc] at (0.0, 0.0) { 1 } ; \node[b] at (1.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 1 } } ; }) = -( \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (-0.5, 1.0) { 1 } } child {node[lc] at (0.5, 1.0) { 1 } } ; }+ \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[b] at (0.0, 1.0) { } } ; }), \quad \mathop{\mathrm{RED}}( \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0, 0.4) { 2 } ; \node[lc] at (2.0, 0.4) { 2 } ; \node[lc] at (3.0, 0.4) { 1 } ; }) = \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; \node[b] at (1.0, 0.4) { } ; }- \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (-0.5, 1.0) { 1 } } child {node[lc] at (0.5, 1.0) { 1 } } ; }- \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[b] at (0.0, 1.0) { } } ; }, \\ & \mathop{\mathrm{RED}}( \tikz[planar forest ] { \node[lc] at (0.0, 0.0) { 2 } ; \node[lc] at (1.0, 0.0) { 1 } ; \node[b] at (2.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 1 } } ;\node[b] at (3.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 2 } } ; }) = \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (-0.5, 1.0) {1 }} child {node[lc] at (0.5, 1.0) { 2}} ; \node[b] at (2.0, 0.0) { } child {node[lc] at (-0.5, 1.0) {1 }} child {node[lc] at (0.5, 1.0) { 2}}; }+ \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (-0.5, 1.0) {1 }} child {node[lc] at (0.5, 1.0) { 2}} ; \node[b] at (2.0, 0.0) { } child {node[lc] at (-0.5, 1.0) {2 }} child {node[lc] at (0.5, 1.0) { 1}}; }+ \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (-0.5, 1.0) {1 }} child {node[lc] at (0.5, 1.0) { 1}} ; \node[b] at (2.0, 0.0) { } child {node[lc] at (-0.5, 1.0) {2 }} child {node[lc] at (0.5, 1.0) { 2}}; }+ \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (0.0, 1.0) {1 }} ; \node[b] at (2.0, 0.0) { } child {node[lc] at (-1.0, 1.0) {1 }} child {node[lc] at (0.0, 1.0) { 2}} child {node[lc] at (1.0, 1.0) { 2}}; }+ \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (-0.5, 1.0) {1 }} child {node[lc] at (0.5, 1.0) { 1}} ; \node[b] at (1.5, 0.0) { } child {node[b] at (0., 1.0) { }}; }+ \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (0.0, 1.0) {1 }} ; \node[b] at (1.5, 0.0) { } child {node[lc] at (-0.5, 1.0) { 1}} child {node[b] at (0.5, 1.0) { }}; }+ \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (-0.5, 1.0) {1 }} child {node[b] at (0.5, 1.0) { }} ; \node[b] at (1.5, 0.0) { } child {node[lc] at (0., 1.0) {1 }}; }+ \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[b] at (0.0, 1.0) { }} ; \node[b] at (1.5, 0.0) { } child {node[lc] at (-0.5, 1.0) { 1}} child {node[lc] at (0.5, 1.0) { 1}}; }+ \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[b] at (0.0, 1.0) { }} ; \node[b] at (1.0, 0.0) { } child {node[b] at (0., 1.0) { }} }. \end{align}\]

Definition 13. Two exotic forests \(\pi_1, \pi_2 \in \mathcal{EF}\) are equivalent, written \(\pi_1 \sim \pi_2\), if the associated differential operators satisfy \[\mathbb{F}^F {(\pi_1)}^*\mathrm{d}\mu_\infty = \mathbb{F}^F {(\pi_2)}^*\mathrm{d}\mu_\infty.\]

Proposition 24. For all \(\pi \in \mathcal{EF}\), \(\pi\) and \(\mathop{\mathrm{RED}}(\pi)\) represent the same adjoint operator, that is \[\pi \sim \mathop{\mathrm{RED}}(\pi) .\]

The algebraic characterization of Theorem 5 rewrites naturally with planar exotic forests.

Theorem 25. If the coefficient map \(a_w\) of a numerical method satisfies \[\underset{\pi \in EF_p}{\sum} a_w(\pi) \mathop{\mathrm{RED}}(\pi) = 0\] then its Talay-Tubaro expansion satisfies \(A_p^* \mathrm{d}\mu_\infty = 0\).

In order to compute the second order condition from Theorem 12, Table 1 gives the reduction of second order exotic forests.

Table 1: Reduction of exotic forests of order 2.
\(\pi\) \(\mathop{\mathrm{RED}}(\pi)\)
\(\tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[b] at (0.0, 1.0) { } } ; }\) \(\tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[b] at (0.0, 1.0) { } } ; }\)
\(\tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (-0.5, 1.0) { 1 } } child {node[lc] at (0.5, 1.0) { 1 } } ; }\) \(\tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (-0.5, 1.0) { 1 } } child {node[lc] at (0.5, 1.0) { 1 } } ; }\)
\(\tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; \node[b] at (1.0, 0.4) { } ; }\) \(\tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; \node[b] at (1.0, 0.4) { } ; }\)
\(\tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 1 } } ; \node[lc] at (1.0, 0.0) { 1 } ; }\) \(\tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 1 } } ; \node[lc] at (1.0, 0.0) { 1 } ; }\)
\(\tikz[planar forest ] { \node[lc] at (0.0, 0.0) { 1 } ; \node[b] at (1.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 1 } } ; }\) \(- \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[b] at (0.0, 1.0) { } } ; }- \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (-0.5, 1.0) { 1 } } child {node[lc] at (0.5, 1.0) { 1 } } ; }\)
\(\tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[lc] at (2.0, 0.4) { 1 } ; }\) \(\tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[lc] at (2.0, 0.4) { 1 } ; }\)
\(\tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[b] at (1.0, 0.4) { } ; \node[lc] at (2.0, 0.4) { 1 } ; }\) \(- \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; \node[b] at (1.0, 0.4) { } ; }- \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 1 } } ; \node[lc] at (1.0, 0.0) { 1 } ; }\)
\(\tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[b] at (2.0, 0.4) { } ; }\) \(\tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[b] at (0.0, 1.0) { } } ; }+ \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (-0.5, 1.0) { 1 } } child {node[lc] at (0.5, 1.0) { 1 } } ; }- \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; \node[b] at (1.0, 0.4) { } ; }\)
\(\tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 2 } ; \node[lc] at (1.0, 0.4) { 2 } ; \node[lc] at (2.0, 0.4) { 1 } ; \node[lc] at (3.0, 0.4) { 1 } ; }\) \(- \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[lc] at (2.0, 0.4) { 1 } ; }\)
\(\tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 2 } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[lc] at (2.0, 0.4) { 2 } ; \node[lc] at (3.0, 0.4) { 1 } ; }\) \(\tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; \node[b] at (1.0, 0.4) { } ; }+ \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 1 } } ; \node[lc] at (1.0, 0.0) { 1 } ; }\)
\(\tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0, 0.4) { 2 } ; \node[lc] at (2.0, 0.4) { 2 } ; \node[lc] at (3.0, 0.4) { 1 } ; }\) \(\tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; \node[b] at (1.0, 0.4) { } ; }- \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[b] at (0.0, 1.0) { } } ; }- \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (-0.5, 1.0) { 1 } } child {node[lc] at (0.5, 1.0) { 1 } } ; }\)

Proof of Theorem 12. By linearity and Proposition 24, the computation of Table 1 reduces the second order of the error for the invariant measure as \[\begin{align} \underset{\pi \in EF_2}{\sum} a_w(\pi) \mathop{\mathrm{RED}}(\pi) = & a \left( \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[b] at (0.0, 1.0) { } } ; }- \tikz[planar forest ] { \node[lc] at (0.0, 0.0) { 1 } ; \node[b] at (1.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 1 } } ; }+ \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[b] at (2.0, 0.4) { } ; }- \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0, 0.4) { 2 } ; \node[lc] at (2.0, 0.4) { 2 } ; \node[lc] at (3.0, 0.4) { 1 } ; }\right) \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[b] at (0.0, 1.0) { } } ; }\\ + & a \left( \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (-0.5, 1.0) { 1 } } child {node[lc] at (0.5, 1.0) { 1 } } ; }- \tikz[planar forest ] { \node[lc] at (0.0, 0.0) { 1 } ; \node[b] at (1.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 1 } } ; }+ \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[b] at (2.0, 0.4) { } ; }- \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0, 0.4) { 2 } ; \node[lc] at (2.0, 0.4) { 2 } ; \node[lc] at (3.0, 0.4) { 1 } ; }\right) \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (-0.5, 1.0) { 1 } } child {node[lc] at (0.5, 1.0) { 1 } } ; }\\ + & a \left( \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; \node[b] at (1.0, 0.4) { } ; }- \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[b] at (1.0, 0.4) { } ; \node[lc] at (2.0, 0.4) { 1 } ; }- \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[b] at (2.0, 0.4) { } ; }+ \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 2 } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[lc] at (2.0, 0.4) { 2 } ; \node[lc] at (3.0, 0.4) { 1 } ; }+ \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0, 0.4) { 2 } ; \node[lc] at (2.0, 0.4) { 2 } ; \node[lc] at (3.0, 0.4) { 1 } ; }\right) \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; \node[b] at (1.0, 0.4) { } ; }\\ + & a \left( \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 1 } } ; \node[lc] at (1.0, 0.0) { 1 } ; }- \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[b] at (1.0, 0.4) { } ; \node[lc] at (2.0, 0.4) { 1 } ; }+ \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 2 } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[lc] at (2.0, 0.4) { 2 } ; \node[lc] at (3.0, 0.4) { 1 } ; }\right) \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 1 } } ; \node[lc] at (1.0, 0.0) { 1 } ; }\\ + & a \left( \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[lc] at (2.0, 0.4) { 1 } ; }- \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 2 } ; \node[lc] at (1.0, 0.4) { 2 } ; \node[lc] at (2.0, 0.4) { 1 } ; \node[lc] at (3.0, 0.4) { 1 } ; }\right) \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[lc] at (2.0, 0.4) { 1 } ; }. \end{align}\] Hence, by Theorem 25, cancelling each coefficients ensures that \(A_2^*\mathrm{d}\mu_\infty = 0\). Rewriting these conditions gives the second order conditions from Theorem 12. ◻

4.3 Exotic S-series expression of the adjoint operators↩︎

Let us distinguish the coefficient maps for the weak error \(a_w : \mathcal{EF}\to \mathbb{R}\) and for the invariant measure. Denote by \(\left\langle\cdot \vert\cdot \right\rangle\) the bilinear pairing over \(\mathcal{EF}\) such that, for \(\pi_1, \pi_2 \in EF\), \[\left\langle\pi_1 \vert\pi_2 \right\rangle = 1 \text{ if } \pi_1 = \pi_2 \neq 0 \text{ and } 0 \text{ else}.\]

Definition 14. Let \(A : \mathop{\mathrm{\mathcal{I}_\mathcal{R}}}\to \mathcal{EF}\) be the operator \[A : \pi \mapsto {\underset{\tilde{\pi} \in EF}{\sum}} \left\langle\pi \vert\mathop{\mathrm{RED}}(\tilde{\pi}) \right\rangle\tilde{\pi} = \underset{k \geq 0}{\underset{\tilde{\pi} \in EF}{\sum}} \left\langle\pi \vert{\mathop{\mathrm{IBP}}}^{k}(\tilde{\pi}) \right\rangle\tilde{\pi} .\] For the coefficient map of a numerical method \(a_w\), let us define \(a_{\mu_\infty} = a_w \circ A\).

Remark 26. The operator \(A\) is invertible and \(A^{-1} = \id - {\mathop{\mathrm{IBP}}}^{*}\).

Proposition 27. The map \(a_{\mu_\infty} : \mathop{\mathrm{\mathcal{I}_\mathcal{R}}}\to \mathbb{R}\) is the coefficient map for the invariant measure, that is, the error ?? for the invariant measure of a method of order p is expressed using a S-series indexed only on irreducible forests of order \(p\), \[e(\varphi,h) = h^p \int_{0}^{\infty} \displaystyle{ \int_{\mathcal{M}} } u(t,x) {\big( \underset{\abs{\pi} = p}{\underset{\pi \in \mathop{\mathrm{I_{R}}}}{\sum}} a_{\mu_\infty}(\pi) \mathbb{F}^F (\pi)\big)}^* \mathrm{d}\mu_\infty(x) \mathrm{d}t.\]

Examples 28. Using Table 1, the computation of \(a_{\mu_\infty}\) gives for the first and second orders: \[\begin{align} a_{\mu_\infty} ( \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }) & = a_w ( \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; }- \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0,0.4) { 1 } ; })\\ a_{\mu_\infty} \left( \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[b] at (0.0, 1.0) { } } ; }\right) & = a_w \left( \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[b] at (0.0, 1.0) { } } ; }- \tikz[planar forest ] { \node[lc] at (0.0, 0.0) { 1 } ; \node[b] at (1.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 1 } } ; }+ \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[b] at (2.0, 0.4) { } ; }- \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0, 0.4) { 2 } ; \node[lc] at (2.0, 0.4) { 2 } ; \node[lc] at (3.0, 0.4) { 1 } ; }\right), \\ a_{\mu_\infty} \left( \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (-0.5, 1.0) { 1 } } child {node[lc] at (0.5, 1.0) { 1 } } ; }\right) & = a_w \left( \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (-0.5, 1.0) { 1 } } child {node[lc] at (0.5, 1.0) { 1 } } ; }- \tikz[planar forest ] { \node[lc] at (0.0, 0.0) { 1 } ; \node[b] at (1.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 1 } } ; }+ \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[b] at (2.0, 0.4) { } ; }- \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0, 0.4) { 2 } ; \node[lc] at (2.0, 0.4) { 2 } ; \node[lc] at (3.0, 0.4) { 1 } ; }\right) , \\ a_{\mu_\infty} \left( \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; \node[b] at (1.0, 0.4) { } ; }\right) & = a_w \left( \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; \node[b] at (1.0, 0.4) { } ; }- \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[b] at (1.0, 0.4) { } ; \node[lc] at (2.0, 0.4) { 1 } ; }- \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[b] at (2.0, 0.4) { } ; }+ \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 2 } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[lc] at (2.0, 0.4) { 2 } ; \node[lc] at (3.0, 0.4) { 1 } ; }+ \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[lc] at (1.0, 0.4) { 2 } ; \node[lc] at (2.0, 0.4) { 2 } ; \node[lc] at (3.0, 0.4) { 1 } ; }\right), \\ a_{\mu_\infty} \left( \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 1 } } ; \node[lc] at (1.0, 0.0) { 1 } ; }\right) & = a_w \left( \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[lc] at (0.0, 1.0) { 1 } } ; \node[lc] at (1.0, 0.0) { 1 } ; }- \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 1 } ; \node[b] at (1.0, 0.4) { } ; \node[lc] at (2.0, 0.4) { 1 } ; }+ \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 2 } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[lc] at (2.0, 0.4) { 2 } ; \node[lc] at (3.0, 0.4) { 1 } ; }\right) \\ a_{\mu_\infty} \left( \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[lc] at (2.0, 0.4) { 1 } ; }\right) & = a_w \left( \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[lc] at (2.0, 0.4) { 1 } ; }- \tikz[planar forest ] { \node[lc] at (0.0, 0.4) { 2 } ; \node[lc] at (1.0, 0.4) { 2 } ; \node[lc] at (2.0, 0.4) { 1 } ; \node[lc] at (3.0, 0.4) { 1 } ; }\right). \end{align}\]

It is important to mention that the conditions for the invariant measure are not independent and satisfy relations, analogously to the weak context [9]. However, the map \(a_{\mu_\infty}\) is not a character for the shuffle product as one has for instance \[{a_{\mu_\infty}( \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; })}^2 = 2 a_{\mu_\infty}( \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; \node[b] at (1.0, 0.4) { } ; }- \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; \node[lc] at (1.0, 0.4) { 1 } ; \node[lc] at (2.0, 0.4) { 1 } ; }) , \quad {a_{w}( \tikz[planar forest ] { \node[b] at (0.0, 0.4) { } ; })}^2 = 2 a_{w}( \tikz[planar forest ] { \node[b] at (0.0, 0.0) { } child {node[b] at (0.0, 1.0) { } } ; }).\]

Proposition 29. The coefficient map \(a_{\mu_\infty}\) is a character for the modified shuffle product, \[\tilde{{\sqcup\mathchoice{\mkern-4.8mu}{\mkern-4.5mu}{\mkern-4.5mu}{\mkern-4.5mu}\sqcup}} : (\pi_1,\pi_2) \mapsto A^{-1}(A\pi_1 {\sqcup\mathchoice{\mkern-4.8mu}{\mkern-4.5mu}{\mkern-4.5mu}{\mkern-4.5mu}\sqcup}A\pi_2) = (A\pi_1 {\sqcup\mathchoice{\mkern-4.8mu}{\mkern-4.5mu}{\mkern-4.5mu}{\mkern-4.5mu}\sqcup}A\pi_2) - {\mathop{\mathrm{IBP}}}^{*}(A\pi_1 {\sqcup\mathchoice{\mkern-4.8mu}{\mkern-4.5mu}{\mkern-4.5mu}{\mkern-4.5mu}\sqcup}A\pi_2) .\]

Proof. Definition 14 ensures that for all \(\pi_1,\pi_2\in \mathop{\mathrm{I_{R}}}\), \[\begin{align} a_{\mu_\infty}(\pi_1)a_{\mu_\infty}(\pi_2) = & a_w(A\pi_1)a_w(A\pi_2) \\ = & a_w(A\pi_1 {\sqcup\mathchoice{\mkern-4.8mu}{\mkern-4.5mu}{\mkern-4.5mu}{\mkern-4.5mu}\sqcup}A \pi_2) \\ = & a_{\mu_\infty}(A^{-1}\left( A\pi_1 {\sqcup\mathchoice{\mkern-4.8mu}{\mkern-4.5mu}{\mkern-4.5mu}{\mkern-4.5mu}\sqcup}A \pi_2 \right)), \end{align}\] where we used that \(a_w\) is a character for \({\sqcup\mathchoice{\mkern-4.8mu}{\mkern-4.5mu}{\mkern-4.5mu}{\mkern-4.5mu}\sqcup}\) (see [9]). Hence the result. ◻

Theorem 30. Under the assumptions of Theorem 5 (or Theorem 7 for post-processed methods) if the coefficient map for the invariant measure of a consistent numerical method satisfies \[\mathchoice{\setbox 1{\displaystyle a_{\mu_\infty}}_{\scriptstyle \mathop{\mathrm{I_{R}}}_{\leq k}} {a_{\mu_\infty}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\,\mathop{\mathrm{I_{R}}}_{\leq k}}} {\setbox 1{\textstyle a_{\mu_\infty}}_{\scriptstyle \mathop{\mathrm{I_{R}}}_{\leq k}} {a_{\mu_\infty}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\,\mathop{\mathrm{I_{R}}}_{\leq k}}} {\setbox 1{\scriptstyle a_{\mu_\infty}}_{\scriptscriptstyle \mathop{\mathrm{I_{R}}}_{\leq k}} {a_{\mu_\infty}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\,\mathop{\mathrm{I_{R}}}_{\leq k}}} {\setbox 1{\scriptscriptstyle a_{\mu_\infty}}_{\scriptscriptstyle \mathop{\mathrm{I_{R}}}_{\leq k}} {a_{\mu_\infty}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\,\mathop{\mathrm{I_{R}}}_{\leq k}}} \equiv 0 ,\] then the method is of order \(k\) for the invariant measure.

Remark 31. If a method is consistent then \(\mathchoice{\setbox 1{\displaystyle a_{\mu_\infty}}_{\scriptstyle \mathop{\mathrm{I_{R}}}_{\leq 1}} {a_{\mu_\infty}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\,\mathop{\mathrm{I_{R}}}_{\leq 1}}} {\setbox 1{\textstyle a_{\mu_\infty}}_{\scriptstyle \mathop{\mathrm{I_{R}}}_{\leq 1}} {a_{\mu_\infty}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\,\mathop{\mathrm{I_{R}}}_{\leq 1}}} {\setbox 1{\scriptstyle a_{\mu_\infty}}_{\scriptscriptstyle \mathop{\mathrm{I_{R}}}_{\leq 1}} {a_{\mu_\infty}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\,\mathop{\mathrm{I_{R}}}_{\leq 1}}} {\setbox 1{\scriptscriptstyle a_{\mu_\infty}}_{\scriptscriptstyle \mathop{\mathrm{I_{R}}}_{\leq 1}} {a_{\mu_\infty}\,\smash{\vrule height .8\ht 1 depth .85\dp 1}}_{\,\mathop{\mathrm{I_{R}}}_{\leq 1}}} \equiv 0\).

5 Numerical experiments↩︎

5.1 Ergodicity and long-time sampling on \(SO_p\)↩︎

Our first experiment focuses on \(\MM=SO_p\) the compact Lie group of special orthogonal matrices of size \(p \times p\). Let \({\left(A_d\right)}_{d=1,\ldots,D}\) be an orthonormal basis of its Lie algebra \(\mathfrak{so}_p\) of skew-symmetric matrices for the metric \(g_x(A,B) = \Trace \left( A^T B \right)\), \(A,B \in T_x \MM\). Let \(E_d(y) = A_d y\) be the associated orthonormal frame basis. As the manifold is smooth and compact, the assumptions of Theorem 7 are satisfied and our analysis applies.

Remark 32. On a matrix space with \(A_1,\dots,A_D\) as a basis of the Lie algebra, the frame is \(E_d(p) = A_d p\), the geodesic flow \(\exp\) is given by the matrix exponential \(\Exp\), and Method 1 becomes the following.

Figure 4: image.

Inspired by the experiments in [9], we compare the new methods of high order for the invariant measure to the frozen-flow Euler method ?? and the so-called SFF2 method from [9], which uses two random variables and is of weak order 2. We consider dynamics with the test function \[\label{eq:num95test95fct} \varphi(x) = \exp \left( - \frac{g_x (x-I_p,x-I_p)}{2p} \right).\tag{13}\] The reference solution is taken as the mean value of the SFF2 method [9] with the reference time step \(h=2^{-12}\). We compare the order of convergence in long time for two potentials of the form \(V = P( \left\Vert\cdot - I_p \right\Vert^2 )\) where \(P\) polynomial: a quadratic potential well with \(P = 10 X\) and a sextic potential with multiple local minima using the cubic polynomial \(P = \frac{X}{2} (X^2-9X+24)\). Starting from the initial condition \(X_0 = - \left(\begin{smallmatrix} 1&0&0\\0&0&1\\0&1&0 \end{smallmatrix}\right)\), we observe in Figure 5 the ergodic behaviour of the dynamic as the trajectories explore a neighbourhood of the identity matrix after an initial transient phase.

a

b

Figure 5: Trajectory on \(SO_3\) with quadratic potential at time \(T=2\) and step time \(h = 10^{-5}\), represented by the three columns on the sphere \(\mathbb{S}^2\) (Left). Ergodic convergence computed with \(10^4\) trajectories and \(h=10^{-4}\) for the quadratic potential and the test function \(\varphi\)(Right). The method used is Method 2 in both computation..

We observe the error curves for the invariant measure in Figure 6. We observe that the new methods 12 and 3 exhibit the expected second-order behavior, with a reduced cost compared to SFF2, which confirms our theoretical results. Moreover, Method 1 rapidly reaches the Monte-Carlo threshold in the quadratic case, hinting that it may have a higher order of convergence for this specific potential.

a

b

Figure 6: Order of convergence in long time for two potentials: quadratic (left) and sextic (right). The mean is computed at the final time \(T=10\) with \(10^8\) trajectories and with the test function \(\varphi\) given by 13 ..

5.2 Von-Mises Fisher dynamics on the sphere \(\mathbb{S}^2\)↩︎

Our second experiment focuses on the 2-dimensional sphere \(\MM=\mathbb{S}^2\). As our new methods rely on orthonormal bases, we consider the standard coordinates on \(\mathbb{S}^2\) minus the poles \(( 0 , 0 , \pm 1)\): \[y_{\theta,\phi} = \begin{pmatrix} \cos (\theta) \cos (\phi) \\ \cos (\theta) \sin (\phi) \\ \sin (\theta) \end{pmatrix} \in \mathbb{S}^2, \quad \theta \in \left(-\frac{\pi}{2},\frac{\pi}{2}\right), \quad \phi \in \left[0,2\pi\right),\] with the associated orthonormal frame: \[E_1(y_{\theta,\phi}) = \begin{pmatrix} -\sin (\theta) \cos (\phi) \\ -\sin (\theta) \sin (\phi) \\ \cos (\theta) \end{pmatrix}, \quad E_2(y_{\theta,\phi}) = \begin{pmatrix} - \cos (\theta) \sin (\phi) \\ \cos (\theta) \cos (\phi) \\ 0 \end{pmatrix}.\] Using the symmetry \(S : (x,y,z) \mapsto (z,y,x)\), we define a second frame on \(\mathbb{S}^2\) minus \(( \pm 1 , 0 , 0)\). For one step of the method, we use the first frame basis if \(\abs{\sin(\theta)}\leq 0.6\), and the second frame else. This ensures a bounded Lipschitz constant for the chosen frame in each case and the assumptions of our analysis are satisfied. Following the experiments of [4], [7], [9], we consider the potential \(V : (x,y,z) \mapsto -25z\), the associated vector field (containing the Ito correction 3 ) \[F = - \nabla V - \nabla_{E_1} E_1 - \nabla_{E_2} E_2,\] and the test function \(\varphi : (x,y,z) \mapsto z^2\). This choice of potential confines the trajectories around the north pole of \(\mathbb{S}^2\) (see Figure 7). The reference solution is chosen as the mean value of the SFF2 method [9] with the reference time step \(h=\frac{1}{ 25 \times 2^{10}}\).

We compare the new methods of high order for the invariant measure with the methods of [9]. The error curves for the invariant measure in Figure 7 display the expected orders of convergence. In particular, Methods 2 and 3 exhibit second-order behavior, while Method 1 reaches the Monte-Carlo threshold instantly.

a

b

Figure 7: Trajectory for the Von-Mises Fisher dynamics on the sphere \(\mathbb{S}^2\) at time \(T=0.4\) and step time \(h = 4 \times 10^{-6}\)(Left). Convergence order for the Von-Mises Fisher dynamics on the sphere \(\mathbb{S}^2\) at time \(T=0.4\) with \(10^8\) trajectories and with the test function \(\varphi : (x,y,z) \mapsto z^2\)(Right)..

6 Conclusion↩︎

In this paper, we designed new numerical schemes of high accuracy tailored for the long time sampling of ergodic stochastic dynamics on Riemannian manifolds. We generalized the Euclidean analysis [33], [34] to characterize the intrinsic approximation for the invariant measure on manifolds, and presented new algebraic operations on exotic forests [9] to compute the order conditions in long time. The analysis applies naturally to Riemannian Langevin dynamics and the new methods, which generalise in particular the Leimkuhler-Matthews method, show second order of convergence for a reduced cost on numerical experiments.

The present paper opens several avenues for future research. The new discretisations could naturally be combined with popular sampling techniques, such as perturbations [21], [48][50]. The analysis for the invariant measure, as well as the associated algebraic formalism, will be extended for the design of modified equations of arbitrarily high order for sampling SDEs on manifolds and for the challenging derivation of intrinsic stochastic backward error analysis, generalising [22], [25]. Similar to the Euclidean setting [51], one could extend the analysis to general SDEs with multiplicative noise and the creation of higher order methods. Our approach follows the one of deterministic Lie-group methods and thus relies on a curvature-free connection, unrelated to the natural Levi-Civita connection on Riemannian manifolds. We will extend the frozen-flow methods so that they rely only on Riemannian operations. The study of such new methods is already open in the deterministic setting and relies on the challenging general understanding of the connection algebra [30], [52], [53]. Finally, the new algebraic formalism of planar exotic series is interesting in itself and could be studied for its universal combinatorial, algebraic, and geometric properties [27], [54][57], but also for its potential applications in different fields, in the spirit of the use of Butcher series and their extensions in rough paths [58], [59], renormalisation theory [60], variational calculus [61], [62], approximation of PDEs [63], mathematical physics [64], and wave kinetic dynamics [65]. These projects will be studied in upcoming works.

The authors would like to thank Baptiste Huguet for helpful comments on a previous version of the present work. The authors acknowledge the support from the French program ANR-25-CE40–2862–01 (MaStoC — Manifolds and Stochastic Computations). Experiments presented in this paper were carried out using the Abaca testbed, supported by Inria (see https://abaca.inria.fr).

References↩︎

[1]
E. P. Hsu. Stochastic analysis on manifolds, volume 38 of Graduate Studies in Mathematics. American Mathematical Society, Providence, RI, 2002.
[2]
D. Bakry. Un critère de non-explosion pour certaines diffusions sur une variété riemannienne complète. C.R. Acad. Sc. Paris, 303(1):23–26, 1986.
[3]
T. Lelièvre, M. Rousset, and G. Stoltz. Free energy computations. Imperial College Press, London, 2010. A mathematical perspective.
[4]
A. Laurent and G. Vilmart. Order conditions for sampling the invariant measure of ergodic stochastic differential equations on manifolds. Found. Comput. Math., 22(3):649–695, 2022.
[5]
S. J. A. Malham and A. Wiese. Stochastic Lie group integrators. SIAM J. Sci. Comput., 30(2):597–617, 2008.
[6]
M. Muniz, M. Ehrhardt, M. Günther, and R. Winkler. Higher strong order methods for linear ItôSDEs on matrix Lie groups. BIT Numer. Math., 62(4):1095–1119, 2022.
[7]
K. Bharath, A. Lewis, A. Sharma, and M. V. Tretyakov. Sampling and Estimation on Manifolds using the Langevin Diffusion. Journal of Machine Learning Research, 26(71):1–50, 2025.
[8]
E. Luesink and O. D. Street. Symplectic techniques for stochastic differential equations on reductive Lie groups with applications to Langevin diffusions. Journal of Differential Equations, 458:114034, 2026.
[9]
E. Bronasco, A. Busnot Laurent, and B. Huguet. High order integration of stochastic dynamics on Riemannian manifolds with frozen-flow methods. arXiv:2503.21855, 2025.
[10]
G. Vilmart. Postprocessed integrators for the high order integration of ergodic SDEs. SIAM J. Sci. Comput., 37(1):A201–A220, 2015.
[11]
P. E. Crouch and R. Grossman. Numerical integration of ordinary differential equations on manifolds. Journal of Nonlinear Science, 3:1–33, 1993.
[12]
B. Owren and A. Marthinsen. Runge-Kutta methods adapted to manifolds and based on rigid frames. BIT Numer. Math., 39(1):116–142, 1999.
[13]
A. Iserles, H. Z. Munthe-Kaas, S. P. Nørsett, and A. Zanna. Lie-group methods. In Acta numerica, 2000, volume 9 of Acta Numer., pages 215–365. Cambridge Univ. Press, Cambridge, 2000.
[14]
E. Celledoni, A. Marthinsen, and B. Owren. Commutator-free Lie group methods. Future Generation Computer Systems, 19(3):341–352, 2003.
[15]
B. Owren. Order conditions for commutator-free Lie group methods. Journal of Physics A: Mathematical and General, 39(19):5585, 2006.
[16]
D. Talay and L. Tubaro. Expansion of the global error for numerical schemes solving stochastic differential equations. Stochastic Anal. Appl., 8(4):483–509 (1991), 1990.
[17]
N. Bou-Rabee and H. Owhadi. Long-run accuracy of variational integrators in the stochastic context. SIAM J. Numer. Anal., 48(1):278–297, 2010.
[18]
B. Leimkuhler and C. Matthews. Rational construction of stochastic numerical methods for molecular sampling. Appl. Math. Res. Express. AMRX, 2013(1):34–56, 2013.
[19]
A. Abdulle, G. Vilmart, and K. C. Zygalakis. Long time accuracy of Lie-Trotter splitting methods for Langevin dynamics. SIAM J. Numer. Anal., 53(1):1–16, 2015.
[20]
B. Leimkuhler, C. Matthews, and G. Stoltz. The computation of averages from equilibrium and nonequilibrium Langevin molecular dynamics. IMA J. Numer. Anal., 36(1):13–79, 2016.
[21]
E. Bronasco, B. Leimkuhler, D. Phillips, and G. Vilmart. Efficient Langevin sampling with position-dependent diffusion. arXiv:2501.02943, 2025.
[22]
A. Laurent and G. Vilmart. Exotic aromatic B-series for the study of long time integrators for a class of ergodic SDEs. Math. Comp., 89(321):169–202, 2020.
[23]
A. Laurent. Algebraic Tools and Multiscale Methods for the Numerical Integration of Stochastic Evolutionary Problems. PhD thesis, University of Geneva, 2021.
[24]
E. Bronasco. Exotic B-series and S-series: algebraic structures and order conditions for invariant measure sampling. Found. Comput. Math., pages 1–31, 2024.
[25]
E. Bronasco and A. Busnot Laurent. Hopf algebra structures for the backward error analysis of ergodic stochastic differential equations. Numer. Math., pages 1–61, 2026.
[26]
H. Z. Munthe-Kaas and W. M. Wright. On the Hopf algebraic structure of Lie group integrators. Found. Comput. Math., 8(2):227–257, 2008.
[27]
A. Laurent and H. Munthe-Kaas. The universal equivariance properties of exotic aromatic B-series. Found. Comput. Math., 25(5):1595–1626, 2025.
[28]
H. Z. Munthe-Kaas and A. Lundervold. On post-Lie algebras, Lie–Butcher series and moving frames. Found. Comput. Math., 13:583–613, 2013.
[29]
K. Ebrahimi-Fard, A. Lundervold, and H. Z. Munthe-Kaas. On the Lie enveloping algebra of a post-Lie algebra. J. Lie Theory, 25(4):1139–1165, 2015.
[30]
M. J. H. Al-Kaabi, K. Ebrahimi-Fard, D. Manchon, and H. Z. Munthe-Kaas. Algebraic aspects of connections: From torsion, curvature, and post-Lie algebras to Gavrilov’s double exponential and special polynomials. Journal of Noncommutative Geometry, 19(1):297–335, 2023.
[31]
E. Grong, H. Z. Munthe-Kaas, and J. Stava. Post-Lie algebra structure of manifolds with constant curvature and torsion. Journal of Lie Theory, 34(2):339–352, 2024.
[32]
H. Munthe-Kaas and J. Stava. Lie admissible triple algebras: The connection algebra of symmetric spaces. Submitted, 2023.
[33]
A. Debussche and E. Faou. Weak backward error analysis for SDEs. SIAM J. Numer. Anal., 50(3):1735–1752, 2012.
[34]
A. Abdulle, G. Vilmart, and K. C. Zygalakis. High order numerical approximation of the invariant measure of ergodic SDEs. SIAM J. Numer. Anal., 52(4):1600–1622, 2014.
[35]
A. Lundervold and H. Munthe-Kaas. Hopf algebras of formal diffeomorphisms and numerical integration on manifolds. In Combinatorics and physics, volume 539 of Contemp. Math., pages 295–324. Amer. Math. Soc., Providence, RI, 2011.
[36]
J.-M. Oudom and D. Guin. On the Lie enveloping algebra of a pre-Lie algebra. J. K-Theory, 2(1):147–167, 2008.
[37]
K. Ebrahimi-Fard and D. Manchon. The Magnus expansion, trees and Knuth’s rotation correspondence. Found. Comput. Math., 14(1):1–25, 2014.
[38]
Y. Li, Y. Sheng, and R. Tang. Post-Hopf algebras, relative Rota–Baxter operators and solutions to the Yang–Baxter equation. Journal of Noncommutative Geometry, 18(2):605–630, 2023.
[39]
A. Busnot Laurent, Y. Li, and Y. Sheng. Post-Hopf algebroids, post-Lie-Rinehart algebras and geometric numerical integration. arXiv:2512.21971, 2025.
[40]
A. Antonyuk and A. Antonyuk. Nonexplosion and solvability of nonlinear diffusion equations on noncompact manifolds. Ukr. Math. J., 59:1632–1652, 2007.
[41]
X.-M. Li. Stochastic differential equations on noncompact manifolds: moment stability and its topological consequences. Probab. Theory Relat. Fields, 100:417–428, 1994.
[42]
J. Lee. Introduction to Riemannian Manifolds. Graduate Texts in Mathematics. Springer International Publishing, 2019.
[43]
E. Hairer, C. Lubich, and G. Wanner. Geometric numerical integration, volume 31 of Springer Series in Computational Mathematics. Springer-Verlag, Berlin, second edition, 2006. Structure-preserving algorithms for ordinary differential equations.
[44]
J. C. Butcher. An algebraic theory of integration methods. Math. Comp., 26:79–106, 1972.
[45]
J. C. Butcher. B-series: algebraic analysis of numerical methods. Springer, 2021.
[46]
B. O’Neill. Semi-Riemannian Geometry With Applications to Relativity. Pure and Applied Mathematics. Academic Press, 1983.
[47]
G. Baxter et al. An analytic problem whose solution follows from a simple algebraic identity. Pacific J. Math, 10(3):731–742, 1960.
[48]
T. Lelièvre, F. Nier, and G. A. Pavliotis. Optimal non-reversible linear drift for the convergence to equilibrium of a diffusion. J. Stat. Phys., 152(2):237–274, 2013.
[49]
A. B. Duncan, T. Lelièvre, and G. A. Pavliotis. Variance reduction using nonreversible Langevin samplers. J. Stat. Phys., 163(3):457–491, 2016.
[50]
A. Abdulle, G. A. Pavliotis, and G. Vilmart. Accelerated convergence to equilibrium and reduced asymptotic variance for Langevin dynamics using Stratonovich perturbations. C. R. Math. Acad. Sci. Paris, 357(4):349–354, 2019.
[51]
A. Busnot Laurent, K. Debrabant, and A. Kværnø. Optimal stochastic Runge-Kutta methods for the weak integration of stochastic dynamics. arXiv:2603.24255, 2026.
[52]
H. Munthe-Kaas. Geometric integration on symmetric spaces. J. Comput. Dyn., 11(1):43–58, 2024.
[53]
J. Stava. On connection algebras of symmetric spaces and reductive homogeneous spaces. PhD thesis, University of Bergen, 2024.
[54]
R. I. McLachlan, K. Modin, H. Munthe-Kaas, and O. Verdier. B-series methods are exactly the affine equivariant methods. Numer. Math., 133(3):599–622, 2016.
[55]
H. Munthe-Kaas and O. Verdier. Aromatic Butcher series. Found. Comput. Math., 16(1):183–215, 2016.
[56]
G. Fløystad, D. Manchon, and H. Z. Munthe-Kaas. The universal pre-Lie-Rinehart algebras of aromatic trees. In Geometric and harmonic analysis on homogeneous spaces and applications, volume 366 of Springer Proc. Math. Stat., pages 137–159. Springer, Cham, [2021]©2021.
[57]
A. Busnot Laurent, H. Munthe-Kaas, and G. S. Venkatesh. The free tracial post-Lie-Rinehart algebra of planar aromatic trees for the design of divergence-free Lie-group methods. arXiv:2603.28437, 2026.
[58]
M. Hairer and D. Kelly. Geometric versus non-geometric rough paths. Ann. Inst. Henri Poincaré Probab. Stat., 51(1):207–251, 2015.
[59]
A. Lejay. Constructing general rough differential equations through flow approximations. Electron. J. Probab., 27:Paper No. 7, 24, 2022.
[60]
C. Brouder. Runge–Kutta methods and renormalization. Eur. Phys. J. C, 12(3):521–534, 2000.
[61]
A. Laurent, R. I. McLachlan, H. Z. Munthe-Kaas, and O. Verdier. The aromatic bicomplex for the description of divergence-free aromatic forms and volume-preserving integrators. Forum Math. Sigma, 11:Paper No. e69, 2023.
[62]
A. Laurent. The Lie derivative and Noether’s theorem on the aromatic bicomplex for the study of volume-preserving numerical integrators. J. Comput. Dyn., 11(1):10–22, 2024.
[63]
Y. Alama Bronsard, Y. Bruned, and K. Schratz. Approximations of dispersive PDEs in the presence of low-regularity randomness. Found. Comput. Math., pages 1–51, 2024.
[64]
A. Bonicelli. Exotic B-series representation of the Feller semigroup for Itô diffusions and the MSR path integral. arXiv preprint arXiv:2510.23102, 2025.
[65]
Y. Deng and Z. Hani. Full derivation of the wave kinetic equation. Inventiones mathematicae, 233(2):543–724, 2023.