Emilie Dufresne
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
Emilie Dufresne has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Heather A. Harrington
Affiliations Mathematical Institute, University of Oxford, Oxford, United Kingdom, Max Planck Institute of Molecular Cell Biology and Genetics, Dresden, Germany, Centre for Systems Biology Dresden, Dresden, Germany, Faculty of Mathematics, Technische Universität Dresden, Dresden, Germany, Physics of Life, Technische Universität Dresden, Dresden, Germany
4 shared publications - Martin Kohls
Technische Universität München, Zentrum Mathematik-M11, Boltzmannstrasse 3, 85748 Garching, Germany
4 shared publications - Andreas Maurischat
Interdisciplinary Center for Scientific Computing (IWR), Heidelberg University, Im Neuenheimer Feld 368, 69120 Heidelberg, Germany
2 shared publications - Dhruva V. Raman
Univ Cambridge, Dept Engn, Cambridge, England
2 shared publications - Elina Robeva
Massachusetts Institute of Technology
2 shared publications - Hanspeter Kraft
Universität Basel
2 shared publications
Latest Publications
- 14 February 2024
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 377 (04) , 2317-2333
Rees algebras of sparse determinantal ideals
We determine the defining equations of the Rees algebra and of the special fiber ring of the ideal of maximal minors of a 2 × n 2\times n sparse matrix. We prove that their initial algebras are ladder determinantal rings. This allows us to show that the Rees algebra and the special fiber ring are Cohen-Macaulay domains, they are Koszul, they have rational singularities in characteristic zero and are F-rational in positive characteristic.
- 14 February 2024
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 377 (04) , 2317-2333
Rees algebras of sparse determinantal ideals
We determine the defining equations of the Rees algebra and of the special fiber ring of the ideal of maximal minors of a 2 × n 2\times n sparse matrix. We prove that their initial algebras are ladder determinantal rings. This allows us to show that the Rees algebra and the special fiber ring are Cohen-Macaulay domains, they are Koszul, they have rational singularities in characteristic zero and are F-rational in positive characteristic.
- Open Access
On Some Configurations of Oppositely Charged Trapped Vortices in the Plane
Our aim in the present work is to identify all the possible standing wave configurations involving few vortices of different charges in an atomic Bose-Einstein condensate (BEC). In this effort, we deploy the use of a computational algebra approach in order to identify stationary multi-vortex states with up to 6 vortices. The use of invariants and symmetries enables deducing a set of equations in elementary symmetric polynomials, which can then be fully solved via computational algebra packages within Maple. We retrieve a number of previously identified configurations, including collinear ones and polygonal (e.g. quadrupolar and hexagonal) ones. However, importantly, we also retrieve a configuration with 4 positive charges and 2 negative ones which is unprecedented, to the best of our knowledge, in BEC studies. We corroborate these predictions via numerical computations in the fully two-dimensional PDE system of the Gross-Pitaevskii type which characterizes the BEC at the mean-field level.
Open AccessOn Some Configurations of Oppositely Charged Trapped Vortices in the Plane
Our aim in the present work is to identify all the possible standing wave configurations involving few vortices of different charges in an atomic Bose-Einstein condensate (BEC). In this effort, we deploy the use of a computational algebra approach in order to identify stationary multi-vortex states with up to 6 vortices. The use of invariants and symmetries enables deducing a set of equations in elementary symmetric polynomials, which can then be fully solved via computational algebra packages within Maple. We retrieve a number of previously identified configurations, including collinear ones and polygonal (e.g. quadrupolar and hexagonal) ones. However, importantly, we also retrieve a configuration with 4 positive charges and 2 negative ones which is unprecedented, to the best of our knowledge, in BEC studies. We corroborate these predictions via numerical computations in the fully two-dimensional PDE system of the Gross-Pitaevskii type which characterizes the BEC at the mean-field level.
- Open Access
Sampling real algebraic varieties for topological data analysis
Topological data analysis (TDA) provides a growing body of tools for computing geometric and topological information about spaces from a finite sample of points. We present a new adaptive algorithm for finding provably dense samples of points on real algebraic varieties given a set of defining polynomials. The algorithm utilizes methods from numerical algebraic geometry to give formal guarantees about the density of the sampling and it also employs geometric heuristics to reduce the size of the sample. As TDA methods consume significant computational resources that scale poorly in the number of sample points, our sampling minimization makes applying TDA methods more feasible. We provide a software package that implements the algorithm and also demonstrate the implementation with several examples.
Open AccessSampling real algebraic varieties for topological data analysis
Topological data analysis (TDA) provides a growing body of tools for computing geometric and topological information about spaces from a finite sample of points. We present a new adaptive algorithm for finding provably dense samples of points on real algebraic varieties given a set of defining polynomials. The algorithm utilizes methods from numerical algebraic geometry to give formal guarantees about the density of the sampling and it also employs geometric heuristics to reduce the size of the sample. As TDA methods consume significant computational resources that scale poorly in the number of sample points, our sampling minimization makes applying TDA methods more feasible. We provide a software package that implements the algorithm and also demonstrate the implementation with several examples.
- Open Access
- 24 September 2018
- Published by Paul V. Galvin Library/Illinois Institute of Technology in Journal of Algebraic Statistics
- Vol. 9 (1) , 30-68
The geometry of Sloppiness
The use of mathematical models in the sciences often requires the estimation of unknown parameter values from data. Sloppiness provides information about the uncertainty of this task. In this paper, we develop a precise mathematical foundation for sloppiness and define rigorously its key concepts, such as `model manifold', in relation to concepts of structural identifiability. We redefine sloppiness conceptually as a comparison between the premetric on parameter space induced by measurement noise and a reference metric. This opens up the possibility of alternative quantification of sloppiness, beyond the standard use of the Fisher Information Matrix, which assumes that parameter space is equipped with the usual Euclidean and the measurement error is infinitesimal. Applications include parametric statistical models, explicit time dependent models, and ordinary differential equation models.
- 24 September 2018
- Published by Paul V. Galvin Library/Illinois Institute of Technology in Journal of Algebraic Statistics
- Vol. 9 (1) , 30-68
Open AccessThe geometry of Sloppiness
The use of mathematical models in the sciences often requires the estimation of unknown parameter values from data. Sloppiness provides information about the uncertainty of this task. In this paper, we develop a precise mathematical foundation for sloppiness and define rigorously its key concepts, such as `model manifold', in relation to concepts of structural identifiability. We redefine sloppiness conceptually as a comparison between the premetric on parameter space induced by measurement noise and a reference metric. This opens up the possibility of alternative quantification of sloppiness, beyond the standard use of the Fisher Information Matrix, which assumes that parameter space is equipped with the usual Euclidean and the measurement error is infinitesimal. Applications include parametric statistical models, explicit time dependent models, and ordinary differential equation models.
- Open Access
Mapping toric varieties into low dimensional spaces
A smooth $d$-dimensional projective variety $X$ can always be embedded into $2d+1$-dimensional space. In contrast, a singular variety may require an arbitrary large ambient space. If we relax our requirement and ask only that the map is injective, then any $d$-dimensional projective variety can be mapped injectively to $2d+1$-dimensional projective space. A natural question then arises: what is the minimal $m$ such that a projective variety can be mapped injectively to $m$-dimensional projective space? In this paper we investigate this question for normal toric varieties, with our most complete results being for Segre-Veronese varieties.Open AccessMapping toric varieties into low dimensional spaces
A smooth $d$-dimensional projective variety $X$ can always be embedded into $2d+1$-dimensional space. In contrast, a singular variety may require an arbitrary large ambient space. If we relax our requirement and ask only that the map is injective, then any $d$-dimensional projective variety can be mapped injectively to $2d+1$-dimensional projective space. A natural question then arises: what is the minimal $m$ such that a projective variety can be mapped injectively to $m$-dimensional projective space? In this paper we investigate this question for normal toric varieties, with our most complete results being for Segre-Veronese varieties. - Open Access
The geometry of sloppiness
The use of mathematical models in the sciences often involves the estimation of unknown parameter values from data. Sloppiness provides information about the uncertainty of this task. In this paper, we develop a precise mathematical foundation for sloppiness and define rigorously its key concepts, such as `model manifold', in relation to concepts of structural identifiability. We redefine sloppiness conceptually as a comparison between the premetric on parameter space induced by measurement noise and a reference metric. This opens up the possibility of alternative quantification of sloppiness, beyond the standard use of the Fisher Information Matrix, which assumes that parameter space is equipped with the usual Euclidean metric and the measurement error is infinitesimal. Applications include parametric statistical models, explicit time dependent models, and ordinary differential equation models.
Open AccessThe geometry of sloppiness
The use of mathematical models in the sciences often involves the estimation of unknown parameter values from data. Sloppiness provides information about the uncertainty of this task. In this paper, we develop a precise mathematical foundation for sloppiness and define rigorously its key concepts, such as `model manifold', in relation to concepts of structural identifiability. We redefine sloppiness conceptually as a comparison between the premetric on parameter space induced by measurement noise and a reference metric. This opens up the possibility of alternative quantification of sloppiness, beyond the standard use of the Fisher Information Matrix, which assumes that parameter space is equipped with the usual Euclidean metric and the measurement error is infinitesimal. Applications include parametric statistical models, explicit time dependent models, and ordinary differential equation models.
- Open Access
- 8 December 2017
- Published by Walter de Gruyter GmbH in Journal of Causal Inference
- Vol. 6 (1)
Determinantal Generalizations of Instrumental Variables
Linear structural equation models relate the components of a random vector using linear interdependencies and Gaussian noise. Each such model can be naturally associated with a mixed graph whose vertices correspond to the components of the random vector. The graph contains directed edges that represent the linear relationships between components, and bidirected edges that encode unobserved confounding. We study the problem of generic identifiability, that is, whether a generic choice of linear and confounding effects can be uniquely recovered from the joint covariance matrix of the observed random vector. An existing combinatorial criterion for establishing generic identifiability is the half-trek criterion (HTC), which uses the existence of trek systems in the mixed graph to iteratively discover generically invertible linear equation systems in polynomial time. By focusing on edges one at a time, we establish new sufficient and new necessary conditions for generic identifiability of edge effects extending those of the HTC. In particular, we show how edge coefficients can be recovered as quotients of subdeterminants of the covariance matrix, which constitutes a determinantal generalization of formulas obtained when using instrumental variables for identification. While our results do not completely close the gap between existing sufficient and necessary conditions we find, empirically, that our results allow us to prove the generic identifiability of many more mixed graphs than the prior state-of-the-art.
- 8 December 2017
- Published by Walter de Gruyter GmbH in Journal of Causal Inference
- Vol. 6 (1)
Open AccessDeterminantal Generalizations of Instrumental Variables
Linear structural equation models relate the components of a random vector using linear interdependencies and Gaussian noise. Each such model can be naturally associated with a mixed graph whose vertices correspond to the components of the random vector. The graph contains directed edges that represent the linear relationships between components, and bidirected edges that encode unobserved confounding. We study the problem of generic identifiability, that is, whether a generic choice of linear and confounding effects can be uniquely recovered from the joint covariance matrix of the observed random vector. An existing combinatorial criterion for establishing generic identifiability is the half-trek criterion (HTC), which uses the existence of trek systems in the mixed graph to iteratively discover generically invertible linear equation systems in polynomial time. By focusing on edges one at a time, we establish new sufficient and new necessary conditions for generic identifiability of edge effects extending those of the HTC. In particular, we show how edge coefficients can be recovered as quotients of subdeterminants of the covariance matrix, which constitutes a determinantal generalization of formulas obtained when using instrumental variables for identification. While our results do not completely close the gap between existing sufficient and necessary conditions we find, empirically, that our results allow us to prove the generic identifiability of many more mixed graphs than the prior state-of-the-art.
- Open Access
Determinantal Generalizations of Instrumental Variables
Linear structural equation models relate the components of a random vector using linear interdependencies and Gaussian noise. Each such model can be naturally associated with a mixed graph whose vertices correspond to the components of the random vector. The graph contains directed edges that represent the linear relationships between components, and bidirected edges that encode unobserved confounding. We study the problem of generic identifiability, that is, whether a generic choice of linear and confounding effects can be uniquely recovered from the joint covariance matrix of the observed random vector. An existing combinatorial criterion for establishing generic identifiability is the half-trek criterion (HTC), which uses the existence of trek systems in the mixed graph to iteratively discover generically invertible linear equation systems in polynomial time. By focusing on edges one at a time, we establish new sufficient and necessary conditions for generic identifiability of edge effects extending those of the HTC. In particular, we show how edge coefficients can be recovered as quotients of subdeterminants of the covariance matrix, which constitutes a determinantal generalization of formulas obtained when using instrumental variables for identification.
Open AccessDeterminantal Generalizations of Instrumental Variables
Linear structural equation models relate the components of a random vector using linear interdependencies and Gaussian noise. Each such model can be naturally associated with a mixed graph whose vertices correspond to the components of the random vector. The graph contains directed edges that represent the linear relationships between components, and bidirected edges that encode unobserved confounding. We study the problem of generic identifiability, that is, whether a generic choice of linear and confounding effects can be uniquely recovered from the joint covariance matrix of the observed random vector. An existing combinatorial criterion for establishing generic identifiability is the half-trek criterion (HTC), which uses the existence of trek systems in the mixed graph to iteratively discover generically invertible linear equation systems in polynomial time. By focusing on edges one at a time, we establish new sufficient and necessary conditions for generic identifiability of edge effects extending those of the HTC. In particular, we show how edge coefficients can be recovered as quotients of subdeterminants of the covariance matrix, which constitutes a determinantal generalization of formulas obtained when using instrumental variables for identification.
- 25 January 2015
- Published by Springer Nature in Mathematische Zeitschrift
- Vol. 280 (1-2) , 231-255
Invariants and separating morphisms for algebraic group actions
- 25 January 2015
- Published by Springer Nature in Mathematische Zeitschrift
- Vol. 280 (1-2) , 231-255
Invariants and separating morphisms for algebraic group actions