Publications related to Probability space

Stable high-order randomized cubature formulae in arbitrary dimension

We propose and analyse randomized cubature formulae for the numerical integration of functions with respect to a given probability measure μ defined on a domain Γ⊆ℝ^d, in any dimension d. Each cubature formula is conceived to be exact on a given finite dim ...

2018

Dimension-free Information Concentration via Exp-Concavity

Volkan Cevher, Ya-Ping Hsieh

Information concentration of probability measures have important implications in learning theory. Recently, it is discovered that the information content of a log-concave distribution concentrates around their differential entropy, albeit with an unpleasan ...

2018

MATHICSE Technical Report : Random time step probabilistic methods for uncertainty quantification in chaotic and geometric numerical integration

Assyr Abdulle, Giacomo Garegnani

A novel probabilistic numerical method for quantifying the uncertainty induced by the time integration of ordinary differential equations (ODEs) is introduced. Departing from the classical strategy to randomize ODE solvers by adding a random forcing term, ...

MATHICSE2018

The stochastic heat equation: hitting probabilities and the probability density function of the supremum via Malliavin calculus

Fei Pu

In this thesis, we study systems of linear and/or non-linear stochastic heat equations and fractional heat equations in spatial dimension

1

driven by space-time white noise. The main topic is the study of hitting probabilities for the solutions to these ...

EPFL2018

Selection Bias in News Coverage: Learning it, Fighting it

Karl Aberer, Jérémie Rappaz

News entities must select and filter the coverage they broadcast through their respective channels since the set of world events is too large to be treated exhaustively. The subjective nature of this filtering induces biases due to, among other things, res ...

2018

The Complexity of a Reliable Distributed System

Alexandre David Olivier Maurer

Studying the complexity of distributed algorithms typically boils down to evaluating how the number of messages exchanged (resp. communication steps performed or shared memory operations executed) by nodes to reliably achieve some common task, evolves with ...

2017

A general framework for routing problems with stochastic demands

Michel Bierlaire, Sacha Varone, Mohammad Yousef Maknoon, Iliya Dimitrov Markov

We introduce a unified modeling and solution framework for various classes of rich vehicle and inventory routing problems as well as other probability-based routing problems with a time-horizon dimension. Demand is assumed to be stochastic and non-stationa ...

2017

Csma/ca in time and frequency domains

Patrick Thiran, Julien Pierre Sacha Herzen

The present invention concerns a method for a communication device to transmit a data packet in a wireless communication system. The method comprises: determining (21) a first set of transmission parameters comprising a first central transmission frequency ...

2017

Control synthesis for stochastic systems given automata specifications defined by stochastic sets

Maryam Kamgarpour, John Lygeros, Tony Alan Wood

The problem of control synthesis to maximize the probability of satisfying automata specifications for systems with uncertainty is addressed. Two types of uncertainty are considered; stochasticity in the dynamical system and in the sets defining the specif ...

2017

Development of a methodology for extreme flood estimations in alpine catchments for the verification of dam safety

Fränz Zeimetz

In the context of dam safety, reliable safety flood estimation methods are necessary to guarantee a sufficiently designed spillway capacity. Todayâs state of the art allows to approach this topic under different angles. Statistical extrapolations are com ...

EPFL2017

Probability space

Graph Chatbot

Chat with Graph Search

Stable high-order randomized cubature formulae in arbitrary dimension

Dimension-free Information Concentration via Exp-Concavity

MATHICSE Technical Report : Random time step probabilistic methods for uncertainty quantification in chaotic and geometric numerical integration

The stochastic heat equation: hitting probabilities and the probability density function of the supremum via Malliavin calculus

Selection Bias in News Coverage: Learning it, Fighting it

The Complexity of a Reliable Distributed System

A general framework for routing problems with stochastic demands

Csma/ca in time and frequency domains

Control synthesis for stochastic systems given automata specifications defined by stochastic sets

Development of a methodology for extreme flood estimations in alpine catchments for the verification of dam safety

Stable high-order randomized cubature formulae in arbitrary dimension

Selection Bias in News Coverage: Learning it, Fighting it

MATHICSE Technical Report : Random time step probabilistic methods for uncertainty quantification in chaotic and geometric numerical integration

The stochastic heat equation: hitting probabilities and the probability density function of the supremum via Malliavin calculus

Dimension-free Information Concentration via Exp-Concavity

A general framework for routing problems with stochastic demands

The Complexity of a Reliable Distributed System

Csma/ca in time and frequency domains

Control synthesis for stochastic systems given automata specifications defined by stochastic sets

Development of a methodology for extreme flood estimations in alpine catchments for the verification of dam safety