Clelia de Mulatier

Clelia de Mulatier


Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 September 2018 in Entropy
Verified
Journal Article
Open access
PDF file
ABAlberto Beretta
Alberto Beretta
CBClaudia Battistin
Claudia Battistin
CMClelia de Mulatier
Clelia de Mulatier
IMIacopo Mastromatteo
Iacopo Mastromatteo
MMMatteo Marsili
Matteo Marsili
Models can be simple for different reasons: because they yield a simple and computationally efficient interpretation of a generic dataset (e.g., in terms of pairwise dependencies)—as in statistical learning—or because they capture the laws of a specific phenomenon—as e.g., in physics—leading to non-trivial falsifiable predictions. In information theory, the simplicity of a model is quantified by the stochastic complexity, which measures the number of bits needed to encode its parameters. In order to understand how simple models look like, we study the stochastic complexity of spin models with interactions of arbitrary order. We show that bijections within the space of possible interactions preserve the stochastic complexity, which allows to partition the space of all models into equivalence classes. We thus found that the simplicity of a model is not determined by the order of the interactions, but rather by their mutual arrangements. Models where statistical dependencies are localized on non-overlapping groups of few variables are simple, affording predictions on independencies that are easy to falsify. On the contrary, fully connected pairwise models, which are often used in statistical learning, appear to be highly complex, because of their extended set of interactions, and they are hard to falsify.

15 May 2025 in Physical Review E
Verified
Journal Article
Closed access
CMClelia de Mulatier
Clelia de Mulatier
MMMatteo Marsili
Matteo Marsili
Finding the model that best describes a high-dimensional dataset is a daunting task, even more so if one aims to consider all possible high-order patterns of the data (i.e., correlation patterns between three or more variables), going beyond pairwise models. For binary data, we show that this task becomes feasible when restricting the search to a family of simple models, which we call minimally complex models (MCMs). MCMs are maximum entropy models that have interactions of arbitrarily high order grouped into independent components of minimal complexity. They are simple in information-theoretic terms, which means they can only fit well certain types of data patterns and are therefore easy to falsify. We show that Bayesian model selection restricted to these models is computationally feasible and has many advantages. First, the model evidence, which balances goodness of fit against complexity, can be computed efficiently without any parameter fitting, enabling very fast explorations of the space of MCMs. Second, the family of MCMs is invariant under gauge transformations, which can be used to develop a representation-independent approach to statistical modeling. For small systems (up to 15 variables), combining these two results allows us to select the best MCM among all, even though the number of models is already extremely large (10^{68} models for 15 variables). For larger systems, we propose simple heuristics to find optimal MCMs in reasonable times. Also, inference and sampling can be performed without any computational effort. Finally, because MCMs have interactions of any order, they can reveal the presence of important high-order dependencies in the data, providing an alternative approach to explore high-order dependencies in complex systems. We apply our method to synthetic data and real-world examples, illustrating how MCMs portray the structure of dependencies among variables in a simple manner, extracting falsifiable predictions on symmetries and invariance from the data.

14 April 2025 in Journal of Physics: Complexity
Verified
Journal Article
Open access
WMWout Merbis
Wout Merbis
MGMadelon Geurts
Madelon Geurts
CMClelia de Mulatier
Clelia de Mulatier
PCPhilippe Corboz
Philippe Corboz
The exact treatment of Markovian models of complex systems requires knowledge of probability distributions exponentially large in the number of components n. Mean-field approximations provide an effective reduction in complexity of the models, requiring only a number of phase space variables polynomial in system size. However, this comes at the cost of losing accuracy close to critical points in the systems dynamics and an inability to capture correlations in the system. In this work, we introduce a tunable approximation scheme for Markovian spreading models on networks based on matrix product states (MPSs). By controlling the bond dimensions of the MPS, we can investigate the effective dimensionality needed to accurately represent the exact 2 n dimensional steady-state distribution. We introduce the entanglement entropy as a measure of the compressibility of the system and find that it peaks just after the phase transition on the disordered side, in line with the intuition that more complex states are at the ‘edge of chaos’. We compare the accuracy of the MPS with exact methods on different types of small random networks and with Markov chain Monte Carlo methods for a simplified version of the railway network of the Netherlands with 55 nodes. The MPS provides a systematic way to tune the accuracy of the approximation by reducing the dimensionality of the systems state vector, leading to an improvement over second-order mean-field approximations for sufficiently large bond dimensions.

1 April 2026
Verified
Thesis
Closed access
CMClelia de Mulatier
Clelia de Mulatier
Contributions de la théorie des marches aléatoires au transport stochastique des neutrons: L’un des principaux objectifs de la physique des réacteurs nucléaires est de caractériser la répartition aléatoire de la population de neutrons au sein d’un réacteur. Les fluctuations de cette population sont liées à la nature stochastique des interactions des neutrons avec les noyaux fissiles du milieu : diffusion, capture stérile, ou encore émission de plusieurs neutrons lors de la fission d’un noyau. L’ensemble de ces mécanismes physiques confère une structure aléatoire branchante à la trajectoire des neutrons, alors modélisée par des marches aléatoires. Avec environs 10⁸ neutrons par centimètre cube dans un réacteur de type REP à pleine puissance en conditions stationnaires, les grandeurs physiques du système (flux, taux de réaction, énergie déposée) sont, en première approximation, bien représentées par leurs valeurs moyennes respectives. Ces observables physiques moyennes obéissent alors à l’équation de transport linéaire de Boltzmann. Au cours de ma thèse, je me suis penchée sur deux aspects du transport qui ne sont pas décrits par cette équation, et pour lesquels je me suis appuyée sur des outils issus de la théorie des marches aléatoires. Tout d’abord, grâce au formalisme de Feynman-Kac, j’ai étudié les fluctuations statistiques de la population de neutrons, et plus particulièrement le phénomène de « clustering neutronique », qui a été mis en évidence numériquement pour de faibles densités de neutrons (typiquement un réacteur au démarrage). Je me suis ensuite intéressée à différentes propriétés de la statistique d’occupation des neutrons effectuant un transport anormal (càd non-exponentiel). Ce type de transport permet de modéliser le transport dans des matériaux fortement hétérogènes et désordonnés, tel que les réacteurs à lit de boulets. L’un des aspects novateurs de ce travail est la prise en compte de la présence de bords. En effet, bien que les systèmes réels soient de taille finie, la plupart des résultats théoriques pré-existants sur ces thématiques ont été obtenus sur des systèmes de taille infinie.