Related papers: On the Weisfeiler algorithm of depth-$1$ stabiliza…

Knowledge graphs, modeling multi-relational data, improve numerous applications such as question answering or graph logical reasoning. Many graph neural networks for such data emerged recently, often outperforming shallow architectures.…

Stars' chemical signatures provide invaluable insights into stellar cluster formation. This study utilized the Weisfeiler-Lehman (WL) Graph Kernel to examine a 15-dimensional elemental abundance space. Through simulating chemical…

We prove a multi-valued $C^{1,\alpha}$ regularity theorem for the varifolds in the class $\mathcal{S}_2$ (i.e., stable codimension one stationary integral $n$-varifolds admitting no triple junction classical singularities) which are…

Numerical analysis for linear constant-coefficients Finite Difference schemes was developed approximately fifty years ago. It relies on the assumption of scheme stability and in particular -- for the $L^2$ setting -- on the absence of…

This paper introduces and formally verifies a novel geometric framework for first-order stochastic dominance (FSD) in $N$ dimensions using the Lean 4 theorem prover. Traditional analytical approaches to multi-dimensional stochastic…

We present a simple proof for the benefit of depth in multi-layer feedforward network with rectified activation ("depth separation"). Specifically we present a sequence of classification problems indexed by $m$ such that (a) for any fixed…

We will study homological stability of the diffeomorphism groups of the manifolds $W_{g,1}:=D^{2n} \# (S^n \times S^n)^{\#g }$ using $E_k$-algebras. This will lead to new improvements in the stability results, especially when working with…

Deep ResNets are recognized for achieving state-of-the-art results in complex machine learning tasks. However, the remarkable performance of these architectures relies on a training procedure that needs to be carefully crafted to avoid…

Random walk kernels have been introduced in seminal work on graph learning and were later largely superseded by kernels based on the Weisfeiler-Leman test for graph isomorphism. We give a unified view on both classes of graph kernels. We…

We provide a proof of effective uniformization for nearly round 2-spheres, utilizing an identity related to the third-order differential of the conformal factor. This identity is connected to the geometry of the embedded spacelike surface…

We consider the complete Euler system describing the time evolution of an inviscid non-isothermal gas. We show that the rarefaction wave solutions of the 1D Riemann problem are stable, in particular unique, in the class of all bounded weak…

Leveled Homomorphic Encryption (LHE) offers a potential solution that could allow sectors with sensitive data to utilize the cloud and securely deploy their models for remote inference with Deep Neural Networks (DNN). However, this…

We develop a linearized boundary control method for the inverse boundary value problem of determining the damping coefficient in the damped wave equation. The objective is to reconstruct an unknown perturbation in a known background damping…

We show that a broad range of convex optimization algorithms, including alternating projection, operator splitting, and multiplier methods, can be systematically derived from the framework of subspace correction methods via convex duality.…

We show that bounded cohomology stabilizes along sequences of classical Lie groups, and along sequences of lattices in them. Our method is based on a criterion from (arXiv:2307.12808) which adapts Quillen's stability method to the setting…

In this paper, we introduce a novel non-linear uniform subdivision scheme for the generation of curves in $\mathbb{R}^n$, $n\geq2$. This scheme is distinguished by its capacity to reproduce second-degree polynomial data on non-uniform grids…

This work provides a characterization of the regularity of noncharacteristic intrinsic minimal graphs for a class of vector fields that includes non nilpotent Lie algebras as the one given by Euclidean motions of the plane. The main result…

It is proved that the Weisfeiler-Leman dimension of the class of permutation graphs is at most 18. Previously it was only known that this dimension is finite (Gru{\ss}ien, 2017).

In this paper, we revisit two fundamental results of the self-stabilizing literature about silent BFS spanning tree constructions: the Dolev et al algorithm and the Huang and Chen's algorithm. More precisely, we propose in the composite…

We prove that isomorphism of tournaments of twin width at most $k$ can be decided in time $k^{O(\log k)}n^{O(1)}$. This implies that the isomorphism problem for classes of tournaments of bounded or moderately growing twin width is in…