Valérie Girardin
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
Valérie Girardin has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Philippe Regnault
Université de Reims Champagne-Ardenne
6 shared publications - Nathalie Niquil
Université de La Rochelle
3 shared publications Justine Lequesne
Laboratoire de Mathématiques N. Oresme, Université de Caen Normandie, Caen, France
2 shared publicationsLoick Lhote
Université de Caen Normandie
2 shared publicationsVictor Konev
International Laboratory of SSP & QF, Tomsk State University, Tomsk, Russian Federation
2 shared publicationsAnne Ricordeau
Université Paris Descartes
1 shared publication
Latest Publications
- 20 October 2025
- Published by Springer Nature
- p. 333-339
Minimum of Divergences with Relaxation: a Hilbertian Alternative to Duality Approach
- 20 October 2025
- Published by Springer Nature
- p. 333-339
Minimum of Divergences with Relaxation: a Hilbertian Alternative to Duality Approach
- Open Access
- 20 February 2024
- Published by MDPI AG in Physical Sciences Forum
- Vol. 9 (1) , 24
Analysis of Ecological Networks: Linear Inverse Modeling and Information Theory Tools
In marine ecology, the most studied interactions are trophic and are in networks called food webs. Trophic modeling is mainly based on weighted networks, where each weighted edge corresponds to a flow of organic matter between two trophic compartments, containing individuals of similar feeding behaviors and metabolisms and with the same predators. To take into account the unknown flow values within food webs, a class of methods called Linear Inverse Modeling was developed. The total linear constraints, equations and inequations defines a multidimensional convex-bounded polyhedron, called a polytope, within which lie all realistic solutions to the problem. To describe this polytope, a possible method is to calculate a representative sample of solutions by using the Monte Carlo Markov Chain approach. In order to extract a unique solution from the simulated sample, several goal (cost) functions—also called Ecological Network Analysis indices—have been introduced in the literature as criteria of fitness to the ecosystems. These tools are all related to information theory. Here we introduce new functions that potentially provide a better fit of the estimated model to the ecosystem.
- 20 February 2024
- Published by MDPI AG in Physical Sciences Forum
- Vol. 9 (1) , 24
Open AccessAnalysis of Ecological Networks: Linear Inverse Modeling and Information Theory Tools
In marine ecology, the most studied interactions are trophic and are in networks called food webs. Trophic modeling is mainly based on weighted networks, where each weighted edge corresponds to a flow of organic matter between two trophic compartments, containing individuals of similar feeding behaviors and metabolisms and with the same predators. To take into account the unknown flow values within food webs, a class of methods called Linear Inverse Modeling was developed. The total linear constraints, equations and inequations defines a multidimensional convex-bounded polyhedron, called a polytope, within which lie all realistic solutions to the problem. To describe this polytope, a possible method is to calculate a representative sample of solutions by using the Monte Carlo Markov Chain approach. In order to extract a unique solution from the simulated sample, several goal (cost) functions—also called Ecological Network Analysis indices—have been introduced in the literature as criteria of fitness to the ecosystems. These tools are all related to information theory. Here we introduce new functions that potentially provide a better fit of the estimated model to the ecosystem.
- Open Access
Comparing and Updating R Packages using MCMC Algorithms for Linear Inverse Modeling of Metabolic Networks
Gathered under the name of metabolic networks, trophic, biochemical, and urban networks are here handled as a single field. In the Linear Inverse Modeling framework, these highly complex objects of research are all mathematically represented by weighted oriented graphs whose vertices are compartments and edges the flows (or flux) of matter or energy. All the flows that satisfy realistic constraints belong to very anisotropic high dimensional polytopes that cannot be analytically determined. Sampling the polytope yields a set of possible scenarios for the metabolic network. Different Monte Carlo Markov Chain (MCMC) algorithms together with their most recent implementations are scrutinized, leading to design an updated R package called samplelim. Comparison of the most recent implementations in terms of both computation time and sampling performances follows a methodology involving acknowledged and new statistical diagnostics and indexes. Application on real data metabolic networks of the three types shows that samplelim gathers the best properties of previous implementations of the MCMC algorithms.
Open AccessComparing and Updating R Packages using MCMC Algorithms for Linear Inverse Modeling of Metabolic Networks
Gathered under the name of metabolic networks, trophic, biochemical, and urban networks are here handled as a single field. In the Linear Inverse Modeling framework, these highly complex objects of research are all mathematically represented by weighted oriented graphs whose vertices are compartments and edges the flows (or flux) of matter or energy. All the flows that satisfy realistic constraints belong to very anisotropic high dimensional polytopes that cannot be analytically determined. Sampling the polytope yields a set of possible scenarios for the metabolic network. Different Monte Carlo Markov Chain (MCMC) algorithms together with their most recent implementations are scrutinized, leading to design an updated R package called samplelim. Comparison of the most recent implementations in terms of both computation time and sampling performances follows a methodology involving acknowledged and new statistical diagnostics and indexes. Application on real data metabolic networks of the three types shows that samplelim gathers the best properties of previous implementations of the MCMC algorithms.
- 1 August 2023
- Published by Springer Nature
- p. 117-124
Extensive Entropy Functionals and Non-ergodic Random Walks
- 1 August 2023
- Published by Springer Nature
- p. 117-124
Extensive Entropy Functionals and Non-ergodic Random Walks
- Open Access
- 3 November 2022
- Published by MDPI AG in Physical Sciences Forum
- Vol. 5 (1) , 9
Linear (h,φ)-Entropies for Quasi-Power Sequences with a Focus on the Logarithm of Taneja Entropy
Conditions are highlighted for generalized entropies to allow for non-trivial time-averaged entropy rates for a large class of random sequences, including Markov chains and continued fractions. The axiomatic-free conditions arise from the behavior of the marginal entropy of the sequence. Apart from the well-known Shannon and Rényi cases, only logarithmic versions of Sharma–Taneja–Mittal entropies may fulfill these conditions. Their main properties are detailed.
- 3 November 2022
- Published by MDPI AG in Physical Sciences Forum
- Vol. 5 (1) , 9
Open AccessLinear (h,φ)-Entropies for Quasi-Power Sequences with a Focus on the Logarithm of Taneja Entropy
Conditions are highlighted for generalized entropies to allow for non-trivial time-averaged entropy rates for a large class of random sequences, including Markov chains and continued fractions. The axiomatic-free conditions arise from the behavior of the marginal entropy of the sequence. Apart from the well-known Shannon and Rényi cases, only logarithmic versions of Sharma–Taneja–Mittal entropies may fulfill these conditions. Their main properties are detailed.
- 2 January 2022
- Published by Taylor & Francis in Sequential Analysis
- Vol. 41 (1) , 119-141
Asymptotically optimal robust information-based quick detection for general stochastic models with nonparametric postchange uncertainty
By making use of Kullback-Leibler information, we develop a new approach for the quickest detection problem for general statistical models with dependent observations and unknown postchange distributions; the postchange distribution depends on either unknown informative parameters or unknown nonparametric infinite-dimensional nuisance functions. For such models, we introduce a robust risk as the supremum of the mean detection delay over the class of postchange distributions. On the basis of the window-limited cumulative sum rules developed by Lai in 1988, we propose new detection procedures, making use of the noise density that minimizes the Kullback-Leibler divergence. Then for the constructed detection procedures, we provide sufficient conditions on the considered statistical models that ensure minimax optimality properties with respect to the robust risk. We apply the developed methods to the quick detection problems for both scalar and multivariate autoregressive processes with unknown postchange parameters and unknown noise distributions.
- 2 January 2022
- Published by Taylor & Francis in Sequential Analysis
- Vol. 41 (1) , 119-141
Asymptotically optimal robust information-based quick detection for general stochastic models with nonparametric postchange uncertainty
By making use of Kullback-Leibler information, we develop a new approach for the quickest detection problem for general statistical models with dependent observations and unknown postchange distributions; the postchange distribution depends on either unknown informative parameters or unknown nonparametric infinite-dimensional nuisance functions. For such models, we introduce a robust risk as the supremum of the mean detection delay over the class of postchange distributions. On the basis of the window-limited cumulative sum rules developed by Lai in 1988, we propose new detection procedures, making use of the noise density that minimizes the Kullback-Leibler divergence. Then for the constructed detection procedures, we provide sufficient conditions on the considered statistical models that ensure minimax optimality properties with respect to the robust risk. We apply the developed methods to the quick detection problems for both scalar and multivariate autoregressive processes with unknown postchange parameters and unknown noise distributions.
- 28 October 2021
- Published by Springer Nature in Journal of Mathematical Biology
- Vol. 83 (5) , 1-29
Analysis of trophic networks: an optimisation approach
We introduce a methodology to study the possible matter flows of an ecosystem defined by observational biomass data and realistic biological constraints. The flows belong to a polyhedron in a multi dimensional space that may make statistical exploration difficult in practice; instead, we propose to solve a convex optimization problem. Seven criteria based on ecological network indices have been selected to be used as convex goal functions. Numerical results show that the method is fast and can be used for large systems. Minimum flow solutions are analyzed using flow decomposition in paths and circuits. Their consistency is also tested by introducing a system of differential equations for the biomasses and examining the stability of the biomass fixed point. The method is illustrated and explained throughout the text on an ecosystem toy model. It is also applied to realistic food models.
- 28 October 2021
- Published by Springer Nature in Journal of Mathematical Biology
- Vol. 83 (5) , 1-29
Analysis of trophic networks: an optimisation approach
We introduce a methodology to study the possible matter flows of an ecosystem defined by observational biomass data and realistic biological constraints. The flows belong to a polyhedron in a multi dimensional space that may make statistical exploration difficult in practice; instead, we propose to solve a convex optimization problem. Seven criteria based on ecological network indices have been selected to be used as convex goal functions. Numerical results show that the method is fast and can be used for large systems. Minimum flow solutions are analyzed using flow decomposition in paths and circuits. Their consistency is also tested by introducing a system of differential equations for the biomasses and examining the stability of the biomass fixed point. The method is illustrated and explained throughout the text on an ecosystem toy model. It is also applied to realistic food models.
- 1 July 2020
- Published by Wiley in Journal of Time Series Analysis
- Vol. 41 (4) , 590-602
Filling the gap between Continuous and Discrete Time Dynamics of Autoregressive Processes
- 1 July 2020
- Published by Wiley in Journal of Time Series Analysis
- Vol. 41 (4) , 590-602
Filling the gap between Continuous and Discrete Time Dynamics of Autoregressive Processes
- 30 October 2018
- Published by Springer Nature in Methodology and Computing in Applied Probability
- Vol. 21 (4) , 1431-1452
Different Closed-Form Expressions for Generalized Entropy Rates of Markov Chains
- 30 October 2018
- Published by Springer Nature in Methodology and Computing in Applied Probability
- Vol. 21 (4) , 1431-1452
Different Closed-Form Expressions for Generalized Entropy Rates of Markov Chains
- Open Access
- 21 September 2018
- Published by Wiley in Applied Stochastic Models in Business and Industry
- Vol. 34 (6) , 760-761
Foreword: Special issue on the future of applied stochastic models and data analysis
- 21 September 2018
- Published by Wiley in Applied Stochastic Models in Business and Industry
- Vol. 34 (6) , 760-761
Open AccessForeword: Special issue on the future of applied stochastic models and data analysis