Related papers: The BPHZ Theorem for Regularity Structures via the…
In Bayesian learning of Gaussian graphical model structure, it is common to restrict attention to certain classes of graphs and approximate the posterior distribution by repeatedly moving from one graph to another, using MCMC or methods…
It is proved that classical BRS-invariance of the Lagrangian implies perturbative gauge invariance for tree diagrams to all orders. The proof applies in particular to the Einstein Hilbert Largrangian of gravity.
Knots are commonly represented and manipulated via diagrams, which are decorated planar graphs. When such a knot diagram has low treewidth, parameterized graph algorithms can be leveraged to ensure the fast computation of many invariants…
We prove that every oriented tree on $n$ vertices with bounded maximum degree appears as a spanning subdigraph of every directed graph on $n$ vertices with minimum semidegree at least $n/2+o(n)$. This can be seen as a directed graph…
In this paper, we study the higher regularity theory of a mixed-type parabolic problem. We extend the recent work of \cite{DMR} to construct solutions that have an arbitrary number of derivatives in Sobolev spaces. To achieve this, we…
We prove the Poisson geometric version of the Local Reeb Stability (from foliation theory) and of the Slice Theorem (from equivariant geometry). The result is also a generalization of Conn's linearization theorem from one-point leaves to…
We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…
Belief propagation (BP) is an iterative method to perform approximate inference on arbitrary graphical models. Whether BP converges and if the solution is a unique fixed point depends on both the structure and the parametrization of the…
We provide a degree condition on a regular $n$-vertex graph $G$ which ensures the existence of a near optimal packing of any family $\mathcal H$ of bounded degree $n$-vertex $k$-chromatic separable graphs into $G$. In general, this degree…
Recently, bipath persistent homology has been proposed as an extension of standard persistent homology, along with its visualization (bipath persistence diagram) and computational methods. In the setting of standard persistent homology, the…
For a connected graph $G$, a spanning tree $T$ of $G$ is called a homeomorphically irreducible spanning tree (HIST) if $T$ has no vertices of degree 2. Albertson {\em et al.} proved that it is $NP$-complete to decide whether a graph…
We study the long-time behaviour of the growth-fragmentation equation, a nonlocal linear evolution equation describing a wide range of phenomena in structured population dynamics. We show the existence of a spectral gap under conditions…
In this paper, we prove that infinitesimal automorphisms of an involutive structure are smooth. For this, we build a regularity theory for sections of vector bundles over an involutive structure $(M,V)$ endowed with a connection compatible…
We obtain Lipschitz regularity results for a fairly general class of nonlinear first-order PDEs. These equations arise from the inner variation of certain energy integrals. Even in the simplest model case of the Dirichlet energy the…
The aim of this paper is to show that Besser syntomic cohomology is representable by a rational ring spectrum in the motivic homotopical sense. In fact, extending previous constructions, we exhibit a simple representability criterion and we…
In a recent paper, Chernikov and Starchenko prove that graphs defined in distal theories have strong regularity properties, generalizing previous results about graphs defined by semi-algebraic relations. We give a shorter, purely…
Cobham's theorem asserts that if a sequence is automatic with respect to two multiplicatively independent bases, then it is ultimately periodic. We prove a stronger density version of the result: if two sequences which are automatic with…
In this paper, we characterize the topological support in Holder norm of the law of the solution to a stochastic wave equation with three-dimensional space variable is proved. This note is a continuation of [9] and [10]. The result is a…
Lipschitz continuity of algorithms, introduced by Kumabe and Yoshida (FOCS'23), measures the stability of an algorithm against small input perturbations. Algorithms with small Lipschitz continuity are desirable, as they ensure reliable…
We show that variants of the classical reflection functors from quiver representation theory exist in any abstract stable homotopy theory, making them available for example over arbitrary ground rings, for quasi-coherent modules on schemes,…