Related papers: Diagram-free approach for convergence of tree-base…
In this paper, we explore the version of Hairer's regularity structures based on a greedier index set than trees, as introduced by Otto, Sauer, Smith and Weber. More precisely, we construct and stochastically estimate the renormalized model…
We give a motivation and gentle introduction into the regularity structure and model introduced by Otto, Sauer, Smith and Weber, which fall into the framework of Hairer, but have a greedier index set than the one given by trees. We do this…
These lecture notes are intended as reader's digest of recent work on a diagram-free approach to the renormalized centered model in Hairer's regularity structures. More precisely, it is about the stochastic estimates of the centered model,…
Extended decorations on naturally decorated trees were introduced in the work of Bruned, Hairer and Zambotti on algebraic renormalization of regularity structures to provide a convenient framework for the renormalization of systems of…
In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various…
We give a proof of the convergence of the BHZ renormalized model associated with the generalized (KPZ) equation that does not require the full strength of the BPHZ renormalisation. Our approach is based on a convenient form of chaos…
This paper presents a new approach for trees-based regression, such as simple regression tree, random forest and gradient boosting, in settings involving correlated data. We show the problems that arise when implementing standard…
This survey is devoted to Martin Hairer's Reconstruction Theorem, which is one of the cornerstones of his theory of Regularity Structures. Our aim is to give a new self-contained and elementary proof of this Theorem, together with some…
We consider the inference of the structure of an undirected graphical model in an exact Bayesian framework. More specifically we aim at achieving the inference with close-form posteriors, avoiding any sampling step. This task would be…
We show that the homology of ordered configuration spaces of finite trees with loops is torsion free. We introduce configuration spaces with sinks, which allow for taking quotients of the base space. Furthermore, we give a concrete…
This is a companion paper to the paper "Hyperstability in the Erdos-Sos Conjecture". In that paper the following rough structure theorem was proved for graphs G containing no copy of a bounded degree tree T: from any such G, one can delete…
We develop the algebraic theory of rough path translation. Particular attention is given to the case of branched rough paths, whose underlying algebraic structure (Connes-Kreimer, Grossman-Larson) makes it a useful model case of a…
In this work, we study the renormalisation of singular SPDEs in the flow approach recently developed by Duch. We introduce a general ansatz based on decorated trees for the solution of the flow equation. The ansatz is renormalised in a…
We develop a shape analysis for reasoning about relational properties of data structures. Both the concrete and the abstract domain are represented by hypergraphs. The analysis is parameterized by user-supplied indexed graph grammars to…
We prove a general theorem on the stochastic convergence of appropriately renormalized models arising from nonlinear stochastic PDEs. The theory of regularity structures gives a fairly automated framework for studying these problems but…
We provide proofs certifying that the structure theorem for vertex sets of bounded bidimensionality holds with polynomial bounds. The bidimensionality of vertex sets is a common generalisation of both treewidth and the face-cover-number of…
We present a link-by-link rule-based method for constructing all members of the ensemble of spanning trees for any recursively generated, finitely articulated graph, such as the DGM net. The recursions allow for many large-scale properties…
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…
Many scientific datasets are of high dimension, and the analysis usually requires visual manipulation by retaining the most important structures of data. Principal curve is a widely used approach for this purpose. However, many existing…
We introduce a numerical framework for dispersive equations embedding their underlying resonance structure into the discretisation. This will allow us to resolve the nonlinear oscillations of the PDE and to approximate with high order…