Related papers: Pseudofinite proofs of the stable graph regularity…
This paper addresses the analysis and numerical assessment of a computational method for solving the Cahn--Hilliard equation defined on a surface. The proposed approach combines the stabilized trace finite element method for spatial…
We present an abstract concept for the error analysis of numerical schemes for semilinear stochastic partial differential equations (SPDEs) and demonstrate its usefulness by proving the strong convergence of a Milstein-Galerkin finite…
In this paper we analyze the practical implications of Szemer\'edi's regularity lemma in the preservation of metric information contained in large graphs. To this end, we present a heuristic algorithm to find regular partitions. Our…
We consider the problem of learning a graph from a finite set of noisy graph signal observations, the goal of which is to find a smooth representation of the graph signal. Such a problem is motivated by the desire to infer relational…
We consider a generic algorithmic paradigm that we call progressive exploration, which can be used to develop simple and efficient parameterized graph algorithms. We identify two model-theoretic properties that lead to efficient progressive…
We apply concepts from manifold regularization to develop new regularization techniques for training locally stable deep neural networks. Our regularizers are based on a sparsification of the graph Laplacian which holds with high…
We show that stochastically continuous, time-homogeneous affine processes on the canonical state space $\Rplus^m \times \RR^n$ are always regular. In the paper of \citet{Duffie2003} regularity was used as a crucial basic assumption. It was…
We introduce a new concept of Hyers-Ulam stability, in which in the size of a pseudosolution of a given ordinary differential equation and its deviation from an exact solution are measured with respect to different norms. These norms are…
Szemeredi's regularity lemma can be viewed as a rough structure theorem for arbitrary dense graphs, decomposing such graphs into a structured piece (a partition into cells with edge densities), a small error (corresponding to irregular…
In this paper we focus on nonlinear SPDEs with singularities included in both drift and noise coefficients, for which the Gelfand-triple argument developed for (local) monotone SPDEs turns out to be invalid. We propose a general framework…
The stability method is very useful for obtaining exact solutions of many extremal graph problems. Its key step is to establish the stability property which, roughly speaking, states that any two almost optimal graphs of the same order $n$…
We consider the Dynamical Low Rank (DLR) approximation of random parabolic equations and propose a class of fully discrete numerical schemes. Similarly to the continuous DLR approximation, our schemes are shown to satisfy a discrete…
We generalize several schedule matching theorems of Baiou-Balinski (Math. Oper. Res., 27 (2002), 485) and Alkan-Gale (J. Econ. Th. 112 (2003), 289) by applying a fixed point method of Fleiner (Math. Oper. Res., 28 (2003), 103). Thanks to a…
The paper presents methods of eigenvalue localisation of regular matrix polynomials, in particular, stability of matrix polynomials is investigated. For this aim a stronger notion of hyperstability is introduced and widely discussed. Matrix…
We address the problem of reasoning on graph transformations featuring actions such as \emph{addition} and \emph{deletion} of nodes and edges, node \emph{merging} and \emph{cloning}, node or edge \emph{labelling} and edge…
We introduce a notion of "local stability in permutations" for finitely generated groups. If a group is sofic and locally stable in our sense, then it is also locally embeddable into finite groups (LEF). Our notion is weaker than the…
Komlos [Komlos: Tiling Turan Theorems, Combinatorica, 2000] determined the asymptotically optimal minimum-degree condition for covering a given proportion of vertices of a host graph by vertex-disjoint copies of a fixed graph H, thus…
We study the computational problem of the stationarity test for the empirical loss of neural networks with ReLU activation functions. Our contributions are: Hardness: We show that checking a certain first-order approximate stationarity…
We develop foundational aspects of stability theory in affine logic. On the one hand, we prove appropriate affine versions of many classical results, including definability of types, existence of non-forking extensions, and other…
The Deligne-Mumford stable reduction theorem asserts that for a family of stable curves over the punctured disk, after a finite base change, the family can be completed in a unique way to a family of stable curves over the disk. In this…