Towards a digital twin for personalized diabetes prevention: the PRAESIIDIUM project

This contribution outlines current research aimed at developing models for personalized type 2 diabetes mellitus (T2D) prevention in the framework of the European project PRAESIIDIUM (Physics Informed Machine Learn-ing-Based Prediction and Reversion of Impaired Fasting Glucose Management) aimed at building a digital twin for preventing T2D in patients at risk.

Using frames in statistical signal recovering

Overcomplete representations such as wavelets and windowed Fourier expansions have become mainstays of modern statistical data analysis. Here we derive expressions for the mean quadratic risk of shrinkage estimators in the context of general finite frames, which include any fullrank linear expansion of vector data in a finite-dimensional setting. We provide several new results and practical estimation procedures that take into account the geometric correlation structure of frame elements.

Bootstrap percolation on the stochastic block model

We analyze the bootstrap percolation process on the stochastic block model (SBM), a natural extension of the Erd?s-Rényi random graph that incorporates the community structure observed in many real systems. In the SBM, nodes are partitioned into two subsets, which represent different communities, and pairs of nodes are independently connected with a probability that depends on the communities they belong to.

Quantitative Multidimensional Central Limit Theorems for Means of the Dirichlet-Ferguson Measure

The Dirichlet-Ferguson measure is a cornerstone in nonparametric Bayesian statistics and the study of distributional properties of expectations with respect to such measure is an important line of research. In this paper we provide explicit upper bounds for the d2, the d3 and the convex distance between vectors whose components are means of the Dirichlet-Ferguson measure and a Gaussian random vector.

The Malliavin Stein Method For Normal Random Walks with dependent increments

We derive bounds on the Kolmogorov distance between the dis- tribution of a random functional of a {0, 1}-valued random sequence and the normal distribution. Our approach, which relies on the general framework of stochastic analysis for discrete-time normal martingales, extends existing results obtained for independent Bernoulli (or Rademacher) sequences. In particular, we obtain Kolmogorov distance bounds for the sum of normalized random sequences without any independence assumption.

Tuning Minimum-Norm regularization parameters for optimal MEG connectivity estimation

The accurate characterization of cortical functional connectivity from Magnetoencephalography (MEG) data remains a challenging problem due to the subjective nature of the analysis, which requires several decisions at each step of the analysis pipeline, such as the choice of a source estimation algorithm, a connectivity metric and a cortical parcellation, to name but a few. Recent studies have emphasized the importance of selecting the regularization parameter in minimum norm estimates with caution, as variations in its value can result in significant differences in connectivity estimates.