TL;DR
This paper develops methods for estimating Langevin diffusions on the torus with applications to directional data and molecular dynamics, introducing computationally feasible likelihood approximations and demonstrating their effectiveness through simulations and real data.
Contribution
It introduces novel likelihood approximation techniques for Langevin diffusions on the torus, enabling practical estimation and application to complex directional data.
Findings
Approximate likelihoods perform well in simulations.
Methods successfully model protein backbone angles.
Software package sdetorus implements the proposed methods.
Abstract
We introduce stochastic models for continuous-time evolution of angles and develop their estimation. We focus on studying Langevin diffusions with stationary distributions equal to well-known distributions from directional statistics, since such diffusions can be regarded as toroidal analogues of the Ornstein-Uhlenbeck process. Their likelihood function is a product of transition densities with no analytical expression, but that can be calculated by solving the Fokker-Planck equation numerically through adequate schemes. We propose three approximate likelihoods that are computationally tractable: (i) a likelihood based on the stationary distribution; (ii) toroidal adaptations of the Euler and Shoji-Ozaki pseudo-likelihoods; (iii) a likelihood based on a specific approximation to the transition density of the wrapped normal process. A simulation study compares, in dimensions one and two,…
| , | , | |||||||
|---|---|---|---|---|---|---|---|---|
| E | SO | WOU | PDE | E | SO | WOU | PDE | |
| 0.9799 | 0.9392 | 0.9608 | 0.7596 | 0.9888 | 0.9229 | 0.9241 | 0.7276 | |
| 0.9631 | 0.8554 | 0.8878 | 0.8319 | 0.9937 | 0.8425 | 0.8422 | 0.7852 | |
| 0.8941 | 0.7444 | 0.9016 | 0.9340 | 0.6907 | 0.9904 | 1.0000 | 0.9826 | |
| 0.5685 | 0.7504 | 0.8978 | 1.0000 | 0.5329 | 0.9763 | 0.9972 | 0.9969 | |
| , | , | |||||||
| E | SO | WOU | PDE | E | SO | WOU | PDE | |
| 0.9688 | 0.9972 | 0.9700 | 0.9098 | 0.9392 | 0.9431 | 0.9205 | 0.8760 | |
| 0.7586 | 0.9740 | 0.8586 | 0.7805 | 0.8040 | 0.8670 | 0.9319 | 0.9380 | |
| 0.6272 | 0.9565 | 1.0000 | 0.8535 | 0.6297 | 0.7321 | 0.8368 | 1.0000 | |
| 0.2784 | 0.6904 | 1.0000 | 0.8578 | 0.6090 | 0.8437 | 0.7823 | 0.8964 | |
| , | , | |||||
| E | SO | WOU | E | SO | WOU | |
| 0.9765 | 0.9244 | 0.8999 | 0.9920 | 0.8452 | 0.8460 | |
| 0.9985 | 0.8214 | 0.8229 | 0.7234 | 0.9978 | 0.9993 | |
| 0.5679 | 0.9868 | 0.9972 | 0.4370 | 1.0000 | 0.9980 | |
| 0.4296 | 0.9872 | 0.9998 | 0.3467 | 1.0000 | 0.9970 | |
| , | , | |||||
| E | SO | WOU | E | SO | WOU | |
| 0.9297 | 1.0000 | 0.9422 | 0.9635 | 0.8752 | 0.8793 | |
| 0.8249 | 0.9573 | 0.9916 | 0.6017 | 0.7333 | 1.0000 | |
| 0.6050 | 0.6607 | 1.0000 | 0.3797 | 0.6406 | 1.0000 | |
| 0.5254 | 0.5432 | 1.0000 | 0.2690 | 0.4214 | 1.0000 | |
| Tpd | Comput. | |||
|---|---|---|---|---|
| approx. | expediency | |||
| E | ★★★★★ | ★★ | ★ | ★★★★★ |
| SO | ★★★★ | ★★★ | ★★★ | ★★★ |
| WOU | ★★★★ | ★★★★ | ★★★★★ | ★★★★ |
| PDE | ★★★ | ★★★★★ | ★★★★★ | ★ |
| , | , | |||||
| E | SO | PDE | E | SO | PDE | |
| 0.9277 | 1.0000 | 0.7682 | 0.5715 | 0.5938 | 0.9309 | |
| 0.5968 | 0.7315 | 1.0000 | 0.3418 | 0.3524 | 1.0000 | |
| 0.3548 | 0.4264 | 1.0000 | 0.2923 | 0.3030 | 1.0000 | |
| 0.3068 | 0.3295 | 1.0000 | 0.2865 | 0.2774 | 1.0000 | |
| , | , | |||||
| E | SO | PDE | E | SO | PDE | |
| 0.9686 | 0.8947 | 0.8646 | 0.7325 | 0.6734 | 1.0000 | |
| 0.8114 | 0.8720 | 1.0000 | 0.0213 | 0.1196 | 1.0000 | |
| 0.1867 | 0.3634 | 1.0000 | 0.0258 | 0.0880 | 1.0000 | |
| 0.1417 | 0.2396 | 1.0000 | 0.0441 | 0.0750 | 1.0000 | |
| E | SO | E | SO | E | SO | |
|---|---|---|---|---|---|---|
| 0.9282 | 0.9595 | 0.9851 | 0.9620 | 0.9716 | 0.9527 | |
| 0.8678 | 0.9901 | 0.8999 | 0.9616 | 0.9517 | 0.9296 | |
| 0.8312 | 0.9825 | 0.8223 | 0.9454 | 0.9448 | 0.9640 | |
| 0.8867 | 0.9984 | 0.8625 | 0.9742 | 0.7525 | 0.9661 | |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
11footnotetext: Department of Mathematical Sciences, University of Copenhagen (Denmark).22footnotetext: Bioinformatics Centre, Section for Computational and RNA Biology, Department of Biology, University of Copenhagen (Denmark).33footnotetext: Department of Statistics, Carlos III University of Madrid (Spain).44footnotetext: Department of Statistics, University of Leeds (UK).55footnotetext: Department of Statistics, University of Oxford (UK).66footnotetext: Image Section, Department of Computer Science, University of Copenhagen (Denmark).77footnotetext: Corresponding author. e-mail: [email protected].
Langevin diffusions on the torus: estimation and applications
Eduardo García-Portugués1,2,3,7, Michael Sørensen1,
Kanti V. Mardia4,5, and Thomas Hamelryck2,6
Abstract
We introduce stochastic models for continuous-time evolution of angles and develop their estimation. We focus on studying Langevin diffusions with stationary distributions equal to well-known distributions from directional statistics, since such diffusions can be regarded as toroidal analogues of the Ornstein–Uhlenbeck process. Their likelihood function is a product of transition densities with no analytical expression, but that can be calculated by solving the Fokker–Planck equation numerically through adequate schemes. We propose three approximate likelihoods that are computationally tractable: (i) a likelihood based on the stationary distribution; (ii) toroidal adaptations of the Euler and Shoji–Ozaki pseudo-likelihoods; (iii) a likelihood based on a specific approximation to the transition density of the wrapped normal process. A simulation study compares, in dimensions one and two, the approximate transition densities to the exact ones, and investigates the empirical performance of the approximate likelihoods. Finally, two diffusions are used to model the evolution of the backbone angles of the protein G (PDB identifier 1GB1) during a molecular dynamics simulation. The software package sdetorus implements the estimation methods and applications presented in the paper.
Keywords: Circular data; Directional statistics; Likelihood; Protein structure; Stochastic differential equation; Wrapped normal.
1 Introduction
Useful proposals of stochastic processes must take into account the particular features of the data that they aim to model. This is so for toroidal data, where observations are elements on the torus (with and identified). Models and inference for circular data () are notably different from the Euclidean case; see Mardia and Jupp (2000) or Jammalamadaka and SenGupta (2001) for a comprehensive description and a review of applications. One of the first continuous-time processes on the circle was proposed by Kent (1975). It is defined as the solution to the Stochastic Differential Equation (SDE)
[TABLE]
where is a Wiener process, is the strength of the drift towards , and is the diffusion coefficient. This process, referred to below as the von Mises (vM) process, can be regarded as a circular analogue of the Ornstein–Uhlenbeck (OU) process. The process is attracted to and, in the neighbourhood of , the drift is approximately linear. Moreover, the process is ergodic (i.e., it has a unique stationary distribution) and the stationary distribution (abbreviated as sdi) is \mathrm{vM}\big{(}\mu,\frac{2\alpha}{\sigma^{2}}\big{)}. denotes the vM distribution with probability density function (pdf)
[TABLE]
with being the modified Bessel function of the first kind and order . Despite its similarities with the OU process, the vM process is not as tractable as the former: no analytical expression for its transition probability density (tpd) is known. The vM process has been applied in mathematical biology (Hill and Häder, 1997; Codling and Hill, 2005), and related extensions were studied in physics in the context of oscillators (see Section 5.3.3 in Frank (2005) and references therein).
The contributions of this paper are two-fold. Firstly, we propose ergodic diffusions on the torus whose sdis are well-established distributions from directional statistics. These diffusions can be regarded as toroidal analogues of the OU process. Specifically, we introduce several Langevin diffusions, each defined as the wrapping of a -dimensional Euclidean diffusion solving the time-homogeneous SDE
[TABLE]
where is the drift, is the diffusion coefficient, and is a vector of independent standard Wiener processes (′ denotes transposition). We provide insights on the wrapping of (2) and study the properties of the new diffusions. We give particular emphasis to the Langevin diffusion with Wrapped Normal (WN) sdi, since this is a toroidal OU analogue with more tractable estimation.
Secondly, we present estimation procedures for discretely observed toroidal diffusions. The likelihood function involves the evaluation of the tpd , the density function of the conditional distribution of given . The tpd solves the Fokker–Planck or Kolmogorov’s Forward equation, this is, the Partial Differential Equation (PDE)
[TABLE]
with , and initial condition ( represents Dirac’s delta). This PDE has no explicit solution except for very few particular choices of and . We consider maximum likelihood estimation based on the numerical solution of (3). This method is computationally costly, but serves as a benchmark to which other computationally more expedient methods can be compared. A simple solution is to replace the unknown tpd by the known sdi, hence reducing the problem to maximum likelihood estimation with independent and identically distributed data, but this is usually inefficient and only allows for the estimation of the parameters appearing in the sdi. We therefore develop better approximations to the tpd that are relatively easy to compute. For general diffusions, we introduce toroidal versions of the Euler and Shoji–Ozaki pseudo-likelihoods. For the WN process, we derive a specific, sdi-correct and computationally efficient tpd approximation. We investigate the quality of these estimators by calculating the Kullback–Leibler divergences of the approximating tpds with respect to the tpd obtained by numerically solving (3). Furthermore, in a simulation study for different discretization steps we compare, in the one- and two-dimensional cases, the performance of the proposed approximate likelihoods.
Next, we describe relevant literature to our contributions. Diffusions featuring trigonometric drifts were presented in Kessler and Sørensen (1999), Larsen and Sørensen (2007) and Sørensen (2012), although these processes are not designed to capture periodicity, but rather to have a bounded interval as their state space. Wrapped Gaussian processes have been considered by Jona-Lasinio et al. (2012) in the context of spatial modelling of wave directions. In a different setting, processes where the time-inhomogeneous drift is a periodic function of time have been studied by Dehay (2015) and Dehling et al. (2010). Discrete time processes on the circle include the circular autoregressive models by Breckling (1989) and the Markov processes on the circle by Wehrly and Johnson (1979), Kato (2010) and Yeh et al. (2013). In a broader perspective, stochastic calculus on manifolds has been extensively developed, see for example Émery (1989), Stroock (2000) and Hsu (2002). For the case of the torus, a flat and compact manifold, the modelling challenges do not reside in the curvature of the manifold, but rather in capturing angular dependencies, a non-trivial and ubiquitous problem in directional statistics, consequence of the complex behaviour of rotations on the torus. Finally, we refer to Rogers and Williams (2000), Steele (2001) and Øksendal (2003) for an exhaustive introduction to SDEs, and to Kloeden and Platen (1992) and Iacus (2008) for a more applied perspective.
The rest of this paper is organized as follows. Section 2 introduces diffusions on the torus. Section 3 presents and analyses several estimation procedures for them, whilst the empirical estimation performance is assessed in a simulation study in Section 4. Section 5 gives an application to modelling the evolution of protein backbone angles. Conclusions and final comments are given in Section 6.
2 Toroidal diffusions
The state space of a stochastic process on the torus is . The space also plays a relevant role, since can be regarded as a Euclidean process that is wrapped into its principal angles by . This approach eases the interpretation of crossings through boundaries and motivates the following definition.
Definition 1** (Toroidal diffusion).**
The stochastic process is said to be a toroidal diffusion if it arises as the wrapping of a diffusion (2) such that and are -periodic:
[TABLE]
The toroidal diffusion coming from the wrapping of (2) is denoted as .
The periodicity of and are required to make a diffusion, since can only be Markovian if is non-ergodic in , as the next result shows.
Proposition 1** (Wrapped ergodic diffusion).**
Let be an ergodic diffusion on with stationary density and tpd . The following statements hold for the wrapped process :
- i.
* is ergodic on , with stationary density .* 2. ii.
If is distributed with density , then the conditional density of is
[TABLE] 3. iii.
If is time-reversible, i.e., , , then , . 4. iv.
The wrapped process is not Markovian.
Proof.
The statements can be easily checked, so we only illustrate the non-Markovianity. Recall that for and using the Markovianity of ,
[TABLE]
This clearly depends on unless is periodic on both arguments, impossible for a density in . ∎
Thus, a wrapped ergodic diffusion is not a diffusion. In particular, the family of conditional distributions given by (4) does not define a semi-group of transition operators. The non-Markovianity arises because , with , does not depend only on but also on the winding number of , hence the requirement for periodic and in Definition 1.
Remark 1**.**
The density of is remarkably different from the density of , given by . To make this point clearer, let be the OU process , its wrapped version with sdi ( is the pdf of a ), and assume X_{s}\sim\mathcal{N}\big{(}\mu,\frac{\sigma^{2}}{2\alpha}\big{)}. Then:
- i.
The density of is , with and . This is the usual tpd of the OU process. 2. ii.
The density of is , where and . 3. iii.
The density of is . This circular density can exhibit two modes describing the drift of towards whenever and are antipodal. 4. iv.
The density of is , which is unimodal. Whenever the circular shortest distance between and happens across the boundary, this circular density pushes the probability mass in the opposite direction.
Remark 2**.**
Liu (2013)** stated a similar density to iv above, with instead of , as the “tpd function of the OU process on the circle” and proved it satisfied the Chapman–Kolmogorov equation111Note that should be in the exponential’s denominator of Liu (2013)’s (15) and (16).. That density is not circular (it has a time-shrinking period ).
The rest of the section is devoted to the introduction and analysis of notable toroidal diffusions.
2.1 Langevin toroidal diffusions
Let be a pdf over . The so-called Langevin diffusions are a family of multivariate diffusions of the form (2), where the entries of are given by
[TABLE]
with . The most important property of these diffusions is that, under mild regularity conditions on and , they are ergodic with stationary density . This is particularly convenient since one of the first steps in modelling a given trajectory is to compare its empirical distribution with the sdi of the candidate diffusion model. Remarkably, the family of Langevin diffusions characterizes the family of ergodic diffusions with a given sdi that are time-reversible. The result is due to Kolmogoroff (1937) and was later extended by Kent (1978) using symmetric diffusions on manifolds (see Theorems 4.2 and 6.1 ibid). In particular, the OU process is identified as the unique time-reversible diffusion with Gaussian sdi and constant diffusion coefficient. This characterization is key for constructing analogues of the OU process in by means of Langevin diffusions driven by Gaussian-like toroidal distributions.
The construction of Langevin toroidal diffusions is achieved by wrappings of Langevin diffusions, where now is a toroidal density, that is, and , .
Proposition 2**.**
Assume is obtained from the wrapping of a Langevin diffusion with drift (5), given by a strictly positive toroidal density . Assume that the second derivatives of both and the entries of are Hölder continuous, and that is -periodic. Then, for the given , is the unique toroidal time-reversible diffusion that is ergodic with stationary density and squared diffusion coefficient .
Proof.
We provide a sketch. The time-reversibility with equilibrium density follows from Theorem 10.1 in Kent (1978) using the compactness (makes conservative), flatness, and global coordinates of . The equilibrium distribution is also the (unique) sdi, so is ergodic. To show the uniqueness, note that by Theorem 6.1 ibid a time-reversible diffusion must have an equilibrium density and be -symmetric, where necessarily . By Theorem 4.2 ibid (and its proof) the only way a diffusion with a given can be -symmetric is if its drift is (5). ∎
As a consequence, any time-reversible toroidal diffusion with stationary density and is of the form
[TABLE]
The rest of the paper focuses on diffusions of this form.
2.2 Analogues of the Ornstein–Uhlenbeck process
The vM process can be considered as the circular analogue of the OU process (Kent, 1975). Two arguments support this claim: (i) the vM process is the unique time-reversible diffusion with vM sdi and constant diffusion coefficient; (ii) the vM distribution is usually regarded as the Gaussian circular analogue due to important Gaussian-like characterizations (Jammalamadaka and SenGupta, 2001, Section 2.2.4). However, it is worth to note that a similar argument to (ii) holds for the WN: this distribution exhibits certain similarities with the Gaussian (ibid, Section 2.2.6) and, contrary to the vM distribution, it appears in Gaussian-related limit laws such as the wrapped version of the central limit theorem (Mardia, 1972, Section 4.3.2).
In this section we investigate the main properties of the Langevin diffusions driven by the multivariate versions of the vM and WN distributions. In addition, we consider two appealing extensions driven by more flexible sdis: the symmetric circular distribution of Jones and Pewsey (2005) and mixtures of (independent) vM distributions. These processes are later employed in Section 4.
2.2.1 Multivariate von Mises
The multivariate extension of the vM distribution is not immediate: several competing alternatives are described in the literature, see Mardia and Frellsen (2012) for a review focused on the bivariate case. Among the available proposals, we chose the Multivariate von Mises (MvM) with sine interaction (Mardia et al., 2008) due to its pleasant modelling properties: simple unimodal characterization, ability of capturing positive/negative dependence within the same density formulation, and vM conditional distributions. The pdf is
[TABLE]
where the trigonometric functions are understood as entry-wise operators, , is a symmetric matrix with zero diagonal, and is the normalizing constant. If , then the MvM distribution is the product of independent vM, and hence . A sufficient condition for unimodality is that is positive definite (Mardia and Voss, 2014), a result related to the fact that, for large concentrations , . The operator denotes either the diagonal extraction or the diagonal matrix construction, depending on its argument.
The non-linear dependence structure of the MvM distribution forces in the associated Langevin diffusion to be isotropic (i.e., ) if separability between the drift and diffusion coefficients is desired. We opted to preserve separability and to generalize (1) by having a \mathrm{MvM}\big{(}\boldsymbol{\mu},\frac{2\boldsymbol{\alpha}}{\sigma^{2}},\frac{2\mathbf{A}^{*}}{\sigma^{2}}\big{)} sdi:
[TABLE]
where denotes the element-wise product of matrices, , , and is a positive definite matrix. The equilibrium points of drift are located at , with (we assume implicit wrapping by in the sums of angles in this section), and are unstable if any component is antipodal, this is, unless (see Figures 1 and 2). The drift is approximately linear in a neighbourhood of and has Jacobian . For the unstable points, the drift has Jacobian , with a vector of signs. In the circular case, the maximal drifts (in absolute value) towards are placed at (see Figure 1). For the general case, the maximal marginal drifts for the -th component happen at \mu_{j}-\tan^{-1}\big{(}A_{jj}\big{[}\sum_{k\neq j}A_{jk}\sin(\mu_{k}-\theta_{k})\big{]}^{-1}\big{)}+k_{0}\pi, .
2.2.2 Wrapped normal
The pdf of a (multivariate) wrapped normal, , is given by , with , a covariance matrix, and the pdf of a . For the sake of clarity of exposition, we first introduce the circular case and then the multivariate extension. Using the OU parametrization, the circular WN process with \mathrm{WN}\big{(}\mu,\frac{\sigma^{2}}{2\alpha}\big{)} sdi is defined as
[TABLE]
Despite the similar shape of the vM and WN densities in the main bulk of the probability, their behaviour is substantially different at antipodality, a fact strengthened in log scale. The WN process drift is a smoothed “sawtooth wave” that has negative slope at and crosses the -axis at , . Hence, the drift behaves almost linearly in a neighbourhood of (equilibrium point, stable) and rapidly decays to pass across (equilibrium point, unstable). This neighbourhood is larger than for the vM process. There is no separability between and and both alter the drift non-trivially. For example, the drift maxima are implicitly given by \sum_{k\in\mathbb{Z}}k^{2}w_{k}(\theta)-\big{[}\sum_{k\in\mathbb{Z}}kw_{k}(\theta)\big{]}^{2}=\frac{\sigma^{2}}{8\alpha\pi^{2}}, and vary from (if , the sdi is degenerate at ) to (if , the sdi is uniform and the drift is null). Thereby, the maximum drifts always happen closer to antipodality than in the vM process (see Figure 1). The slopes of the drift at and are and , respectively, where
[TABLE]
The lower and upper bounds for (respectively, ) are attained, with fixed, when () and (), respectively.
The multivariate extension of (6) is the diffusion
[TABLE]
This diffusion has sdi, provided that is invertible and such that is a covariance matrix. The drift is null at , with , since due to the symmetry of as a function of . Properties similar to the circular case can be obtained using that . For instance, the Jacobian of the drift at is -\mathbf{A}+8\pi^{2}\mathbf{A}\big{[}\sum_{\mathbf{k}\in\mathbb{Z}^{p}}\mathbf{k}\mathbf{k}^{\prime}w_{\mathbf{k}}(\boldsymbol{\mu})\big{]}\allowbreak\mathbf{A}^{\prime}\boldsymbol{\Sigma}^{-1}.
The vector field of the drift has a characteristic tessellated structure that, in the two-dimensional case, is formed by hexagonal-like tiles (see Figure 2). alters the tessellation that binds the drifts by modifying . This set is the distribution of the winding numbers of , since and satisfies that . Under isotropy (i.e. ), the larger (respectively, smaller) , the more spread (concentrated) the distribution of winding numbers is, resulting in flat (peaked) drifts with smooth (rough) transitions in the limits defining the tessellation.
2.2.3 Jones and Pewsey (2005)’s circular distribution
The Jones and Pewsey (2005) distribution, , is a tractable family of symmetric and unimodal circular distributions that contains the Wrapped Cauchy (WC, ), Cardioid (Ca, ), and von Mises () distributions. Its pdf is , with , , , and the Legendre function of the first kind and order .
The diffusion with \mathrm{JP}\big{(}\mu,\frac{2\alpha}{\sigma^{2}},\psi\sigma^{2}\big{)} sdi, parametrised to yield (1) as a particular case, is
[TABLE]
The maximal drifts, located at , are closer to the equilibrium mean when and to the antipodal mean when . The slope of the drift at is . At , it is . This relates to the fact that the drifts with equal the ones with , once translated by and reflected around . Hence, whilst the WC diffusion features a drift attracting the process towards a tight neighbourhood around , the Ca diffusion repulses the process from and weakly attracts it towards (see trajectories and drifts in Figure 1).
2.2.4 Mixtures of independent von Mises
The density of an -mixture of independent von Mises distributions, , is given by , with , , , and , and . The mivM distribution is a highly flexible tool for modelling multimodal and skewed circular data (Banerjee et al., 2005), and has tractability as a key advantage: the normalizing constant is known and estimation by the Expectation-Maximization (EM) algorithm is relatively easy. Setting and ,
[TABLE]
has \mathrm{mivM}\big{(}\mathbf{M},\frac{2\mathbf{A}}{\sigma^{2}},\mathbf{p}) sdi. The mivM process drift is a weighted average of the corresponding component drifts, whose weights are the posterior probabilities of drawing from the mixture components of the sdi. The drift behaves locally around as , with (Figures 1 and 2). Then, is only an asymptotic equilibrium point for , since . The larger , the smoother the binding of the component drifts is.
3 Estimation for toroidal diffusions
We focus now on the estimation of the vector parameter of a toroidal diffusion
[TABLE]
when the data are observations at discrete time points, . For simplicity, we assume that the time points are equidistant in the time interval , . The Maximum Likelihood Estimator (MLE) for is given by
[TABLE]
where, using the Markovianity of (9), the log-likelihood is given by
[TABLE]
Here is the tpd of (9). The first term in (10) is often disregarded or set to the sdi of (9). Maximum likelihood estimation is, under weak regularity conditions, consistent and asymptotically efficient when with fixed (Dacunha-Castelle and Florens-Zmirou, 1986), or when and (Sørensen, 2008). However, it can rarely be readily performed, as usually no explicit expression for the tpd exists and this tpd is only given implicitly as the solution to (3) on .
In the following we present and analyse several estimation strategies to circumvent the unavailability of the tpd when dealing with toroidal diffusions. All these methods rely on an approximate likelihood function, where the unknown tpd is replaced by an approximation. For the sake of brevity, we suppress the, implicitly assumed, dependence on in the notation.
3.1 Estimation based on the stationary distribution
The simplest approximate likelihood function is obtained by replacing the tpd by the stationary density of (9). Usually, the sdi depends only on a function of . For instance, for the WN process, and . Therefore, we denote the stationary density by and state the Stationary MLE (SMLE) of as
[TABLE]
For the vM process, SMLE is semi-explicit (Mardia and Jupp, 2000, page 198). The JP distribution has implicit SMLE and is discussed in Jones and Pewsey (2005, Section 3). Effective estimation in MvM distributions involves pseudo-likelihood (Mardia et al., 2008). Finally, inference for mivM distributions can be carried out by the EM algorithm (Banerjee et al., 2005). The simple SMLE is of interest for three reasons: (i) for stationary ergodic processes, it is consistent for as for fixed (Kessler, 2000); (ii) can be used as a sensible starting value in the optimization routines of more sophisticated procedures; (iii) it can be supplemented by estimators of the rest of (see Bibby and Sørensen (2001), for example).
When the unidentifiability of by SMLE involves the diffusion matrix , an estimator of can be obtained by an estimator of that is unrelated to the SMLE. Conditionally on , is approximately distributed as when (high frequency observations). This, plus the high concentration of such WN distribution (see Remark 3 below), gives
[TABLE]
Thus, an approximate MLE of is
[TABLE]
Under isotropy, . The Euclidean counterpart of (12) is well-known to be a consistent estimator of as (for fixed ) due to the convergence in probability to the quadratic variation. The consistency for follows easily from this result.
The estimator (12) gives a practical method to disentangle the unidentifiability inherent to SMLE. We illustrate this with the WN process. The SMLE for , where , can be found by optimizing (11). The circular means, \hat{\boldsymbol{\mu}}_{c}:=\mathrm{atan2}\big{(}\sum_{i=1}^{N}\sin(\boldsymbol{\Theta}_{i\Delta}),\allowbreak\sum_{i=1}^{N}\cos(\boldsymbol{\Theta}_{i\Delta})\big{)}, and the high-concentration estimate of , , can be used as starting values. and (12) give , resulting in . Similar approaches can be followed for the rest of the diffusions presented in Section 2.
3.2 Adapted Euler and Shoji–Ozaki pseudo-likelihoods
The well-known Euler pseudo-likelihood can be adapted for toroidal diffusions with minor changes. The Euler scheme arises as the first order discretization of the process, where the drift and diffusion coefficient are approximated constantly. After wrapping, the scheme becomes
[TABLE]
where , . The wrapping yields the Euler pseudo-tpd
[TABLE]
When , the Euler pseudo-tpd converges to the uniform distribution in by spreading its probability mass whilst the mean moves along the wrapped line . The Euler pseudo-likelihood is obtained from (10) by replacing the tpd by the Euler pseudo-tpd.
The Shoji–Ozaki (Shoji and Ozaki, 1998) scheme uses a linear approximation for the drift and assumes the diffusion coefficient constant between observation times: for , , where denotes the Jacobian of at . This gives the linear approximating SDE
[TABLE]
Conditionally on , this is a multivariate OU process. Hence, , with , , and . If has no pair of reverse-sign eigenvalues, then
[TABLE]
If is symmetric, then admits a more explicit form222Note the similar argument given in Roberts and Stramer (2002), albeit in their equation (24) the covariance matrix is not symmetric, probably because of a typo in (25), which should have been .:
[TABLE]
Interestingly, for the Langevin family of diffusions, is guaranteed to be symmetric as long as the diffusion coefficient is constant. This is due to the particular form of (5), which gives , where stands for the Hessian of at . Therefore, (14) simplifies notably the evaluation of the Shoji–Ozaki pseudo-likelihood for all the toroidal diffusions considered in this paper.
The Shoji–Ozaki pseudo-tpd for toroidal diffusions is333In Shoji and Ozaki (1998) the drift approximation is done by Itô’s formula. To obtain a simpler pseudo-likelihood, we use a local linear approximation of as in Ozaki (1985) (for the case ). Without this extra simplification, the expectation becomes with and , .
[TABLE]
where, assuming that is symmetric (otherwise use (13) instead of (14)),
[TABLE]
When shrinks to , then and , so the Euler scheme follows by continuity. If all the real parts of the eigenvalues of are negative, then p^{\mathrm{SO}}_{\Delta}(\boldsymbol{\theta}\,|\,\boldsymbol{\varphi})\underset{\Delta\to\infty}{\longrightarrow}f_{\mathrm{WN}}\big{(}\boldsymbol{\theta};\boldsymbol{\varphi}-J(\boldsymbol{\varphi})b(\boldsymbol{\varphi}),-\frac{1}{2}J(\boldsymbol{\varphi})^{-1}V(\boldsymbol{\varphi})\big{)} and the pseudo-tpd does not degenerate into a uniform density as Euler’s does. Otherwise, the pseudo-tpd converges to the uniform distribution in exponentially fast (see Figure 3), at a rate controlled by the maximum positive real part of the eigenvalues.
A disadvantage of these pseudo-likelihoods is that they are unimodal, so they cannot capture the multimodality of the tpd, a distinctive feature of toroidal diffusions.
Remark 3**.**
Evaluating for the above pseudo-tpds is a computationally demanding task. Several approximations are possible:
- i.
High-concentration*. Use the closest winding number as a one-term truncation of the series, i.e., .* 2. ii.
Fixed truncation*. Mardia and Jupp (2000, page 50)** suggests (for ) , which is usually enough for practical purposes if the argument lays in .* 3. iii.
Von Mises moment matching*. Uses the approximation , with (Mardia and Jupp, 2000, page 38). This approximation generalizes easily to the multivariate case only if is diagonal. For the bivariate case, an alternative is to use a von Mises score matching (Mardia, 2017).* 4. iv.
Adaptive truncation*. The Jona-Lasinio et al. (2012)**’s “ adaptive truncation” can be generalized to the multivariate case by Bonferroni: with , where is the upper -quantile of a , ensures a probability mass in larger than .*
For , a simple compromise between tractability and accuracy is combining i and ii into , which has a probability coverage of larger than.
3.3 Wrapped Ornstein–Uhlenbeck approximation of the WN process
We now present a specific approximation for the tpd of the WN process that allows to model the multimodality in the tpd. Multimodality is not uncommon for toroidal diffusions since each coordinate can move towards its mean value in two directions and, contrary to what happens with the OU process, this implies that neither the WN nor the MvM processes have tpds within the parametric families of the sdis.
The approximation relies on the connection of the WN process with the tractable multivariate OU process:
[TABLE]
with , a covariance matrix, and such that is a covariance matrix. The last assumption ensures that the OU process is ergodic and time-reversible, and as a consequence, implies a simple expression for the covariance matrix of the tpd (see below). Under this setting, the process is ergodic, time-reversible, and has stationary density \mathcal{N}\big{(}\boldsymbol{\mu},\frac{1}{2}\mathbf{A}^{-1}\boldsymbol{\Sigma}\big{)}. We denote by WOU, standing for Wrapped multivariate OU process, to the wrapping of (15). Assuming that \mathbf{X}_{s}\sim\mathcal{N}\big{(}\boldsymbol{\mu},\frac{1}{2}\mathbf{A}^{-1}\boldsymbol{\Sigma}\big{)}, the conditional density of WOU is given by Proposition 1 and the tpd of (15):
[TABLE]
where, by the same argument used in (14),
[TABLE]
The conditional density (16) can be seen as a wrapping of the tpd of (15) weighted by the sdi of the winding numbers, which resembles the structure of the WN process drift: a weighting of linear drifts like (15) according to the winding number sdi in order to achieve periodicity. Albeit (16) and the tpd of the WN process are different, they behave similarly in many situations. The next corollary from Proposition 1 formalizes these arguments.
Corollary 1**.**
Suppose solves (7) with and let be the wrapping of the solution to (15), where . We condition, moreover, on . Then:
- i.
As , and in probability. 2. ii.
As , both and converge in distribution to a . 3. iii.
When with bounded, in probability, so the distributions of and are similar in the limit. 4. iv.
satisfies , (just like ).
Proof.
The first two statements for the WN process are well-known for any diffusion, and it follows from (16) that, for , and that . The last statement follows from (16) and the fact that the OU process is time-reversible when is positive definite. We give a rough sketch of a proof of the third statement. The result follows because the tpd of the WN process is asymptotically equal to the tpd of the OU process in the high concentration limit. To see this, suppose that solves (15) with (we can ignore the other starting points), and that solves (7) with , both driven by the same Wiener process. Then solves , with , where
[TABLE]
If in probability, then the two distributions of and will be the same in the limit. This follows because and for and (we consider only the case because ), and hence in probability for all . ∎
The tractability of (16) degenerates quickly with the dimension, but it can be readily computed for , two highly relevant situations in practice. We focus our attention on implementation matters for the non-trivial case . The first point of inquiry is what parametrization of and leads to a covariance matrix , which guarantees a non-degenerate WN sdi.
Lemma 1**.**
Let and be matrices, \boldsymbol{\Sigma}=\big{(}\sigma_{1}^{2},\allowbreak\rho\sigma_{1}\sigma_{2};\rho\sigma_{1}\sigma_{2},\sigma_{2}^{2}\big{)} positive-definite. Assume . Any matrix such that is a covariance matrix has the form
[TABLE]
with .
The parametrization with provides a compromise between flexibility and simplicity, and will be employed throughout (first occurrences in Figures 3 and 5). With the dependence between components is modelled by , which is clear from
[TABLE]
The second point is the efficient computation of and . In virtue of Corollary 2.4 of Bernstein and So (1993), with (if , then, by continuity, ), , , and . Therefore,
[TABLE]
with and . Expression (17) shows neatly the interpolation between the infinitesimal and stationary covariance matrices and is especially useful if it is required to compute the tpd for several ’s.
To conclude, we highlight some of the advantages of the WOU approximation over the Euler and Shoji–Ozaki pseudo-likelihoods for the WN process. Firstly, WOU is able to capture the multimodality of the tpd (see Figure 3) and has the correct sdi. Secondly, WOU is faster to compute than Shoji–Ozaki, as it does not require exponentiation and inversion of the Jacobian matrix for each observation, but only once.
3.4 Likelihood by numerical PDE solution
An alternative to approximate likelihoods is to compute the “exact” (up to a prescribed accuracy) MLE by a numerical solution of (3). This approach is computationally expensive, but remains valid for arbitrary diffusions and discretization times. Moreover, it provides insightful visualizations of the tpd. In the following, we discuss how to solve numerically (3) for dimensions .
3.4.1 One-dimensional case
We consider a state grid in constructed with step , and such that and . We also consider a time grid in with . For consistency with the common notation for PDEs, we refer by to , the solution of the PDE for the initial condition (at time ) given by a circular density . The vector , , denotes the tpd evaluated at at time . We write and , .
We employ the so-called Crank–Nicolson scheme for discretizing (3), which can be rewritten as
[TABLE]
Crank–Nicolson is a well-known scheme for diffusion and convection-diffusion PDEs such as (3). It is based on a trapezoidal-like approximation of the forward difference of the time derivative that is combined with a centered finite differences of the state derivatives:
[TABLE]
with , , , and . The next step in time of the solution, , is implicitly given by the system
[TABLE]
with subscript denoting the vector with entries circularly shifted position. It is well-known (Thomas, 1995, page 225) that this periodic tridiagonal system can be solved efficiently by tacking the tridiagonal systems and (where ), and using the Sherman–Morrison formula: . The latter tridiagonal systems can be jointly solved by a modification of the Thomas algorithm, since they share coefficient matrix. The cost of the solution is . In addition, since is constant with respect to time, the tridiagonal LU factorization underlying the Thomas algorithm can be reused, yielding a complexity factor reduction of on the tridiagonal solver.
3.4.2 Two-dimensional case
We consider now two grids and analogous to , but of sizes and , and steps and . We refer by to , where is a toroidal density giving the initial condition (at time ). The matrix , , denotes the tpd evaluated at at time . We write , , , with standing for or , and , . With this notation, (3) becomes
[TABLE]
The Crank–Nicolson scheme proceeds as in the one-dimensional case:
[TABLE]
with finite differences that can be collected into three terms associated to the partial and mixed derivatives:
[TABLE]
We have denoted , , and
[TABLE]
Let be the linear functions mapping into and the identity function. Then, we can express (19) as
[TABLE]
If the left and right hand sides of (20) are stacked column-wise, (20) becomes an periodic -diagonal system. This system cannot be solved so efficiently as in the tridiagonal case, requiring a more complex algorithm or a generic sparse LU factorization.
An alternative approach that reduces drastically the computational burden of solving (20) is to adopt an Alternating Direction Implicit (ADI) scheme. ADI schemes split the multidimensional finite differences in a series of univariate discretizations with simpler associated systems. Originally developed for the diffusion equation, they were extended to the convection-diffusion equations with a mixed derivative term by McKee et al. (1996), in the so-called Douglas scheme. This scheme proceeds with an explicit multivariate step corrected by two unidimensional Crank–Nicolson steps, whose purpose is to stabilize the explicit step:
[TABLE]
Consequently, if the matrix equations in (21)–(23) are transformed into linear systems by column-wise stacking for (21) and (22), and row-wise stacking for (23), the Douglas scheme transforms the difficult task of solving (20) into solving two periodic tridiagonal systems of size . Specifically, the steps in (21)–(23) are carried out using
[TABLE]
is obtained by setting equal to , or in the above expressions and by solving (22) and (23) as (18) was. Then, the total cost of the solution is . Note that the row-stacking vector can be directly obtained from by extracting the indexes ((k_{c}-1)\mod M_{y})M_{x}+\big{\lfloor}\frac{k_{c}-1}{M_{y}}\big{\rfloor}+1, , of the latter (analogous for the converse). We refer to the neat expository paper of In ’t Hout and Foulon (2010) for further description of ADI schemes.
3.4.3 Remarks on the discretization schemes
The Crank–Nicolson and Douglas schemes are tailored solutions for solving (3) that exploit the particular PDE structure. It is worth to note that, among other methods, a well-known approach to solve PDEs is the method of lines. This method is prone to create stiff systems, which need to be handled properly by a meta-solver that chooses between stiff and non-stiff solvers (e.g., the lsoda implementation in Soetaert et al. (2012)). Not surprisingly, in our application we found that the efficiency and reliability of the tailored solutions were superior to the latter, much more general, meta-solver.
Some theoretical remarks about the schemes employed are given as follows. The Crank–Nicolson scheme is conservative (hence the Douglas scheme is too), which can be easily seen from the periodic tridiagonal system. It is also second-order consistent in time and space (with the discretization used), with the appealing property of being unconditionally stable with respect to . The Douglas scheme is first-order consistent and unconditionally stable when applied to two-dimensional convection-diffusion equations with a mixed derivative term. See In ’t Hout and Foulon (2010) for the description of second-order ADI schemes of the same computational complexity (but with a factor increase of at least two). Both unconditional stabilities refer to the usual framework of constant coefficients.
3.4.4 Likelihood evaluation
The PDE numerical solutions approximate , where is a density over giving the initial condition. Therefore, can be approximated by considering a concentrated as the initial condition. For a fixed grid, must not be set to an arbitrarily small value, as it will create a sharp initial condition poorly discretized and prone to raise numerical errors. A possible rule of thumb is to choose a small such that the periodic trapezoidal rule of the discretized is close to one.
We illustrate the evaluation of the log-likelihood (10) from the PDE solution for . The extension to is conceptually straightforward, albeit cumbersome in notation. Given the sample and the grid , let denote by the tpd matrix of the process discretized in . The -th column of is obtained by solving the PDE with initial condition . We can approximate from by linear interpolation:
[TABLE]
with , , and . The log-likelihood is obtained by plugging (24) into (10). The advantage of doing so is that the number of PDE solutions required for a single log-likelihood evaluation remains bounded by , irrespectively of . In addition, we only need to compute the columns of corresponding to the unique set of indexes . A simpler, though less precise, alternative to (24) is to use constant interpolation for . This results in a lower number of PDE solutions, specially in the two-dimensional case. Finally, if the drift is antisymmetric around a point , then . Hence, if is circularly centered at , half of the columns of contain redundant information. The situation is analogous for : if , , and and are both centered at and , respectively, then only half of the columns of are required. If the drift is isotropic, then only one fourth of the columns are needed.
4 Simulation study
We measure now the performance of the likelihood approximations given in Section 3. Two types of empirical analysis are employed. First, we compare the divergences between the true tpd of a diffusion and its approximations across time. Second, we examine the errors of the approximate likelihoods in estimating in several diffusions.
4.1 Kullback–Leibler divergences for WN and vM processes
All the estimation approaches described on Section 3 share a common root: the substitution of the true tpd by an approximation . The goodness-of-fit of these approximations has a direct influence on MLE since, for a general parametric setting, MLE is equivalent to minimizing the Kullback–Leibler divergence of the parametric pdf from the empirical pdf. We propose to measure the Kullback–Leibler divergence of from by weighting with the stationary density the contributions of each initial point :
[TABLE]
The curve gives a succinct summary of the goodness-of-fit of any approximation to the tpd across time. Its effective computation – when no analytical expression for the tpd exists – can be done with the PDE solution to the tpd. Some care is needed though. The PDE solution involves the initial condition in the form of a concentrated . This initial condition implies that the PDE solution is approximating rather than . Therefore, a more adequate approach is to smooth also the approximations in the computation of to perform a fair comparison:
[TABLE]
We explore the curves for several variants of the approximations given in Section 3, denoted as S (Stationary density), E (Euler), SO (Shoji–Ozaki), UE (Unwrapped Euler – the usual Euler pseudo-likelihood), USO (Unwrapped Shoji–Ozaki), EvM, SOvM, and WOU. Suffix vM denotes the use of a vM distribution (moment if one-dimensional; score if two-dimensional) matching approximation to the WN distribution appearing in the pseudo-likelihoods.
Figures 4 and 5 show the Kullback–Leibler curves for the WN process with and , under different drift strengths and diffusivities. We highlight as follows their main features. First, WOU outperforms in almost all scenarios and times the other approximations. The main exceptions are the lower left scenarios of both figures, representing processes with a high diffusivity (small drifts and large diffusivities), where WOU is outperformed by SO and E for a significant range of intermediate times. In addition to S, WOU is the only approximation whose accuracy improves as time increases, above a certain local maximum in the Kullback–Leibler divergence. Second, the Euler and Shoji–Ozaki pseudo-likelihoods deteriorate or stabilize as time increases, except for scenarios with low and moderate diffusivity where SO is close to WOU (and both are close to the true tpd). E is systematically behind SO in performance, usually by several orders of magnitude. S is, as expected, giving a poor performance unless is large. Third, the wrapped versions of the pseudo-likelihoods dominate uniformly the unwrapped ones, both having similar performances if the process is highly concentrated. Indeed, the wrapping of SO is key in preventing the spread of probability mass outside when the Jacobian of the drift has positive eigenvalues and grows, which raises numerical instabilities (e.g., lower right panel of Figure 5). Finally, matching the WN distribution of E and SO by a vM has different effects depending on the method. For E, the results are similar for both E and EvM, except for a bump in small times with high diffusivities. However, SOvM consistently adds a high bias to SO, resulting in significant higher divergences. As a general advice, we recommend to approximate the tpd of the WN process by WOU, SO and E, in this order.
We reproduce the same experiment on the vM process, with results collected in Figures 6 and 7. The highlights are similar except for the following differences. First, the good properties that WOU has for the WN process do not hold any more, evincing its process-specificity. S is now the only approximation whose accuracy improves over time. Second, SO is systematically above E in performance, yet this difference is reduced as SO is not the true tpd under high-concentration. Third, the vM distribution match does not provide a better approximation to the tpd, despite the sdi being vM. EvM is again close to E and EvM except for small ’s where EvM adds a substantial bias for scenarios with moderate and high diffusivities. The same happens for SOvM in , whereas for SOvM increases the Kullback–Leibler divergence by several orders of magnitude when compared to SO in the scenarios with high diffusivity. Our general advice is to approximate the tpd by SO and E, in this order.
4.2 Empirical performance of the approximate likelihoods
We compare now the efficiency of WOU, SO, and E – the best performing tpd approximations, according to the weighted Kullback–Leibler divergences – in estimating the unknown parameters of the diffusion (9) from a trajectory . In this section, we set and assume that is known in order to avoid the inherent unidentifiabilities of when is large and the tpd converges to the sdi. We explore the behaviour of the estimators for dimensions , time steps , and for representative parameter choices of the WN process and of two challenging diffusions. For , we also consider the PDE-based approximation to the likelihood. The trajectories are simulated using the E method with time step and then subsampled for given ’s.
In order to summarize the overall performance of a collection of -variate estimators of , we consider a global measure of relative performance. This measure is the componentwise average of Relative Efficiency (RE), where the relative efficiency is measured with respect to the best estimator at a given component in terms of Mean Squared Error (MSE):
[TABLE]
Hence, if is the best estimator for all the components of , then . We estimate by Monte Carlo with replicates, where is obtained by maximizing the approximate likelihood with a common optimization procedure that employs (11) as starting values.
4.2.1 WN process
Table 1 shows the relative efficiencies for E, SO, WOU, and PDE with . When averaging across scenarios and discretization times, the global ranking of performance is: WOU (), PDE (), SO (), and E (). On average, E is the best performing method for , followed closely by SO. However, the relative performance of E severely decays as increases. A similar pattern is present for SO, although the decay in relative efficiency is less severe, being by a narrow margin the best performing method for (above E and WOU with an absolute difference lower than ). PDE is significantly underperforming for , which is explained by the bias induced by the initial condition: was considered as a compromise between tractability (, ) and accuracy. PDE becomes the best performer on average for , where the effects of the initial condition become less important. WOU shows an intermediate profile with an indubitable advantage: on average, its relative efficiency has an absolute difference with respect to the best performing method of less than . This fact is what makes it the best method on the global ranking of performance.
Table 2 gives the relative efficiencies for E, SO, and WOU in . When averaging across scenarios and discretization times, the global ranking of performance is: WOU (), SO (), and E (). Similarly to , E is the best performing method for and its relative efficiency quickly decays as increases. SO and WOU perform similarly for low diffusive scenarios (), but for WOU significantly outperforms SO for , a fact explained by the proneness of the tpd to be multimodal in those situations. The competitive performance of WOU for under all scenarios and ’s, in addition to its affordable computational cost, places it as the preferred estimation method for the WN process.
4.2.2 Other processes
The WC diffusion has a remarkably different drift from the WN process (Figure 1). As a consequence, the tpd of the WC diffusion quickly becomes highly non-WN (multimodal, “heavy tails”, peaked), both the opposite defining features of the pseudo-tpds. This affects the relative efficiencies for E, SO, and PDE given in Table 4, whose global performance is: PDE (), SO (), and E (). The supremacy of the PDE, except for small drift () and , is evident. Thus, Table 4 is an illustration of the low efficiency of applying the Euler and Shoji–Ozaki pseudo-likelihoods for highly non-WN processes at arbitrary ’s.
Finally, Table 5 shows the relative efficiencies of E and SO for a mivM diffusion with antipodal means. In order to avoid spurious maximums, was estimated by SMLE and then kept fixed when optimizing the approximate likelihood. The global performances are: SO (), and E (). The analysis by ’s shows that, as in the WC diffusion, SO is performing better than E except for . However, inspection of the tpd shows a prevalent multimodality, which points towards a low efficiency of the pseudo-likelihoods when is not small.
5 Application to molecular dynamics
Toroidal data arises from the representation of the backbone of a protein made of amino acids as a sequence of pairs of dihedral angles , thus as a point in . The dihedral angles capture the rotations around the N–Cα and Cα–C bonds, which are the remaining degrees of freedom of the backbone (if the bond angles and bond lengths are assumed fixed to their ideal values). Molecular dynamics simulations are widely employed to study the folding and the dynamical properties of proteins, providing ultra high frequency trajectories of protein structures. The dihedral angles of the time-varying backbone result in a trajectory . Diffusive models on the torus are appropriate tools to summarize these trajectories and, once fitted, can be used as computationally affordable emulators of the physical process.
We consider data from molecular dynamics simulations of the protein G (Protein Data Bank identifier 1GB1) around its native state. This protein contains amino acids and, due to its relatively small size and availability of extensive experimental data, is commonly considered in the molecular dynamics literature. The molecular dynamics simulations were done using the CHARMM36 force field with the EEF1-SB solvent model (Bottaro et al., 2013) during nanoseconds equally discretized in time cuts, which afterwards were subsampled to . For the sake of illustration, we study two specific trajectories: of the -th amino acid (Glycine, between Asparagine and Lysine), and of the -th amino acid (Glycine, between Lysine and Glutamate). These one- and two-dimensional trajectories exhibit multi- and unimodal patterns that are representative of the general case.
The one-dimensional multimodal trajectory was modelled with a diffusion driven by a mixture of two vM distributions, as given in (8). The fitting was done with the PDE method with , , and . We used SMLE and (12) as starting values, and fixed the mixture proportions to the stationary estimates to avoid spurious minima. The optimization took seconds in a GHz core for likelihood evaluations and gave , , , and . The first row of Figure 8 presents a graphical summary of the parametric fit. The first panel shows the observed data and a simulated trajectory from the fitted model, which captures the main patterns of the observed data, except for some outliers.
In order to evaluate the goodness-of-fit of the parametric model – and due to the absence of formal tests directly applicable in this setting, to the best of the authors’ knowledge – we compared graphically the parametric fits of the drift and diffusion coefficient with their nonparametric estimations. To that aim, we considered the following Nadaraya–Watson estimator for the drift
[TABLE]
with and as the bandwidth parameter. For the diffusion coefficient, we set and then took the square root in the estimate. To remove the smoothing bias of (25), we smoothed the parametric estimate by considering in (25), hence equating both biases under the correct specification of the model. The second panel in first row of Figure 8 compares the nonparametric and smoothed parametric estimates of the drift. Both drifts are shadowed according to a kernel density estimate that emphasizes the regions were the data is present. For those regions, there is a close match between both estimates. The third panel shows a similar analysis for the diffusion coefficient, whose nonparametric estimate exhibits mild departures from in the regions with high density.
For modelling the two-dimensional and unimodal trajectory we employed a bivariate WN diffusion with unconstrained . The fitting was done with the WOU approximation using SMLE and (12) for starting values. The optimization took seconds for approximate likelihood evaluations. The first panel in the second row of Figure 8 shows the correct match between the simulated and the observed trajectories, again except for some outliers from the latter. The next panel shows the comparison between the vector fields for the smoothed parametric and nonparametric drifts. They show a strong agreement on the drift structure at regions with presence of data, both in magnitude and direction. The parametric vector field and the nonparametric have a proper match for the regions with data, the latter being constant in most of . The nonparametric estimates were constructed by considering product kernels on the covariates. All the bandwidths were automatically selected by cross-validation.
6 Conclusions
We introduced ergodic diffusions on the torus as the natural processes with stationary distributions equal to well-known toroidal distributions. The WN process, with an available analytical approximation to its tpd, is shown to be the most tractable OU-like toroidal process among the different proposals. This approximation outperforms the wrapped Euler and Shoji–Ozaki pseudo-likelihoods, and shows an affordable computational cost for one and two dimensions. In addition, we provide numerical solutions of the one- and two-dimensional Fokker–Planck PDEs for approximating the true tpd, which serve as benchmarks of the accuracy of the approximating tpds. A thorough simulation study explored the performance of the approximate likelihoods under different scenarios. Finally, a data application illustrated the usefulness of the new diffusive models for modelling molecular dynamics simulations.
We summarize some important practical conclusions. For estimating the WN process, we recommend to use WOU as a first option for a fast and accurate approximation in dimensions . For a general process, we advise to employ PDE with if accuracy is a priority, and SO in case speed is. For , SO is preferred to E, but both are prone to underperform severely for highly non-WN tpds, which can be visualized using the PDE solution.
The development of a general and computationally fast method for approximating an arbitrary tpd, that is able to cope with multimodality, remains an open challenge. A promising avenue is methods based on simulation, which have been successful for Euclidean diffusions; see e.g. Beskos et al. (2006), Papaspiliopoulos and Roberts (2012), Sermaidis et al. (2012), Bladt et al. (2006), and references in these papers. The simplest algorithm by Beskos et al. (2006a) is well suited for exact simulation of the transient diffusion (i.e., before wrapping) because of the periodicity of the coefficients, and the method in Sermaidis et al. (2012) is applicable to Langevin diffusions. It is therefore likely that the exact simulation methods can be adapted to toroidal Langevin diffusions by finding ways to deal with the wrapping when simulating diffusion bridges. It is also of interest to study whether the coupling methods underlying the diffusions bridge simulation technique in Bladt et al. (2006) can be adapted to the torus setting. Another interesting approach would be to include the winding number for each observation as a latent variable and apply methods like the EM algorithm or the Gibbs sampler for likelihood inference.
Software
The software sdetorus, available at https://github.com/egarpor/sdetorus, contains the implementations of the methods described in the paper and the files required for reproducing all the empirical analyses.
Acknowledgements
This work is part of the Dynamical Systems Interdisciplinary Network, University of Copenhagen. It was funded by the University of Copenhagen 2016 Excellence Programme for Interdisciplinary Research (UCPH2016-DSIN) and by project MTM2016-76969-P from the Spanish Ministry of Economy, Industry and Competitiveness, and European Regional Development Fund (ERDF). We acknowledge the insightful discussions with John Kent, Jotun Hein, and Michael Golden that led to the key motivation for the manuscript. We are grateful to Sandro Bottaro for the providing the molecular dynamics data used in the illustration. We acknowledge the valuable comments and remarks provided by two anonymous referees and an Associate Editor, which significantly improved the manuscript.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Banerjee et al. (2005) Banerjee, A., Dhillon, I. S., Ghosh, J., and Sra, S. (2005). Clustering on the unit hypersphere using von Mises-Fisher distributions. J. Mach. Learn. Res. , 6:1345–1382.
- 2Bernstein and So (1993) Bernstein, D. S. and So, W. (1993). Some explicit formulas for the matrix exponential. IEEE Trans. Automat. Control , 38(8):1228–1232.
- 3Beskos et al. (2006) Beskos, A., Papaspiliopoulos, O., Roberts, G. O., and Fearnhead, P. (2006). Exact and computationally efficient likelihood-based estimation for discretely observed diffusion processes. J. R. Stat. Soc. Ser. B Stat. Methodol. , 68(3):333–382.
- 4Beskos et al. (2006 a) Beskos, A., Papaspiliopoulos, O., Roberts G. O. (2006 a). Retrospective exact simulation of diffusion sample paths with applications. Bernoulli , 12(6):1077–1098.
- 5Bibby and Sørensen (2001) Bibby, B. M. and Sørensen, M. (2001). Simplified estimating functions for diffusion models with a high-dimensional parameter. Scand. J. Statist. , 28(1):99–112.
- 6Bladt et al. (2006) Bladt, M., Finch, S., and Sørensen, M. (2016). Simulation of multivariate diffusion bridges. J. R. Stat. Soc. Ser. B Stat. Methodol. , 78(2):343–369.
- 7Bottaro et al. (2013) Bottaro, S., Lindorff-Larsen, K., and Best, R. B. (2013). Variational optimization of an all-atom implicit solvent force field to match explicit solvent simulation data. J. Chem. Theory Comput. , 9(12):5641–5652.
- 8Breckling (1989) Breckling, J. (1989). The analysis of directional time series: applications to wind speed and direction , volume 61 of Lecture Notes in Statistics . Springer-Verlag, Berlin.
