Related papers: Cancellations for dispersive PDEs with random init…
We introduce a new class of numerical schemes which allow for low regularity approximations to the expectation $ \mathbb{E}(|u_{k}(\tau, v^{\eta})|^2)$, where $u_k$ denotes the $k$-th Fourier coefficient of the solution $u$ of the…
In this article, we calculate the mean throughput, number of collisions, successes, and idle slots for random tree algorithms with successive interference cancellation. Except for the case of the throughput for the binary tree, all the…
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…
We investigate the number of permutations that occur in random labellings of trees. This is a generalisation of the number of subpermutations occurring in a random permutation. It also generalises some recent results on the number of…
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…
Decision trees are a popular family of models due to their attractive properties such as interpretability and ability to handle heterogeneous data. Concurrently, missing data is a prevalent occurrence that hinders performance of machine…
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…
We introduce a general framework of low regularity integrators which allows us to approximate the time dynamics of a large class of equations, including parabolic and hyperbolic problems, as well as dispersive equations, up to arbitrary…
We extend the dipole formalism for massless and massive partons to random polarisations of the external partons. The dipole formalism was originally formulated for spin-summed matrix elements and later extended to individual helicity…
In this work, we adopt a general framework based on the Gibbs posterior to update belief distributions for inverse problems governed by partial differential equations (PDEs). The Gibbs posterior formulation is a generalization of standard…
The computational complexity of time-dependent perturbation theory is well-known to be largely combinatorial whatever the chosen expansion method and family of parameters (combinatorial sequences, Goldstone and other Feynman-type…
An algorithmic method using conservation law multipliers is introduced that yields necessary and sufficient conditions to find invertible mappings of a given nonlinear PDE to some linear PDE and to construct such a mapping when it exists.…
We propose a general framework for obtaining probabilistic solutions to PDE-based inverse problems. Bayesian methods are attractive for uncertainty quantification but assume knowledge of the likelihood model or data generation process. This…
We resolve a question of Gillespie, Griffin, and Levinson that asks for a combinatorial bijection between two classes of trivalent trees, tournament trees and slide trees, that both naturally arise in the intersection theory of the moduli…
Let Q_0 denote the rational numbers expanded to a "meadow", that is, after taking its zero-totalized form (0^{-1}=0) as the preferred interpretation. In this paper we consider "cancellation meadows", i.e., meadows without proper zero…
The processes of production and subsequent decay of W- and Z-bosons in $e^+ e^-$ collisions are considered in a recently proposed modified perturbation theory (PT), based on a direct expansion of probabilities instead of amplitudes. In such…
We consider finite range Gibbs fields and provide a purely combinatorial proof of the exponential tree decay of semi--invariants, supposing that the logarithm of the partition function can be expressed as a sum of suitable local functions…
We propose a framework for the derivation and evaluation of distributed iterative algorithms for receiver cooperation in interference-limited wireless systems. Our approach views the processing within and collaboration between receivers as…
We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…
Natural language semantics has recently sought to combine the complementary strengths of formal and distributional approaches to meaning. More specifically, proposals have been put forward to augment formal semantic machinery with…