Diagram-free approach for convergence of tree-based models in Regularity Structures
Yvain Bruned, Usama Nadeem

TL;DR
This paper introduces a diagram-free method for proving the convergence of tree-based models in Regularity Structures, expanding the applicability to more singular SPDEs and providing new insights into the algebraic foundations of the theory.
Contribution
It develops a diagram-free approach at the decorated tree level, broadening the scope of convergence results for Regularity Structures and clarifying algebraic aspects.
Findings
Broadened class of singular SPDEs covered by the approach
Simplified convergence proofs without diagrams
Enhanced understanding of algebraic structures in Regularity Structures
Abstract
In this work, we translate at the level of decorated trees some of the crucial arguments which have been used in arXiv:2112.10739 for proposing a diagram-free approach for the convergence of the model in Regularity Structures. This allows us to broaden the perspective and enlarge the scope of singular SPDEs covered by this approach. It also sheds new light on algebraic structures introduced in the foundational paper of Martin Hairer on Regularity structures which was used later for recursively described renormalised models.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTheoretical and Computational Physics · Algebraic structures and combinatorial models · Quantum many-body systems
