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.
We introduce a general distributional framework that results in a unifying description and characterization of a rich variety of continuous-time stochastic processes. The cornerstone of our approach is an innovation model that is driven by some generalized ...
We study stationary max-stable processes {n(t): t is an element of R} admitting a representation of the form n(t) = max(i is an element of N) (U-i +Y-i(t)), where Sigma(infinity)(i=1) delta U-i is a Poisson point process on R with intensity e(-u)du, and Y1 ...
We investigate smooth approximations of functions, with prescribed gradient behavior on a distinguished stratified subset of the domain. As an application, we outline how our results yield important consequences for a recently introduced class of stochasti ...
Motivated by the analog nature of real-world signals, we investigate continuous-time random processes. For this purpose, we consider the stochastic processes that can be whitened by linear transformations and we show that the distribution of their samples ...
We consider a process Z on the real line composed from a Levy process and its exponentially tilted version killed with arbitrary rates and give an expression for the joint law of the supremum (Z) over bar, its time T, and the process Z(T + center dot) - (Z ...
Gaussian random fields are widely used as building blocks for modeling stochastic processes. This paper is concerned with the efficient representation of d-point correlations for such fields, which in turn enables the representation of more general stochas ...
Many recent algorithms for sparse signal recovery can be interpreted as maximum-a-posteriori (MAP) estimators relying on some specific priors. From this Bayesian perspective, state-of-the-art methods based on discrete-gradient regularizers, such as total- ...
This project offers a rigorous introduction to the tools needed to construct a continuous stochastic process. Among other things, we give a very detailed proof of the Kolmogorov continuity criterion. We then construct a Brownian Motion following the formal ...
In the framework of stochastic processes, the connection between the dynamic programming scheme given by the Hamilton-Jacobi-Bellman equation and a recently proposed control approach based on the Fokker-Planck equation is discussed. Under appropriate assum ...
We investigate a stochastic signal-processing framework for signals with sparse derivatives, where the samples of a Levy process are corrupted by noise. The proposed signal model covers the well-known Brownian motion and piecewise-constant Poisson process; ...