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 provide a relatively compact proof of the BPHZ theorem for regularity structures of decorated trees in the case where the driving noise satisfies a suitable spectral gap property, as in the Gaussian case. This is inspired by the recent work (Linares et al. in A diagram-free approach to the stochastic estimates in regularity structures, 2021. arXiv:2112.10739) in the multi-index setting, but our proof relies crucially on a novel version of the reconstruction theorem for a space of "pointed Besov modelled distributions". As a consequence, the analytical core of the proof is quite short and self-contained, which should make it easier to adapt the proof to different contexts (such as the setting of discrete models).