Concept

Espace probabilisé

Publications associées (197)

Toward Mobile Distributed Ledgers

Boi Faltings, Sujit Prakash Gujar, Dimitrios Chatzopoulos, Anurag Jain

Advances in mobile computing have paved the way for new types of distributed applications that can be executed solely by mobile devices on Device-to-Device (D2D) ecosystems (e.g., crowdsensing). Sophisticated applications, like cryptocurrencies, need distr ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

Causal Discovery in Probabilistic Networks with an Identifiable Causal Effect

Negar Kiyavash, Ehsan Mokhtarian, Sina Akbari, Fateme Jamshidi, Seyed Jalal Etesami

Causal identification is at the core of the causal inference literature, where complete algorithms have been proposed to identify causal queries of interest. The validity of these algorithms hinges on the restrictive assumption of having access to a correc ...

2022

Nuclear Excitation by Free Muon Capture

Fabrizio Carbone, Ivan Madan, Simone Gargiulo

Efficient excitation of nuclei via exchange of a real or virtual photon has a fundamental importance for nuclear science and technology development. Here, we present a mechanism of nuclear excitation based on the capture of a free muon into the atomic orbi ...

AMER PHYSICAL SOC2022

Structure of multicorrelation sequences with integer part polynomial iterates along primes

Florian Karl Richter

Let T be a measure-preserving Zℓ-action on the probability space (X,B,μ), let q1,…,qm:R→Rℓ be vector polynomials, and let f0,…,fm∈L∞⁡(X). For any ϵ>0 and multicorrelation sequences of the form α⁡(n)=∫Xf0⋅T⌊q1⁡(n)⌋⁢f1⋯T⌊qm⁡(n)⌋⁢fmd⁢μ we show that there exis ...

2021

Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solution

Daniel Kuhn, Soroosh Shafieezadeh Abadeh, Bahar Taskesen

Semi-discrete optimal transport problems, which evaluate the Wasserstein distance between a discrete and a generic (possibly non-discrete) probability measure, are believed to be computationally hard. Even though such problems are ubiquitous in statistics, ...

2021

MATHICSE Technical Report : A probabilistic finite element method based on random meshes: Error estimators and Bayesian inverse problems

Assyr Abdulle, Giacomo Garegnani

We present a novel probabilistic finite element method (FEM) for the solution and uncertainty quantification of elliptic partial differential equations based on random meshes, which we call random mesh FEM (RM-FEM). Our methodology allows to introduce a pr ...

EPFL2021

A probabilistic finite element method based on random meshes: A posteriori error estimators and Bayesian inverse problems

Assyr Abdulle, Giacomo Garegnani

ELSEVIER SCIENCE SA2021

Is there an analog of Nesterov acceleration for gradient-based MCMC?

Nicolas Henri Bernard Flammarion, Xiang Cheng

We formulate gradient-based Markov chain Monte Carlo (MCMC) sampling as optimization on the space of probability measures, with Kullback-Leibler (KL) divergence as the objective functional. We show that an under-damped form of the Langevin algorithm perfor ...

INT STATISTICAL INST2021

Predicting involuntary hospitalization in psychiatry: A machine learning investigation

Mehdi Gholam

Background Coercion in psychiatry is a controversial issue. Identifying its predictors and their interaction using traditional statistical methods is difficult, given the large number of variables involved. The purpose of this study was to use machine-lear ...

CAMBRIDGE UNIV PRESS2021

A decomposition of multicorrelation sequences for commuting transformations along primes

Florian Karl Richter

A decomposition of multicorrelation sequences for commuting transformations along primes, Discrete Analysis 2021:4, 27 pp. Szemerédi's theorem asserts that for every positive integer

k

and every

\delta>0

there exists

n

such that every subset of ${1, ...

2021

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

A decomposition of multicorrelation sequences for commuting transformations along primes

Florian Karl Richter

A decomposition of multicorrelation sequences for commuting transformations along primes, Discrete Analysis 2021:4, 27 pp. Szemerédi's theorem asserts that for every positive integer

k

and every

\delta>0

there exists

n

such that every subset of ${1, ...

2021