arXiv subjects

Yvain Bruned

Publications and source records attributed to Yvain Bruned.

At least 19 recordsLinked to original sources

arXiv2026

Chain rule symmetry for singular SPDEs from multi-indices to decorated trees

In these lecture notes, we review the recent results around the chain rule for the generalised KPZ equation and the geometric KPZ equation. We introduce the main ideas of Regularity Structures via a B-series type expansion and the two main combinatorial sets for encoding this expansion: decorated trees and multi-indices. Then, we explain how the chain rule was first understood via integration by parts and diagrammatic computations. For the generalised KPZ equation, a scalar-valued equation, we use multi-indices to derive a characterisation in terms of iterations of covariant derivatives. The same characterisation for decorated trees is more involved and requires the use of operadic and homological tools. We summarise the main arguments of this proof.

math.PR↗

arXiv2026

On the equivalence between the Polchinski flow and the Connes-Kreimer approaches to perturbative renormalisation

We prove a correspondence between the Polchinski flow and the Connes-Kreimer approaches to perturbative renormalisation, in the sense that the first yields the same renormalisation as the latter. More precisely, we show that an ansatz based on decorated graphs (Feynman diagrams),with a combinatorial renormalisation procedure solves the Polchinski equation. This result holds for very general Euclidean quantum field theories. We are able to derive from this the form of the renormalised potential which is, to the best of our knowledge, the most general one in the literature. The main ingredients of the proof are multiple morphism properties with respect to the renormalisation, as well as a novel duality formula for forests of decorated graphs.

math-ph↗

arXiv2026

A general paracontrolled ansatz for singular SPDEs

We provide a general ansatz for the paracontrolled approach introduced by Gubinelli, Imkeller, Perkowski for treating singular SPDEs. The ansatz proposed covers a large class of equations. It is described via decorated trees that encode its coefficients and its stochastic data. The main novelty is the recursive definition of the paracontrolled stochastic iterated integrals that involve a well-chosen combinatorial set of words. The paralinearisation is performed via a lift of iterated paraproducts to modelled distributions and the reconstruction theorem coming from Regularity Structures. We also provide a fixed point argument and the renormalised equation with this ansatz when one uses the preparation map formalism that encompasses the BPHZ renormsalition. The last main result is the convergence of the renormalised stochastic data via the BPHZ renormalisation via an adaptation of the spectral gap approach. One obtains in the end a general solution theory for parabolic singular SPDEs via the paracontrolled approach.

math.PR↗

arXiv2026

Kruskal-style algorithm for cubic Schr\"odinger equation molecule reduction

We are interested in the molecule reduction algorithm introduced by Deng and Hani. They use this algorithm to establish a rigidity theorem, which plays a central role in the kinetic-time derivation of the wave equation associated with the cubic Schr\"odinger equation. In the present article, we show that this algorithm is a graph traversal algorithm of Kruskal type, and we prove that it constructs a Kruskal spanning tree of the input molecule. This reveals the origin of the main tool for deriving kinetic equations which has also been used for the long time derivation of the Boltzmann equation.

math.AP↗

arXiv2026

Recentering with Malliavin derivative

We provide an algebraic unification of the spectral gap proofs of the convergence of the renormalised model for regularity structures. We show that the key recentering map used in the literature for adjusting the recentering of the model is given via equivalent characterisations.

math.PR↗

arXiv2026

Banach fixed point and flow approach for rough analysis

In this paper, we show that the main algebraic assumption required to perform a fixed point argument for rough differential equations implies the algebraic assumption for the Bailleul flow approach. This assumption requires that the rough path associated with the equation is given by a Hopf algebra whose coproduct admits a cocycle and has a tree-like basis. We show that the Hopf algebra of multi-indices does not satisfy the cocycle condition. This is a rigorous result on the impossibility, observed in practice, of performing a fixed point argument for multi-indices rough paths and multi-indices in Regularity Structures.

math.PR↗

arXiv2025

Derivation of resonance-based schemes via normal forms

In this work, we propose a systematic derivation of resonance-based schemes via normal forms. The main idea is to use an arborification map on decorated trees together with a Butcher-Connes-Kreimer type coproduct and lower-dominant parts decompositions of the Fourier operator coming from the nonlinear interactions. This new family of low regularity schemes has explicit formulae for its coefficients and its local error. Under a mild assumption, one could expect these schemes to have a similar local error as the low regularity schemes proposed in arXiv:2005.01649.

math.NA↗

arXiv2025

Elementary differentials from multi-indices to rooted trees

Rooted trees are essential for describing numerical schemes via the so-called B-series. They have also been used extensively in rough analysis for expanding solutions of singular Stochastic Partial Differential Equations (SPDEs). When one considers scalar-valued equations, the most efficient combinatorial set is multi-indices. In this paper, we investigate the existence of intermediate combinatorial sets that will lie between multi-indices and rooted trees. We provide a negative result stating that there is no combinatorial set encoding elementary differentials in dimension $d\neq 1$, and compatible with the rooted trees and the multi-indices aside from the rooted trees. This does not close the debate of the existence of such combinatorial sets, but it shows that it cannot be obtained via a naive and natural approach.

math.NA↗

arXiv2025

Birkhoff normal form via decorated trees

We derive an explicit tree based ansatz for the Birkhoff normal form up to any order in the context of Hamiltonian PDEs. To do so we make use of a tree based representation of iterated Poisson brackets to encode the nested Taylor expansions along flows of a sequence of symplectic transformations. As an example we consider the cubic Schr\"odinger equation.

