Publication

Intrinsic area near the origin for self-similar growth-fragmentations and related random surfaces

Publications associées (32)

CONVERGENCE AND NONCONVERGENCE OF SCALED SELF-INTERACTING RANDOM WALKS TO BROWNIAN MOTION PERTURBED AT EXTREMA

We use generalized Ray-Knight theorems, introduced by B. Toth in 1996, together with techniques developed for excited random walks as main tools for establishing positive and negative results concerning convergence of some classes of diffusively scaled sel ...

Cleveland2023

A Functional Perspective on Information Measures

Amedeo Roberto Esposito

Since the birth of Information Theory, researchers have defined and exploited various information measures, as well as endowed them with operational meanings. Some were born as a "solution to a problem", like Shannon's Entropy and Mutual Information. Other ...

EPFL2022

The n-term Approximation of Periodic Generalized Levy Processes

Michaël Unser, Julien René Pierre Fageot, John Paul Ward

In this paper, we study the compressibility of random processes and fields, called generalized Levy processes, that are solutions of stochastic differential equations driven by d-dimensional periodic Levy white noises. Our results are based on the estimati ...

SPRINGER/PLENUM PUBLISHERS2020

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

Normal approximation of the solution to the stochastic heat equation with Levy noise

Carsten Hao Ye Chong

Given a sequence L & x2d9;epsilon of Levy noises, we derive necessary and sufficient conditions in terms of their variances sigma 2(epsilon) such that the solution to the stochastic heat equation with noise sigma(epsilon)-1L & x2d9;epsilon converges in law ...

SPRINGER2020

Exceptional graphs for the random walk

Juhan Aru

If W is the simple random walk on the square lattice Z(2), then W induces a random walk W-G on any spanning subgraph G subset of Z(2) of the lattice as follows: viewing W as a uniformly random infinite word on the alphabet {x, -x, y, -y}, the walk W-G star ...

INST MATHEMATICAL STATISTICS2020

Scaling Limits of Solutions of Linear Stochastic Differential Equations Driven by Levy White Noises

Michaël Unser, Julien René Pierre Fageot

Consider a random process s that is a solution of the stochastic differential equation Ls = w with L a homogeneous operator and w a multidimensional Levy white noise. In this paper, we study the asymptotic effect of zooming in or zooming out of the process ...

SPRINGER/PLENUM PUBLISHERS2019

Architecture in the Data-driven City

Frederick Peter Ortner

In the last ten years, new sources of urban big data have made it possible for algorithms to increasingly control how the city is perceived, understood and managed by its inhabitants; this is the data-driven city. New efforts in the social sciences, like ...

EPFL2019

Asynchronous adaptive networks

Ali H. Sayed

In a recent article [1] we surveyed advances related to adaptation, learning, and optimization over synchronous networks. Various distributed strategies were discussed that enable a collection of networked agents to interact locally in response to streamin ...

Elsevier2018

Gaussian versus Sparse Stochastic Processes

Julien René Pierre Fageot

Although our work lies in the field of random processes, this thesis was originally motivated by signal processing applications, mainly the stochastic modeling of sparse signals. We develop a mathematical study of the innovation model, under which a signal ...

EPFL2017

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