Dimitri Breda
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Dimitri Breda has a total of 65 co-authors. Here are the top co-authors by number of shared publications:
- Rossana Vermiglio
CDLab - Computational Dynamics Laboratory, Department of Mathematics, Computer Science and Physics, University of Udine, Italy
39 shared publications - Stefano Maset
University of Trieste
15 shared publications - Davide Liessi
Department of Mathematics Computer Science and Physics CDLab -Computational Dynamics Laboratory University of Udine Via delle Scienze 206 33100 Udine Italy
13 shared publications - Alessia Andò
University of Udine
8 shared publications - Stefano Maset
Università degli Studi di Trieste
6 shared publications - Francesca Scarabel
School of Mathematics, University of Leeds, Leeds, LS2 9JT, United Kingdom
5 shared publications
Latest Publications
- 9 September 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 48 (5) , A2728-A2752
On the Numerical Computation of \({R_0}\) in Periodic EnvironmentsWe propose a novel approach to approximate the basic reproduction number [Formula: see text] as the spectral radius of the Next-Generation Operator in time-periodic population models by characterizing the latter via evolution semigroups. Once birth/infection and transition operators are identified, we discretize them via either Fourier or Chebyshev collocation methods. Then [Formula: see text] is obtained by solving a generalized matrix eigenvalue problem. The order of convergence of the approximating reproduction numbers to the true one is shown to depend on the regularity of the model coefficients, and spectral accuracy is proved. We validate the theoretical results by discussing applications to epidemiology, viz. a large-size multigroup epidemic model with periodic contact rates, and a vector-borne disease model with seasonal vector recruitment. We illustrate how the method facilitates implementation compared to existing approaches and how it can be easily adapted to also compute type-reproduction numbers. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://gitlab.com/SIMONE.DEREGGI/R0_periodicODEs and in the supplementary materials ( R0_periodicODEs-main.zip [14.9KB]). [Formula: see text]
- 9 September 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 48 (5) , A2728-A2752
On the Numerical Computation of \({R_0}\) in Periodic EnvironmentsWe propose a novel approach to approximate the basic reproduction number [Formula: see text] as the spectral radius of the Next-Generation Operator in time-periodic population models by characterizing the latter via evolution semigroups. Once birth/infection and transition operators are identified, we discretize them via either Fourier or Chebyshev collocation methods. Then [Formula: see text] is obtained by solving a generalized matrix eigenvalue problem. The order of convergence of the approximating reproduction numbers to the true one is shown to depend on the regularity of the model coefficients, and spectral accuracy is proved. We validate the theoretical results by discussing applications to epidemiology, viz. a large-size multigroup epidemic model with periodic contact rates, and a vector-borne disease model with seasonal vector recruitment. We illustrate how the method facilitates implementation compared to existing approaches and how it can be easily adapted to also compute type-reproduction numbers. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://gitlab.com/SIMONE.DEREGGI/R0_periodicODEs and in the supplementary materials ( R0_periodicODEs-main.zip [14.9KB]). [Formula: see text]
- Open Access
- 10 July 2026
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 531
Sparse identification of delay equations with distributed memory
- 10 July 2026
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 531
Open AccessSparse identification of delay equations with distributed memory
- Open Access
- 25 June 2026
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 123 (26)
Exploring memory effects: Sparse identification in vector-borne diseases
Predicting the human burden of vector-borne diseases from limited surveillance data remains a major challenge, particularly in the presence of nonlinear transmission dynamics and delayed effects arising from vector ecology and human behavior. We develop a data-driven framework based on an extension of Sparse Identification of Nonlinear Dynamics to systems with distributed memory, enabling discovery of transmission mechanisms directly from time series data. Using severe fever with thrombocytopenia syndrome as a case study, we show that this approach can uncover key features of tick-borne disease dynamics using only human incidence and local temperature data, without imposing predefined assumptions on human case reporting. We further ascertain the robustness of the recovered incidence-temperature model by integrating it with mechanistically derived tick–host covariates, showing that the forecasting ability does not improve. This suggests that the proposed core data-driven model already delivers strong predictions. The framework also allows for systematic sensitivity analysis of memory kernels and behavioral parameters. Although the approach prioritizes predictive accuracy over mechanistic transparency, it yields sparse, interpretable integral representations suitable for epidemiological forecasting. This methodology provides a scalable strategy for forecasting vector-borne disease risk and informing public health decision-making under data limitations.
- 25 June 2026
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 123 (26)
Open AccessExploring memory effects: Sparse identification in vector-borne diseases
Predicting the human burden of vector-borne diseases from limited surveillance data remains a major challenge, particularly in the presence of nonlinear transmission dynamics and delayed effects arising from vector ecology and human behavior. We develop a data-driven framework based on an extension of Sparse Identification of Nonlinear Dynamics to systems with distributed memory, enabling discovery of transmission mechanisms directly from time series data. Using severe fever with thrombocytopenia syndrome as a case study, we show that this approach can uncover key features of tick-borne disease dynamics using only human incidence and local temperature data, without imposing predefined assumptions on human case reporting. We further ascertain the robustness of the recovered incidence-temperature model by integrating it with mechanistically derived tick–host covariates, showing that the forecasting ability does not improve. This suggests that the proposed core data-driven model already delivers strong predictions. The framework also allows for systematic sensitivity analysis of memory kernels and behavioral parameters. Although the approach prioritizes predictive accuracy over mechanistic transparency, it yields sparse, interpretable integral representations suitable for epidemiological forecasting. This methodology provides a scalable strategy for forecasting vector-borne disease risk and informing public health decision-making under data limitations.
- Open Access
Approximating evolution operators of linear delay equations: a general framework for the convergence analysis
We consider the problem of discretizing evolution operators of linear delay equations with the aim of approximating their spectra, which is useful in investigating the stability properties of (nonlinear) equations via the principle of linearized stability. We develop a general convergence analysis based on a reformulation of the operators by means of a fixed-point equation, providing a list of hypotheses related to the regularization properties of the equation and the convergence of the chosen approximation techniques on suitable subspaces. This framework unifies the proofs for some methods based on pseudospectral discretization, which we present here in this new form. To exemplify the generality of the framework, we also apply it to a method of weighted residuals found in the literature, which was previously lacking a formal convergence analysis.
Open AccessApproximating evolution operators of linear delay equations: a general framework for the convergence analysis
We consider the problem of discretizing evolution operators of linear delay equations with the aim of approximating their spectra, which is useful in investigating the stability properties of (nonlinear) equations via the principle of linearized stability. We develop a general convergence analysis based on a reformulation of the operators by means of a fixed-point equation, providing a list of hypotheses related to the regularization properties of the equation and the convergence of the chosen approximation techniques on suitable subspaces. This framework unifies the proofs for some methods based on pseudospectral discretization, which we present here in this new form. To exemplify the generality of the framework, we also apply it to a method of weighted residuals found in the literature, which was previously lacking a formal convergence analysis.
- Open Access
Sparse identification of delay equations with distributed memory
We present a novel extension of the SINDy framework to delay differential equations with {\it distributed delays} and {\it renewal equations}, where typically the dependence from the past manifests via integrals in which the history is weighted through specific functions that are in general nonautonomous. Using sparse regression following the application of suitable quadrature formulas, the proposed methodology aims at directly reconstructing these kernel functions, thereby capturing the dynamics of the underlying infinite-dimensional systems. Numerical experiments confirm the effectiveness of the presented approach in identifying accurate and interpretable models, thus advancing data-driven discovery towards systems with distributed memory.
Open AccessSparse identification of delay equations with distributed memory
We present a novel extension of the SINDy framework to delay differential equations with {\it distributed delays} and {\it renewal equations}, where typically the dependence from the past manifests via integrals in which the history is weighted through specific functions that are in general nonautonomous. Using sparse regression following the application of suitable quadrature formulas, the proposed methodology aims at directly reconstructing these kernel functions, thereby capturing the dynamics of the underlying infinite-dimensional systems. Numerical experiments confirm the effectiveness of the presented approach in identifying accurate and interpretable models, thus advancing data-driven discovery towards systems with distributed memory.
- Open Access
- 11 December 2025
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 479
Sparse identification of nonlinear dynamics for stochastic delay differential equations
- 11 December 2025
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 479
Open AccessSparse identification of nonlinear dynamics for stochastic delay differential equations
- Open AccessOn the numerical computation of $R_0$ in periodic environmentsWe propose a novel approach to approximate the basic reproduction number $R_0$ as spectral radius of the Next-Generation Operator in time-periodic population models by characterizing the latter via evolution semigroups. Once birth/infection and transition operators are identified, we discretize them via either Fourier or Chebyshev collocation methods. Then $R_0$ is obtained by solving a generalized matrix eigenvalue problem. The order of convergence of the approximating reproduction numbers to the true one is shown to depend on the regularity of the model coefficients, and spectral accuracy is proved. We validate the theoretical results by discussing applications to epidemiology, viz. a large-size multi-group epidemic model with periodic contact rates, and a vector-borne disease model with seasonal vector recruitment. We illustrate how the method facilitates implementation compared to existing approaches and how it can be easily adapted to also compute type-reproduction numbers.Open AccessOn the numerical computation of $R_0$ in periodic environmentsWe propose a novel approach to approximate the basic reproduction number $R_0$ as spectral radius of the Next-Generation Operator in time-periodic population models by characterizing the latter via evolution semigroups. Once birth/infection and transition operators are identified, we discretize them via either Fourier or Chebyshev collocation methods. Then $R_0$ is obtained by solving a generalized matrix eigenvalue problem. The order of convergence of the approximating reproduction numbers to the true one is shown to depend on the regularity of the model coefficients, and spectral accuracy is proved. We validate the theoretical results by discussing applications to epidemiology, viz. a large-size multi-group epidemic model with periodic contact rates, and a vector-borne disease model with seasonal vector recruitment. We illustrate how the method facilitates implementation compared to existing approaches and how it can be easily adapted to also compute type-reproduction numbers.
- Open Access
Sparse Identification of Nonlinear Dynamics for Stochastic Delay Differential Equations
A general framework for recovering drift and diffusion dynamics from sampled trajectories is presented for the first time for stochastic delay differential equations. The core relies on the well-established SINDy algorithm for the sparse identification of nonlinear dynamics. The proposed methodology combines recently proposed high-order estimates of drift and covariance for dealing with stochastic problems with augmented libraries to handle delayed arguments. Three different strategies are discussed in view of exploiting only realistically available data. A thorough comparative numerical investigation is performed on different models, which helps guiding the choice of effective and possibly outperforming schemes.
Open AccessSparse Identification of Nonlinear Dynamics for Stochastic Delay Differential Equations
A general framework for recovering drift and diffusion dynamics from sampled trajectories is presented for the first time for stochastic delay differential equations. The core relies on the well-established SINDy algorithm for the sparse identification of nonlinear dynamics. The proposed methodology combines recently proposed high-order estimates of drift and covariance for dealing with stochastic problems with augmented libraries to handle delayed arguments. Three different strategies are discussed in view of exploiting only realistically available data. A thorough comparative numerical investigation is performed on different models, which helps guiding the choice of effective and possibly outperforming schemes.
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems-Series B
- Vol. 30 (6)
Preface
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems-Series B
- Vol. 30 (6)
Preface
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems-Series B
- Vol. 30 (6) , 1930-1951
Lyapunov exponents of renewal equations: Numerical approximation and convergence analysis
We propose a numerical method for computing the Lyapunov exponents of renewal equations (delay equations of Volterra type), consisting first of applying a discrete QR technique to the associated evolution family suitably posed on a Hilbert state space, and second in reducing to a finite dimension each evolution operator in the obtained time sequence. The reduction to finite dimension relies on a Fourier projection in the state space and on pseudospectral collocation in the forward time step. A rigorous proof of convergence of both the discretized operators and the approximated exponents is provided. A MATLAB implementation is also included for completeness.
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems-Series B
- Vol. 30 (6) , 1930-1951
Lyapunov exponents of renewal equations: Numerical approximation and convergence analysis
We propose a numerical method for computing the Lyapunov exponents of renewal equations (delay equations of Volterra type), consisting first of applying a discrete QR technique to the associated evolution family suitably posed on a Hilbert state space, and second in reducing to a finite dimension each evolution operator in the obtained time sequence. The reduction to finite dimension relies on a Fourier projection in the state space and on pseudospectral collocation in the forward time step. A rigorous proof of convergence of both the discretized operators and the approximated exponents is provided. A MATLAB implementation is also included for completeness.