Publications related to The Analog Formulation of Sparsity Implies Infinite Divisibility and Rules Out Bernoulli-Gaussian Priors

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Generating Sparse Stochastic Processes Using Matched Splines

Michaël Unser, Leello Tadesse Dadi, Shayan Aziznejad

We provide an algorithm to generate trajectories of sparse stochastic processes that are solutions of linear ordinary differential equations driven by Levy white noises. A recent paper showed that these processes are limits in law of generalized compound-P ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Gaussian and sparse processes are limits of generalized Poisson processes

Michaël Unser, Julien René Pierre Fageot, Virginie Sophie Uhlmann

The theory of sparse stochastic processes offers a broad class of statistical models to study signals, far beyond the more classical class of Gaussian processes. In this framework, signals are represented as realizations of random processes that are soluti ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2020

Content Based Status Updates

Emre Telatar, Elie Najm, Rajai Nasser

Consider a stream of status updates generated by a source, where each update is of one of two types: high priority or ordinary (low priority). These updates are to be transmitted through a network to a monitor. However, the transmission policy of each pack ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Statistical Aspects of Wasserstein Distances

Victor Panaretos, Yoav Zemel

Wasserstein distances are metrics on probability distributions inspired by the problem of optimal mass transportation. Roughly speaking, they measure the minimal effort required to reconfigure the probability mass of one distribution in order to recover th ...

ANNUAL REVIEWS2019

Non-perturbative probability distribution function for cosmological counts in cells

Sergey Sibiryakov, Mikhail Ivanov

We present a non-perturbative calculation of the 1-point probability distribution function (PDF) for the spherically-averaged matter density field. The PDF is represented as a path integral and is evaluated using the saddle-point method. It factorizes into ...

IOP PUBLISHING LTD2019

On Jump-Diffusive Driving Noise Sources: Some Explicit Results and Applications

Max-Olivier Hongler, Roger Filliger

We study some linear and nonlinear shot noise models where the jumps are drawn from a compound Poisson process with jump sizes following an Erlang-m distribution. We show that the associated Master equation can be written as a spatial mth order partial dif ...

Springer2019

Extremal behaviour of aggregated data with an application to downscaling

Sebastian Engelke, Raphaël Gérard Théodore Michel Marie de Deloÿe et Fourcade de Fondeville

The distribution of spatially aggregated data from a stochastic process may exhibit tail behaviour different from that of its marginal distributions. For a large class of aggregating functionals we introduce the -extremal coefficient, which quantifies this ...

OXFORD UNIV PRESS2019

An Analysis of the Distribution of Inter-Flash Time Intervals in the Area of the Santis Tower

Marcos Rubinstein, Antonio Sunjerga

In this paper we analyzed the time intervals between flashes in the Santis area for three highly active storms and also for a period of 21 months. The overall distributions of inter-flash time interval are found to be very similar and reasonably represente ...

IEEE2018