Concept

Fonction caractéristique (probabilités)

Publications associées (129)

Noise-induced transitions past the onset of a steady symmetry-breaking bifurcation: The case of the sudden expansion

François Gallaire, Edouard Boujo, Yves-Marie François Ducimetière

We consider fluid flows, governed by the Navier-Stokes equations, subject to a steady symmetry-breaking bifurcation and forced by a weak noise acting on a slow timescale. By generalizing the multiple-scale weakly nonlinear expansion technique employed in t ...

2024

Density Estimation In Rkhs With Application To Korobov Spaces In High Dimensions

Fabio Nobile, Yoshihito Kazashi

A kernel method for estimating a probability density function from an independent and identically distributed sample drawn from such density is presented. Our estimator is a linear combination of kernel functions, the coefficients of which are determined b ...

SIAM PUBLICATIONS2023

Stochastic particle transport by deep-water irregular breaking waves

Debbie Eeltink

Correct prediction of particle transport by surface waves is crucial in many practical applications such as search and rescue or salvage operations and pollution tracking and clean-up efforts. Recent results by Deike et al. (J. Fluid Mech., vol. 829, 2017, ...

Cambridge2023

Surface roughness and shear resistance in cracked concrete

Guillaume Anciaux, Mohit Pundir

In concrete structures, opened cracks contribute significantly to the transfer of shear and normal stresses through the contact forces acting on fractured surfaces. Such contact forces are due to protruding asperities, engaged by interlocking and friction ...

2022

Removing algorithmic discrimination (with minimal individual error)

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

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 ...

ELSEVIER2022

Removing Algorithmic Discrimination (With Minimal Individual Error)

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

2022

Finite free convolutions of polynomials

Adam Wade Marcus

We study three convolutions of polynomials in the context of free probability theory. We prove that these convolutions can be written as the expected characteristic polynomials of sums and products of unitarily invariant random matrices. The symmetric addi ...

SPRINGER HEIDELBERG2022

Equivariant Diffusion for Molecule Generation in 3D

Clément Arthur Yvon Vignac

This work introduces a diffusion model for molecule generation in 3D that is equivariant to Euclidean transformations. Our E(3) Equivariant Diffusion Model (EDM) learns to denoise a diffusion process with an equivariant network that jointly operates on bot ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2022

Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost

Adam Teodor Polak

We study the basic problem of assigning memoryless workers to tasks with dynamically changing demands. Given a set of w workers and a multiset T ⊆ [t] of |T| = w tasks, a memoryless worker-task assignment function is any function ϕ that assigns the workers ...

Schloss Dagstuhl -- Leibniz-Zentrum fur Informatik2022

Striatal dopamine explains novelty-induced behavioral dynamics and individual variability in threat prediction

Alexander Mathis, Mackenzie Mathis

Animals both explore and avoid novel objects in the environment, but the neural mechanisms that underlie these behaviors and their dynamics remain uncharacterized. Here, we used multi-point tracking (DeepLabCut) and behavioral segmentation (MoSeq) to chara ...

CELL PRESS2022

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search