MCMarianne Clausel

Marianne Clausel

*This is an algorithmically generated author record based on publicly available information.

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


Marianne Clausel has a total of 28 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Time Series Correlations and Kolmogorov Complexity: A Hausdorff Dimension Perspective

    by Boumediene Hamzi, Marianne Clausel, Kamal Dingle, Marcus Hutter, Mohammed Terry Jack

    Spurious correlations between time series are a persistent problem: simple, low-complexity patterns are abundant, so unrelated series can easily exhibit high Pearson correlation. We argue that Kolmogorov complexity—a series’ resistance to compression—provides a principled diagnostic for flagging such cases. We prove an algorithmic trilemma: a pair of binary sequences cannot simultaneously be algorithmically independent, highly correlated, and highly complex. This gives a deterministic complexity ceiling for independent correlated pairs and a probabilistic bound under which spurious correlations among independent high-complexity pairs are exponentially rare; we further bridge these results to an effective Hausdorff dimension obstruction. These guarantees hold for binary sequences under Hamming correlation; their extension to real-valued series via serialisation and LZ compression is empirically validated rather than proved, so the joint indicator JLZ=min{C˜LZ(x),C˜LZ(y)} is a calibrated diagnostic, not a causal test. On two toy models—coupled logistic maps and multivariate fractional Brownian motion (dimH=2−H)—false positives are far more common among low-complexity series. Because noise inflates complexity and non-stationary processes can be both complex and spuriously correlated, we recommend a two-stage workflow: establish stationarity, then report JLZ alongside ρ.


  • Quelques notions d'irrégularité uniforme et ponctuelle : le point de vue ondelettes

    by Marianne Clausel

    Le but de cette thèse est de définir puis d'étudier différentes notions d'irrégularité uniforme ou ponctuelle permettant de traduire le fait qu'une fonction peut avoir des 'grands accroissements' à toutes les échelles. Pour cela on 'inverse' les notions de régularité Höldérienne usuelles. L'objectif principal du travail est ensuite de relier ces différentes notions à la théorie des ondelettes. Les critères ondelettes établis vont ainsi permettre de définir des fonctions ou des champs aléatoires dont le comportement est différent suivant la gamme d'échelles considérée. Par ailleurs, si on se place du point de vue ponctuel, une question naturelle est celle de la définition d'une analyse multifractale -dite faible- liée à la notion d'irrégularité ponctuelle. Les ondelettes vont alors permettre de définir des séries d'ondelettes multifractales pour l'irrégularité ponctuelle. Enfin, nous étudions des exemples de champs aléatoires où des propriétés de régularité directionelle apparaissent. Nous nous sommes ainsi centré sur l'étude d'un modèle de champ aléatoire gaussien particulier vérifiant une relation d'autosimilarité matricielle. Nous avons ensuite généralisé ce modèle et introduit des champs gaussiens autosimilaires par rapport à un groupe

    • 12 December 2023
    • Published by HAL in HAL
    Open Access

    An Innovative Framework for Static and Dynamic Clustering using Histogram Models and Wasserstein Distance over Sliding Windows

    by Xiaotong Qian, Guénaël Cabanes, Parisa Rastin, Mohamed Guidani, Ghassen Marrakchi, Marianne Clausel, Nistor Grozavu

    • A fast and versatile framework for static and dynamic clustering over sliding windows. • Uses histogram models to represent clusters with arbitrary distributions. • High degree of flexibility in selecting the clustering algorithm to apply. • Efficient and high quality results are achieved by using Wasserstein distance-based two-sample statistical tests to compare distributions.

  • Open Access

    On factorization of rank-one auto-correlation matrix polynomials

    by Konstantin Usevich, Julien Flamant, Marianne Clausel, David Brie

    This article characterizes the rank-one factorization of auto-correlation matrix polynomials. We establish a sufficient and necessary uniqueness condition for uniqueness of the factorization based on the greatest common divisor (GCD) of multiple polynomials. In the unique case, we show that the factorization can be carried out explicitly using GCDs. In the non-unique case, the number of non-trivially different factorizations is given and all solutions are enumerated.

    • 28 August 2023
    • Published by HAL in HAL
    Open Access

    On factorization of rank-one auto-correlation matrix polynomials

    by Konstantin Usevich, Julien Flamant, Marianne Clausel, David Brie

    This article characterizes the rank-one factorization of auto-correlation matrix polynomials. We establish a sufficient and necessary uniqueness condition for uniqueness of the factorization based on the greatest common divisor (GCD) of multiple polynomials. In the unique case, we show that the factorization can be carried out explicitly using GCDs. In the non-unique case, the number of non-trivially different factorizations is given and all solutions are enumerated.

  • Wind power predictions from nowcasts to 4-hour forecasts: A learning approach with variable selection

    by Dimitri Bouche, Rémi Flamary, Florence D’aLché-Buc, Riwal Plougonven, Marianne Clausel, Jordi Badosa, Philippe Drobinski


    • 26 June 2022
    • Published by HAL in HAL
    Open Access

    Polarimetric Fourier phase retrieval

    by Julien Flamant, Konstantin Usevich, Marianne Clausel, David Brie

    This work introduces polarimetric Fourier phase retrieval (PPR), a physically-inspired model to leverage polarization of light information in Fourier phase retrieval problems. We provide a complete characterization of its uniqueness properties by unraveling equivalencies with two related problems, namely bivariate phase retrieval and a polynomial autocorrelation factorization problem. In particular, we show that the problem admits a unique solution, which can be formulated as a greatest common divisor (GCD) of measurements polynomials. As a result, we propose algebraic solutions for PPR based on approximate GCD computations using the null-space properties Sylvester matrices. Alternatively, existing iterative algorithms for phase retrieval, semidefinite positive relaxation and Wirtinger-Flow, are carefully adapted to solve the PPR problem. Finally, a set of numerical experiments permits a detailed assessment of the numerical behavior and relative performances of each proposed reconstruction strategy. They further demonstrate the fruitful combination of algebraic and iterative approaches towards a scalable, computationally efficient and robust to noise reconstruction strategy for PPR.

  • Morpho-Statistical Description of Networks Through Graph Modelling and Bayesian Inference

    by Quentin Laporte-Chabasse, Radu S. Stoica, Marianne Clausel, Francois Charoy, Gerald Oster

    Collaboration graphs are relevant sources of information to understand behavioural tendencies of groups of individuals. The study of these graphs enables figuring out factors that may affect the efficiency and the sustainability of cooperative work. For example, such a collaboration involves researchers who develop relationships with their external counterparts to address scientific challenges. As relations and projects change over time, the evolution of social structures must be tackled. We propose a statistical approach considering different structural collaboration patterns and captures the dynamic of the relational structures over the years. Our approach combines spatial processes modelling and Exponential Random Graph Models used to analyse social processes. Since the normalising constant involved in classical Markov Chain Monte Carlo (MCMC) approaches is intractable in an analytic closed form, the inference remains challenging. To overcome this issue, we propose a Bayesian tool that relies on the recent ABC Shadow algorithm. The method is illustrated on real data sets from an open archive of scholarly documents. Through a simple formalism, our approach highlights the interactions between the different types of social relations at stake in the collaboration network.


  • Asymmetric M -estimation and change-point analysis applied to atomic force microscopy data enhancement

    by Dervillé Alexandre, Clausel Marianne, Coeurjolly Jean-François

    This paper presents a data-driven approach for the flattening of atomic force microscopy images. This acquisition process is widely used for the characterization of surfaces at the nanoscale. Unfortunately the technique is subject to several defects such as linear deviation and jumps. We present a data-driven methodology, fast to implement and which accurately corrects these deviations. The proposed methodology makes no assumption on the object locations and can therefore be used as an efficient preprocessing routine. Experimental results show the efficiency of the methodology compared to existing softwares.