Publication

Quantum fluctuations of one-dimensional free fermions and Fisher-Hartwig formula for Toeplitz determinants

Publications associées (30)

Statistical limits of dictionary learning: Random matrix theory and the spectral replica method

Nicolas Macris, Jean François Emmanuel Barbier

We consider increasingly complex models of matrix denoising and dictionary learning in the Bayes-optimal setting, in the challenging regime where the matrices to infer have a rank growing linearly with the system size. This is in contrast with most existin ...

AMER PHYSICAL SOC2022

Distribution-on-distribution regression via optimal transport maps

Victor Panaretos, Laya Ghodrati

We present a framework for performing regression when both covariate and response are probability distributions on a compact interval. Our regression model is based on the theory of optimal transportation, and links the conditional Frechet mean of the resp ...

OXFORD UNIV PRESS2022

Assessment of the Lightning Performance of overhead distribution lines based on Lightning Location Systems data

Farhad Rachidi-Haeri

This article presents the Lightning Performance (LP) assessment of a realistic portion of the Italian distribution network with the use of probability distributions for lightning parameters inferred from local data recorded by a Lightning Location System ( ...

2022

The Lang-Trotter conjecture for products of non-CM elliptic curves

Vlad Serban

Inspired by the work of Lang-Trotter on the densities of primes with fixed Frobenius traces for elliptic curves defined over Q and by the subsequent generalization of Cojocaru-Davis-Silverberg-Stange to generic abelian varieties, we study the analogous que ...

SPRINGER2022

Principles of checkpoint override

Ahmad Sadeghi

Why biological quality-control systems fail is often mysterious. Specifically, checkpoints such as the DNA damage checkpoint or the spindle assembly checkpoint are overriden after prolonged arrests allowing cells to continue dividing despite the continued ...

EPFL2022

Bootstrapping for Approximate Homomorphic Encryption with Negligible Failure-Probability by Using Sparse-Secret Encapsulation

Jean-Pierre Hubaux, Jean-Philippe Léonard Bossuat, Juan Ramón Troncoso-Pastoriza

Bootstrapping parameters for the approximate homomorphic-encryption scheme of Cheon et al., CKKS (Asiacrypt 17), are usually instantiated using sparse secrets to be efficient. However, using sparse secrets constrains the range of practical parameters withi ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

Removing Algorithmic Discrimination (With Minimal Individual Error)

Rachid Guerraoui, El Mahdi El Mhamdi, Le Nguyen Hoang, Alexandre David Olivier Maurer

We address for the first time the problem of correcting group discriminations within a score function, while minimizing the individual error. Each group is described by a probability density function on the set of profiles. We first solve the problem analy ...

2022

On rationally connected varieties over C1 fields of characteristic 0

Marta Pieropan

We use birational geometry to show that the existence of rational points on proper rationally connected varieties over fields of characteristic 0 is a consequence of the existence of rational points on terminal Fano varieties. We discuss several consequenc ...

MATHEMATICAL SCIENCE PUBL2022

Investigation and Validation of Unstructured Mesh Methodologies for Modeling Experimental Reactors

Andreas Pautz, Mathieu Hursin, Carlo Fiorina, Tom Mager

This paper summarizes a methodology developed at Ecole Polytechnique Federale de Lausanne for the neutronic modeling of the CROCUS experimental reactor and proposes solutions to the challenges one may face while modeling a research reactor with a complex g ...

MDPI2022

Discrete Optimal Transport with Independent Marginals is #P-Hard

Daniel Kuhn, Soroosh Shafieezadeh Abadeh, Bahar Taskesen

We study the computational complexity of the optimal transport problem that evaluates the Wasser- stein distance between the distributions of two K-dimensional discrete random vectors. The best known algorithms for this problem run in polynomial time in th ...

2023