Irene Tubikanec
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Irene Tubikanec has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Massimiliano Tamborrino
Department of Statistics, University of Warwick, Warwick, UK
5 shared publications - Evelyn Buckwar
Institute of Stochastics Johannes Kepler University Linz
4 shared publications - Anna Melnykova
AGM UMR-CNRS 8088 UMR-CNRS 5224 Université de Cergy-Pontoise Université Grenoble Alpes LJK
3 shared publications - Julien Chevallier
Univ. Grenoble Alpes, CNRS, Inria, Grenoble INP (Institute of Engineering Univ. Grenoble Alpes), LJK
3 shared publications Adeline Samson
2 shared publications- Anna Melnykova
Mathématiques d'Avignon (EA 2151) Avignon Université Laboratoire de
2 shared publications
Latest Publications
- Open Access
Splitting methods for stochastic Hodgkin-Huxley type systems and a localized fundamental mean-square convergence theorem
Existing fundamental theorems for mean-square convergence of numerical methods for stochastic differential equations (SDEs) require globally or one-sided Lipschitz continuous coefficients, while strong convergence results under merely local Lipschitz conditions are largely restricted to Euler-Maruyama type methods. To address these limitations, we introduce a novel localized version of the fundamental mean-square convergence theorem for SDEs with locally Lipschitz coefficients, which naturally arise in a wide range of applications. Specifically, we show that if a numerical scheme is locally consistent in the mean-square sense of order $q>1$, then it is locally mean-square convergent with rate $q-1$. Building on this result, we further prove that global mean-square convergence follows, provided that both the exact solution and its numerical approximation admit bounded $2p$th moments for some $p>1$. These new convergence results are illustrated on a class of locally Lipschitz SDEs of Hodgkin-Huxley type, characterized by a conditionally linear drift structure. For these systems, we construct different Lie-Trotter and Strang splitting methods exploiting their conditional linearity. The proposed convergence framework is then applied to these schemes, requiring innovative proofs of local consistency and boundedness of moments. In addition, we establish key structure-preserving properties of the splitting methods, in particular state-space preservation and geometric ergodicity. Numerical experiments support the theoretical results and demonstrate that the proposed splitting schemes significantly outperform Euler-Maruyama type methods in preserving the qualitative features of the model.Open AccessSplitting methods for stochastic Hodgkin-Huxley type systems and a localized fundamental mean-square convergence theorem
Existing fundamental theorems for mean-square convergence of numerical methods for stochastic differential equations (SDEs) require globally or one-sided Lipschitz continuous coefficients, while strong convergence results under merely local Lipschitz conditions are largely restricted to Euler-Maruyama type methods. To address these limitations, we introduce a novel localized version of the fundamental mean-square convergence theorem for SDEs with locally Lipschitz coefficients, which naturally arise in a wide range of applications. Specifically, we show that if a numerical scheme is locally consistent in the mean-square sense of order $q>1$, then it is locally mean-square convergent with rate $q-1$. Building on this result, we further prove that global mean-square convergence follows, provided that both the exact solution and its numerical approximation admit bounded $2p$th moments for some $p>1$. These new convergence results are illustrated on a class of locally Lipschitz SDEs of Hodgkin-Huxley type, characterized by a conditionally linear drift structure. For these systems, we construct different Lie-Trotter and Strang splitting methods exploiting their conditional linearity. The proposed convergence framework is then applied to these schemes, requiring innovative proofs of local consistency and boundedness of moments. In addition, we establish key structure-preserving properties of the splitting methods, in particular state-space preservation and geometric ergodicity. Numerical experiments support the theoretical results and demonstrate that the proposed splitting schemes significantly outperform Euler-Maruyama type methods in preserving the qualitative features of the model. - Open Access
Splitting methods for stochastic Hodgkin-Huxley type systems and a localized fundamental mean-square convergence theorem
Existing fundamental theorems for mean-square convergence of numerical methods for stochastic differential equations (SDEs) require globally or one-sided Lipschitz continuous coefficients, while strong convergence results under merely local Lipschitz conditions are largely restricted to Euler-Maruyama type methods. To address these limitations, we introduce a novel localized version of the fundamental mean-square convergence theorem for SDEs with locally Lipschitz coefficients, which naturally arise in a wide range of applications. Specifically, we show that if a numerical scheme is locally consistent in the mean-square sense of order q > 1, then it is locally mean-square convergent with rate q-1. Building on this result, we further prove that global mean-square convergence follows, provided that both the exact solution and its numerical approximation admit bounded $p$th moments for some p > 1. This new convergence result is illustrated on a class of locally Lipschitz SDEs of Hodgkin-Huxley type, characterized by a conditionally linear drift structure. For these systems, we construct different Lie-Trotter and Strang splitting methods exploiting their conditional linearity. The proposed convergence framework is then applied to these schemes, requiring innovative proofs of local consistency and boundedness of moments. In addition, we establish key structure-preserving properties of the splitting methods, in particular state-space preservation and geometric ergodicity. Numerical experiments support the theoretical results and demonstrate that the proposed splitting schemes significantly outperform Euler-Maruyama type methods in preserving the qualitative features of the model.
Open AccessSplitting methods for stochastic Hodgkin-Huxley type systems and a localized fundamental mean-square convergence theorem
Existing fundamental theorems for mean-square convergence of numerical methods for stochastic differential equations (SDEs) require globally or one-sided Lipschitz continuous coefficients, while strong convergence results under merely local Lipschitz conditions are largely restricted to Euler-Maruyama type methods. To address these limitations, we introduce a novel localized version of the fundamental mean-square convergence theorem for SDEs with locally Lipschitz coefficients, which naturally arise in a wide range of applications. Specifically, we show that if a numerical scheme is locally consistent in the mean-square sense of order q > 1, then it is locally mean-square convergent with rate q-1. Building on this result, we further prove that global mean-square convergence follows, provided that both the exact solution and its numerical approximation admit bounded $p$th moments for some p > 1. This new convergence result is illustrated on a class of locally Lipschitz SDEs of Hodgkin-Huxley type, characterized by a conditionally linear drift structure. For these systems, we construct different Lie-Trotter and Strang splitting methods exploiting their conditional linearity. The proposed convergence framework is then applied to these schemes, requiring innovative proofs of local consistency and boundedness of moments. In addition, we establish key structure-preserving properties of the splitting methods, in particular state-space preservation and geometric ergodicity. Numerical experiments support the theoretical results and demonstrate that the proposed splitting schemes significantly outperform Euler-Maruyama type methods in preserving the qualitative features of the model.
- 1 December 2025
- Published by Institute of Mathematical Statistics in The Annals of Applied Statistics
- Vol. 19 (4) , 3304-3329
Network inference via approximate Bayesian computation. Illustration on a stochastic multipopulation neural mass model
In this article we propose an adapted sequential Monte Carlo approximate Bayesian computation (SMC-ABC) algorithm for network inference in coupled stochastic differential equations (SDEs) used for multivariate time series modeling. Our approach is motivated by neuroscience, specifically the challenge of estimating brain connectivity before and during epileptic seizures. To this end, we make four key contributions. First, we introduce a 6N-dimensional SDE to model the activity of N coupled neuronal populations, extending the (single-population) stochastic Jansen and Rit neural mass model used to describe human electroencephalography (EEG) rhythms, particularly epileptic activity. Second, we construct a reliable and efficient numerical splitting scheme for the model simulation. Third, we apply the proposed adapted SMC-ABC algorithm to the neural mass model and validate it on different types of simulated data. Compared to standard SMC-ABC, our approach significantly reduces computational cost by requiring fewer model simulations to reach the desired posterior region, thanks to the inclusion of binary parameters describing the presence or absence of coupling directions. Finally, we apply our method to real multichannel EEG data, uncovering potential similarities in patients’ brain activities across different epileptic seizures as well as differences between preseizure and seizure periods.
- 1 December 2025
- Published by Institute of Mathematical Statistics in The Annals of Applied Statistics
- Vol. 19 (4) , 3304-3329
Network inference via approximate Bayesian computation. Illustration on a stochastic multipopulation neural mass model
In this article we propose an adapted sequential Monte Carlo approximate Bayesian computation (SMC-ABC) algorithm for network inference in coupled stochastic differential equations (SDEs) used for multivariate time series modeling. Our approach is motivated by neuroscience, specifically the challenge of estimating brain connectivity before and during epileptic seizures. To this end, we make four key contributions. First, we introduce a 6N-dimensional SDE to model the activity of N coupled neuronal populations, extending the (single-population) stochastic Jansen and Rit neural mass model used to describe human electroencephalography (EEG) rhythms, particularly epileptic activity. Second, we construct a reliable and efficient numerical splitting scheme for the model simulation. Third, we apply the proposed adapted SMC-ABC algorithm to the neural mass model and validate it on different types of simulated data. Compared to standard SMC-ABC, our approach significantly reduces computational cost by requiring fewer model simulations to reach the desired posterior region, thanks to the inclusion of binary parameters describing the presence or absence of coupling directions. Finally, we apply our method to real multichannel EEG data, uncovering potential similarities in patients’ brain activities across different epileptic seizures as well as differences between preseizure and seizure periods.
- Open Access
Approximate Bayesian computation for stochastic hybrid systems with ergodic behaviour
Piecewise diffusion Markov processes (PDifMPs) form a versatile class of stochastic hybrid systems that combine continuous diffusion processes with discrete event-driven dynamics, enabling flexible modelling of complex real-world hybrid phenomena. The practical utility of PDifMP models, however, depends critically on accurate estimation of their underlying parameters. In this work, we present a novel framework for parameter inference in PDifMPs based on approximate Bayesian computation (ABC). Our contributions are threefold. First, we provide detailed simulation algorithms for PDifMP sample paths. Second, we extend existing ABC summary statistics for diffusion processes to account for the hybrid nature of PDifMPs, showing particular effectiveness for ergodic systems. Third, we demonstrate our approach on several representative example PDifMPs that empirically exhibit ergodic behaviour. Our results show that the proposed ABC method reliably recovers model parameters across all examples, even in challenging scenarios where only partial information on jumps and diffusion is available or when parameters appear in state-dependent jump rate functions. These findings highlight the potential of ABC as a practical tool for inference in various complex stochastic hybrid systems.
Open AccessApproximate Bayesian computation for stochastic hybrid systems with ergodic behaviour
Piecewise diffusion Markov processes (PDifMPs) form a versatile class of stochastic hybrid systems that combine continuous diffusion processes with discrete event-driven dynamics, enabling flexible modelling of complex real-world hybrid phenomena. The practical utility of PDifMP models, however, depends critically on accurate estimation of their underlying parameters. In this work, we present a novel framework for parameter inference in PDifMPs based on approximate Bayesian computation (ABC). Our contributions are threefold. First, we provide detailed simulation algorithms for PDifMP sample paths. Second, we extend existing ABC summary statistics for diffusion processes to account for the hybrid nature of PDifMPs, showing particular effectiveness for ergodic systems. Third, we demonstrate our approach on several representative example PDifMPs that empirically exhibit ergodic behaviour. Our results show that the proposed ABC method reliably recovers model parameters across all examples, even in challenging scenarios where only partial information on jumps and diffusion is available or when parameters appear in state-dependent jump rate functions. These findings highlight the potential of ABC as a practical tool for inference in various complex stochastic hybrid systems.
- Open Access
- 15 November 2024
- Published by Elsevier in Computational Statistics & Data Analysis
- Vol. 204
Inference for the stochastic FitzHugh-Nagumo model from real action potential data via approximate Bayesian computation
- 15 November 2024
- Published by Elsevier in Computational Statistics & Data Analysis
- Vol. 204
Open AccessInference for the stochastic FitzHugh-Nagumo model from real action potential data via approximate Bayesian computation
- Open Access
- 1 May 2022
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 406
Qualitative properties of different numerical methods for the inhomogeneous geometric Brownian motion
- 1 May 2022
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 406
Open AccessQualitative properties of different numerical methods for the inhomogeneous geometric Brownian motion
- Top Cited PapersOpen Access
- 28 April 2022
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 179, 191-220
A splitting method for SDEs with locally Lipschitz drift: Illustration on the FitzHugh-Nagumo model
- 28 April 2022
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 179, 191-220
Top Cited PapersOpen AccessA splitting method for SDEs with locally Lipschitz drift: Illustration on the FitzHugh-Nagumo model
- Open Access
A splitting method for SDEs with locally Lipschitz drift: Illustration on the FitzHugh-Nagumo model
In this article, we construct and analyse an explicit numerical splitting method for a class of semi-linear stochastic differential equations (SDEs) with additive noise, where the drift is allowed to grow polynomially and satisfies a global one-sided Lipschitz condition. The method is proved to be mean-square convergent of order 1 and to preserve important structural properties of the SDE. First, it is hypoelliptic in every iteration step. Second, it is geometrically ergodic and has an asymptotically bounded second moment. Third, it preserves oscillatory dynamics, such as amplitudes, frequencies and phases of oscillations, even for large time steps. Our results are illustrated on the stochastic FitzHugh-Nagumo model and compared with known mean-square convergent tamed/truncated variants of the Euler-Maruyama method. The capability of the proposed splitting method to preserve the aforementioned properties may make it applicable within different statistical inference procedures. In contrast, known Euler-Maruyama type methods commonly fail in preserving such properties, yielding ill-conditioned likelihood-based estimation tools or computationally infeasible simulation-based inference algorithms.
Open AccessA splitting method for SDEs with locally Lipschitz drift: Illustration on the FitzHugh-Nagumo model
In this article, we construct and analyse an explicit numerical splitting method for a class of semi-linear stochastic differential equations (SDEs) with additive noise, where the drift is allowed to grow polynomially and satisfies a global one-sided Lipschitz condition. The method is proved to be mean-square convergent of order 1 and to preserve important structural properties of the SDE. First, it is hypoelliptic in every iteration step. Second, it is geometrically ergodic and has an asymptotically bounded second moment. Third, it preserves oscillatory dynamics, such as amplitudes, frequencies and phases of oscillations, even for large time steps. Our results are illustrated on the stochastic FitzHugh-Nagumo model and compared with known mean-square convergent tamed/truncated variants of the Euler-Maruyama method. The capability of the proposed splitting method to preserve the aforementioned properties may make it applicable within different statistical inference procedures. In contrast, known Euler-Maruyama type methods commonly fail in preserving such properties, yielding ill-conditioned likelihood-based estimation tools or computationally infeasible simulation-based inference algorithms.
- 1 September 2021
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 53 (3) , 716-756
Diffusion approximation of multi-class Hawkes processes: Theoretical and numerical analysis
Oscillatory systems of interacting Hawkes processes with Erlang memory kernels were introduced by Ditlevsen and Löcherbach (Stoch. Process. Appl., 2017). They are piecewise deterministic Markov processes (PDMP) and can be approximated by a stochastic diffusion. In this paper, first, a strong error bound between the PDMP and the diffusion is proved. Second, moment bounds for the resulting diffusion are derived. Third, approximation schemes for the diffusion, based on the numerical splitting approach, are proposed. These schemes are proved to converge with mean-square order 1 and to preserve the properties of the diffusion, in particular the hypoellipticity, the ergodicity, and the moment bounds. Finally, the PDMP and the diffusion are compared through numerical experiments, where the PDMP is simulated with an adapted thinning procedure.
- 1 September 2021
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 53 (3) , 716-756
Diffusion approximation of multi-class Hawkes processes: Theoretical and numerical analysis
Oscillatory systems of interacting Hawkes processes with Erlang memory kernels were introduced by Ditlevsen and Löcherbach (Stoch. Process. Appl., 2017). They are piecewise deterministic Markov processes (PDMP) and can be approximated by a stochastic diffusion. In this paper, first, a strong error bound between the PDMP and the diffusion is proved. Second, moment bounds for the resulting diffusion are derived. Third, approximation schemes for the diffusion, based on the numerical splitting approach, are proposed. These schemes are proved to converge with mean-square order 1 and to preserve the properties of the diffusion, in particular the hypoellipticity, the ergodicity, and the moment bounds. Finally, the PDMP and the diffusion are compared through numerical experiments, where the PDMP is simulated with an adapted thinning procedure.
- Open Access
Qualitative properties of numerical methods for the inhomogeneous geometric Brownian motion
We provide a comparative analysis of qualitative features of different numerical methods for the inhomogeneous geometric Brownian motion (IGBM). The conditional and asymptotic mean and variance of the IGBM are known and the process can be characterised according to Feller's boundary classification. We compare the frequently used Euler-Maruyama and Milstein methods, two Lie-Trotter and two Strang splitting schemes and two methods based on the ordinary differential equation (ODE) approach, namely the classical Wong-Zakai approximation and the recently proposed log-ODE scheme. First, we prove that, in contrast to the Euler-Maruyama and Milstein schemes, the splitting and ODE schemes preserve the boundary properties of the process, independently of the choice of the time discretisation step. Second, we derive closed-form expressions for the conditional and asymptotic means and variances of all considered schemes and analyse the resulting biases. While the Euler-Maruyama and Milstein schemes are the only methods which may have an asymptotically unbiased mean, the splitting and ODE schemes perform better in terms of variance preservation. The Strang schemes outperform the Lie-Trotter splittings, and the log-ODE scheme the classical ODE method. The mean and variance biases of the log-ODE scheme are very small for many relevant parameter settings. However, in some situations the two derived Strang splittings may be a better alternative, one of them requiring considerably less computational effort than the log-ODE method. The proposed analysis may be carried out in a similar fashion on other numerical methods and stochastic differential equations with comparable features.
Open AccessQualitative properties of numerical methods for the inhomogeneous geometric Brownian motion
We provide a comparative analysis of qualitative features of different numerical methods for the inhomogeneous geometric Brownian motion (IGBM). The conditional and asymptotic mean and variance of the IGBM are known and the process can be characterised according to Feller's boundary classification. We compare the frequently used Euler-Maruyama and Milstein methods, two Lie-Trotter and two Strang splitting schemes and two methods based on the ordinary differential equation (ODE) approach, namely the classical Wong-Zakai approximation and the recently proposed log-ODE scheme. First, we prove that, in contrast to the Euler-Maruyama and Milstein schemes, the splitting and ODE schemes preserve the boundary properties of the process, independently of the choice of the time discretisation step. Second, we derive closed-form expressions for the conditional and asymptotic means and variances of all considered schemes and analyse the resulting biases. While the Euler-Maruyama and Milstein schemes are the only methods which may have an asymptotically unbiased mean, the splitting and ODE schemes perform better in terms of variance preservation. The Strang schemes outperform the Lie-Trotter splittings, and the log-ODE scheme the classical ODE method. The mean and variance biases of the log-ODE scheme are very small for many relevant parameter settings. However, in some situations the two derived Strang splittings may be a better alternative, one of them requiring considerably less computational effort than the log-ODE method. The proposed analysis may be carried out in a similar fashion on other numerical methods and stochastic differential equations with comparable features.