Related papers: First order operators on shrinking graph-like spac…

The paper is devoted to establishing relationships between global and local monotonicity, as well as their maximality versions, for single-valued and set-valued mappings between finite-dimensional and infinite-dimensional spaces. We first…

We consider the problem of minimizing a differentiable function with locally Lipschitz continuous gradient on a stratified set and present a first-order algorithm designed to find a stationary point of that problem. Our assumptions on the…

Let X be a finite graph. Let E be the number of its edges and d be its degree. Denote by F_1(X) its first spectral density function which counts the number of eigenvalues less or equal to lambda^2 of the associated Laplace operator. We…

To each graph on $n$ vertices there is an associated subspace of the $n \times n$ matrices called the operator system of the graph. We prove that two graphs are isomorphic if and only if their corresponding operator systems are unitally…

For some geometric graph classes, tractability of testing first-order formulas is precisely characterised by the graph parameter twin-width. This was first proved for interval graphs among others in [BCKKLT, IPEC '22], where the equivalence…

In this article, in order to the minimal operator generated by the first-order differential-operator expression in the weighted Hilbert space of vector functions in the finite interval to be formal normal, the relationship between the…

In this paper, we investigate asymptotics of the continuous graph Laplace operator on a smooth Riemannian manifold $(M,g)$ admitting an isolated singularity $x$. We show that if the curvature function $\kappa$ doesn't grow too fast near…

We introduce the weighted graph Laplacian and the notion of Schr\"odinger operator on a locally finite weighted graph. Concerning essential self-adjointness, we extend Wojciechowski's and Dodziuk's results for graphs with vertex constant…

Kelner, Orecchia, Sidford, and Zhu have given a randomized iterative method for approximating the solution to the discrete Laplace equation that has expected running time nearly linear in the size of the problem. The goal of this note is to…

We discuss conformally covariant differential operators, which under local rescalings of the metric, \delta_\sigma g^{\mu\nu} = 2 \sigma g^{\mu\nu}, transform according to \delta_\sigma \Delta = r \Delta \sigma + (s-r) \sigma \Delta for…

We consider a countably generated and uniformly closed algebra of bounded functions. We assume that there is a lower semicontinuous, with respect to the supremum norm, quadratic form and that normal contractions operate in a certain sense.…

Given a length function on the edge set of a finite graph, we define a vertex-weight and an edge-weight in terms of it and consider the corresponding graph Laplacian. In this paper, we consider the problem of maximizing the first nonzero…

As graph representations of data emerge in multiple domains, data analysts need to be able to intelligently select among a magnitude of different data graphs based on the effects different graph operators have on them. Exhaustive execution…

The standard Laplace operator is a generalization of the Hodge Laplace operator on differential forms to arbitrary geometric vector bundles, alternatively it can be seen as generalization of the Casimir operator acting on sections of…

We study when the \emph{optimization curve} of first-order methods -- the sequence \${f(x\_n)}*{n\ge0}\$ produced by constant-stepsize iterations -- is convex, equivalently when the forward differences \$f(x\_n)-f(x*{n+1})\$ are…

We define morphological operators and filters for directional images whose pixel values are unit vectors. This requires an ordering relation for unit vectors which is obtained by using depth functions. They provide a centre-outward ordering…

We characterize the restrictions of first order Sobolev functions to regular subsets of a homogeneous metric space and prove the existence of the corresponding linear extension operator.

We explore the relationship between convex and subharmonic functions on discrete sets. Our principal concern is to determine the setting in which a convex function is necessarily subharmonic. We initially consider the primary notions of…

We obtain a simple formula for the first-order trace of a regular differential operator on a segment perturbated by a multiplication operator. The main analytic ingredient of the proof is an improvement of the Tamarkin equiconvergence…

Given a digraph, an ordering of its vertices defines a backedge graph, namely the undirected graph whose edges correspond to the arcs pointing backwards with respect to the order. The degreewidth of a digraph is the minimum over all…