Related papers: On strict proto-differentiability of set-valued ma…
A graph is well-(edge-)dominated if every minimal (edge) dominating set is minimum. A graph is equimatchable if every maximal matching is maximum. We study these concepts on strong product graphs. We fully characterize well-edge-dominated…
In this paper, we revisit a well-known distributed projected subgradient algorithm which aims to minimize a sum of cost functions with a common set constraint. In contrast to most of existing results, weight matrices of the time-varying…
Modeling functions that are sequentially observed as functional time series is becoming increasingly common. In such models, it is often crucial to ensure data homogeneity. We investigate the sensitivity of graph-based change point…
A pre-Schwarzian and a Schwarzian derivative for locally univalent pluriharmonic mappings in ${\mathbb C}^n$ are introduced. Basic properties such as the chain rule, multiplicative invariance and affine invariance are proved for these…
We give complete and exact descriptions of spaces of ultradifferentiable functions that are closed under composition with either holomorphic or ultradifferentiable functions -- which are two distinct cases. The proof works by considering…
It is well-known that differentiation of hypergeometric function multiplied by a certain power function yields another hypergeometric function with a different set of parameters. Such differentiation identities for hypergeometric functions…
A weak and a strong concept of plurifinely plurisubharmonic and plurifinely holomorphic functions are introduced. Strong will imply weak. The weak concept is studied further. A function f is weakly plurifinely plurisubharmonic if and only…
In this paper, we study relative metric regularity of set-valued mappings with emphasis on directional metric regularity. We establish characterizations of relative metric regularity without assuming the completeness of the image spaces, by…
The subdifferential of a function is a generalization for nonsmooth functions of the concept of gradient. It is frequently used in variational analysis, particularly in the context of nonsmooth optimization. The present work proposes…
We study the problem of learning features through self-supervision that are generalisable to multiple graphs. State-of-the-art graph self-supervision restricts training to only one graph, resulting in graph-specific models that are…
Given a graph $G$, a subgraph $H$ is isometric if $d_H(u,v) = d_G(u,v)$ for every pair $u,v\in V(H)$, where $d$ is the distance function. A graph $G$ is distance preserving (dp) if it has an isometric subgraph of every possible order. A…
Given a function on diagonal matrices, there is a unique way to extend this to an invariant (by conjugation) function on symmetric matrices. We show that the extension preserves regularity -- that is, if the original function is k times…
In skew-product systems with contractive factors, all orbits asymptotically approach the graph of the so-called sync function; hence, the corresponding regularity properties primarily matter. In the literature, sync function Lipschitz…
We study the approximation of nonlinear operators between function spaces by transformers. Our approach is to lift functions to measures supported on their graphs and leverage a recently introduced measure-theoretic view of transformers. A…
For the numerical solution of nonsmooth problems, sometimes it is not necessary that an exact subgradient/generalized Jacobian is at our disposal, but it suffices that a semismooth derivative, i.e., a mapping satisfying a certain…
Multilevel modeling extends traditional modeling techniques with a potentially unlimited number of abstraction levels. Multilevel models can be formally represented by multilevel typed graphs whose manipulation and transformation are…
Graphs are used in almost every scientific discipline to express relations among a set of objects. Algorithms that compare graphs, and output a closeness score, or a correspondence among their nodes, are thus extremely important. Despite…
The article is devoted to approximate, global and along curves differentiability of functions over non-archimedean infinite fields with non-trivial valuations. Fields with zero and non-zero characteristics are considered. Spaces of…
A graph G is said to be 2-distinguishable if there is a 2-labeling of its vertices which is not preserved by any nontrivial automorphism of G. We show that every locally finite graph with infinite motion and growth at most…
Conjecturally, almost all graphs are determined by their spectra. This problem has also been studied for variants such as the spectra of the Laplacian and signless Laplacian. Here we consider the problem of determining graphs with Ihara and…