By viewing a stochastic process as a random variable taking values in a path space, the support of its law describes the set of all attainable paths. In this talk, we show that the support of the law of a solution to a path-dependent stochastic differential equation is given by the image of the Cameron-Martin space under the flow of mild solutions to path-dependent ordinary differential equations, constructed by means of the vertical derivative of the diffusion coefficient. This result is based on joint work with Rama Cont and extends the Stroock-Varadhan support theorem for diffusion processes to the path-dependent case.

Abstract: The edge reinforced random walk is a self-interacting process, in which the random walker prefer visited edges with a bias proportional to the number of times the edges were visited. We will gently introduce this model and talk about some of its histories and recent progresses.

We will consider some problems on calculating  the average  angles of random polytopes. Some of them are open.

Consider the asymmetric simple exclusion process with k particles on a linear lattice of N sites. I will present results on the asymptotic of the time needed for the system to reach its equilibrium distribution starting from the worst initial configuration (also called mixing time). Two main regimes appear according to the strength of the asymmetry (in terms of k and N), and in both regimes, the system displays a cutoff phenomenon: the distance to equilibrium falls abruptly from 1 to 0. This is a joint work with Hubert Lacoin (IMPA).

In a joint-work with Andrea Collevecchio and Vladas Sidoravicius,  we study  phase transitions in the recurrence/transience of a class of self-interacting random walks on trees, which includes the once-reinforced random walk. For this purpose, we define the branching-ruin number of a tree, which is  a natural way to measure trees with polynomial growth and therefore provides a polynomial version of the branching number defined by Furstenberg (1970) and studied by R. Lyons (1990). We prove that the branching-ruin number of a tree is equal to the critical parameter for the recurrence/transience of the once-reinforced random walk on this tree. We will also mention two other results where the branching-ruin number arises as critical parameter: first, in the context of random walks on heavy-tailed random conductances on trees and, second, in the case of Volkov's M-digging random walk.

We consider Brownian motion with Kato class measure-valued drift.   A small time large deviation principle and a Varadhan type asymptotics for the Brownian motion with singular drift are established. We also study the existence and uniqueness of the associated Dirichlet boundary value problems.

We first give a short introduction to analysis and stochastic processes on fractal state spaces and the typical difficulties involved.

We then discuss gradient operators and semilinear PDE. They are used to formulate the main result which establishes the hydrodynamic limit of the weakly asymmetric exclusion process on the Sierpinski gasket in the form of a law of large numbers for the particle density. We will explain some details and, if time permits, also sketch a corresponding large deviations principle for the symmetric case.

In this talk I present work in progress with Wolfgang König and Nicolas Perkowski on the parabolic Anderson model (PAM) with white noise potential in 2d. We show the behavior of the total mass as the time tends to infinity. By using partial Girsanov transform and singular heat kernel estimates we can obtain the mass-asymptotics by using the eigenvalue asymptotics that have been showed in another work in progress with Khalil Chouk. 

We prove an a priori bound for solutions of the dynamic $\Phi^4_3$ equation.

This bound provides a control on solutions on a compact space-time set only in terms of the realisation of the noise on an enlargement of this set, and it does not depend on any choice of space-time boundary conditions.

We treat the  large and small scale behaviour of solutions with completely different arguments.For small scales we use bounds akin to those presented in Hairer's theory of regularity structures. We stress immediately that our proof is fully self-contained, but we give a detailed explanation of how our arguments relate to Hairer's. For large scales we use a PDE argument based on the maximum principle. Both regimes are connected by a solution-dependent regularisation procedure.

The fact that our bounds do not depend on space-time boundary conditions makes them useful for the analysis of large scale properties of solutions. They can for example be used in a compactness argument to construct solutions on the full space and their invariant measures

Abstract: We use groupoids to describe a geometric framework which can host a generalisation of Hairer's regularity structures to manifolds. In this setup, Hairer's re-expansionmap (usually denoted \Gamma) is a (direct) connection on a gauge groupoid and can therefore be viewed as a groupoid counterpart of a (local) gauge field. This definitions enables us to make the link between re-expansion maps (direct connections), principal connections and path connections, to understand the flatness of the direct connection in terms of that of the manifold and, finally, to easily build a polynomial regularity structure which we compare to the one given by Driver, Diehl and Dahlquist. (Join work with Sara Azzali, Alessandra Frabetti and Sylvie Paycha).