math.AP↗

arXiv2025

Post-Lie deformations of pre-Lie algebras and their applications in Regularity Structures

In this paper, we study post-Lie deformations of a pre-Lie algebra, namely deforming a pre-Lie algebra into a post-Lie algebra. We construct the differential graded Lie algebra that governs post-Lie deformations of a pre-Lie algebra. We also develop the post-Lie cohomology theory for a pre-Lie algebra, by which we classify infinitesimal post-Lie deformations of a pre-Lie algebra using the second cohomology group. The rigidity of such kind of deformations is also characterized using the second cohomology group. Finally, we apply this deformation theory to Regularity Structures. We prove that the post-Lie algebraic structure on the decorated trees which appears spontaneously in Regularity Structures is a post-Lie deformation of a pre-Lie algebra.

math.RA↗

arXiv2025

Resonances and computations

The computation of time dynamics arising in nonlinear time-dependent partial differential equations is an ongoing challenge in numerical analysis, especially once roughness comes into play. Classical numerical schemes in general fail to resolve the oscillatory behaviour in the solution which leads to numerical instabilities and loss of convergence. Dispersive equations, e.g., nonlinear Schr\"odinger, Korteweg--de Vries and wave equations, thereby pose in particular a big problem as in contrast to the parabolic setting, no strong smoothing can be expected, i.e., if the initial data is rough, the solution stays rough which makes their approximation a delicate task. In this review we give an overview on a new numerical ansatz which aims to tackle the time dynamics of nonlinear dispersive partial differential equations even for very rough data. This is achieved by a resonance analysis and decorated tree formalism that draws its inpiration from the combinatorics used in the theory of regularity structures for solving singular SPDEs. One can hope to see this formalism applied in other contexts for dispersive PDEs and beyond.

math.NA↗

arXiv2025

Renormalisation in the flow approach for singular SPDEs

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 recursive way, in the sense of the trees, via local extractions introduced for regularity structures. We derive the renormalised equation from this ansatz and show that the renormalisation scheme is identical to that appearing in the context of regularity structures, thus matching the BPHZ renormalisation.

math.PR↗

arXiv2025

Flows driven by multi-indices Rough Paths

In this work, we introduce a solution theory for scalar-valued rough differential equations driven by multi-indices rough paths. To achieve this task, we will show how the flow approach using the log-ODE method introduced by Bailleul fits perfectly in this setting. In addition, we also describe the action of the translation of multi-indices rough paths at the level of rough differential equations.

math.PR↗

arXiv2025

Renormalising Feynman diagrams with multi-indices

In this work, we provide a method to obtain the renormalised measure in quantum field theory directly from the renormalisation of the expansion of the original measure. Our approach is based on BPHZ renormalisation via multi-indices, a combinatorial structure extremely successful for describing scalar-valued singular SPDEs. We propose the multi-indices counterpart to the Hopf algebraic program initiated by Connes and Kreimer for the renormalisation of Feynman diagrams. This new Hopf algebra also bridges the gap between the analysis of "pre-Feynman diagrams" and traditional diagrammatic methods. The construction relies on a well-chosen extraction-contraction coproduct of multi-indices equipped with a correct symmetry factor. We illustrate our method by the $ \Phi^4 $ measure example.

math-ph↗

arXiv2024

Cancellations for dispersive PDEs with random initial data

In this work, we provide a combinatorial formalism for dealing with the cancellations that have appeared recently in the context of dispersive PDEs with random initial data. The main idea is to transform iterated integrals encoded by decorated trees into words via an arborification map. This provides a formalism alternative to the one of molecules introduced by Deng and Hani (2023). It allows us to compute the cancellations coming from Wave turbulence and the proof of the invariance of the Gibbs measure under the dynamics of the three-dimensional cubic wave equation.

math.AP↗

arXiv2024

Low regularity symplectic schemes for stochastic NLS

We introduce a class of symplectic resonance based schemes for Schr\"odinger's equation in dimension one, building on the work in [1] wherein resonance based numerical schemes were developed in the context of dispersive PDE driven by time dependent, or space-time dependent, coloured noise. We work primarily with a cubic nonlinearity, advancing the approach introduced in [15] for deriving symplectic schemes in the deterministic setting. As an example of such a scheme we derive the resonance based midpoint rule for the Stochastic NLS and analyse its convergence properties.

math.AP↗

arXiv2024

Symmetries for the gKPZ equation via multi-indices

In this work, we study the two main symmetries for the one-dimensional generalised KPZ equation (gKPZ): the chain rule and the It\^o Isometry. We consider the equation in the full-subcritical regimes and use multi-indices that avoid an over-parametrization of the renormalised equation to compute the dimension of the two spaces associated with these two symmetries. Our proof is quite elementary and shows that multi-indices provide in this case a simplification in comparison to the results obtained via decorated trees. It also completes the program on the study of the chain rule initiated in arxiv:1902.02884 and continued in arxiv:2403.17066.

math.PR↗

arXiv2024

Derivation of normal forms for dispersive PDEs via arborification

In this work, we propose a systematic derivation of normal forms for dispersive equations using decorated trees introduced in arXiv:2005.01649. The key tool is the arborification map which is a morphism from the Butcher-Connes-Kreimer Hopf algebra to the Shuffle Hopf algebra. It originates from Ecalle's approach to dynamical systems with singularities. This natural map has been used in many applications ranging from algebra, numerical analysis and rough paths. This connection shows that Hopf algebras also appear naturally in the context of dispersive equations and provide insights into some crucial decomposition.

math.AP↗