Related papers: Hemivariational Inequalities on Graphs
We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…
This work is devoted to the study of the existence of at least one weak solution to nonlocal equations involving a general integro-differential operator of fractional type. As a special case, we derive an existence theorem for the…
We prove a nonlocal, nonlinear commutator estimate concerning the transfer of derivatives onto testfunctions. For the fractional $p$-Laplace operator it implies that solutions to certain degenerate nonlocal equations are higher…
In this paper, we establish new some Hermite-Hadamard's type inequalities of convex functions of 2-variables on the co-ordinates.
A digraph is semicomplete if any two vertices are connected by at least one arc and is locally semicomplete if the out-neighbourhood (resp. in-neighbourhood) of any vertex induces a semicomplete digraph. In this paper, we characterize all…
It is well-known that any solution of the Laplace equation is a real or imaginary part of a complex holomorphic function. In this paper, in some sense, we extend this property into four order hyperbolic and elliptic type PDEs. To be more…
Inspired by persistent homology in topological data analysis, we introduce the homological eigenvalues of the graph $p$-Laplacian $\Delta_p$, which allows us to analyse and classify non-variational eigenvalues. We show the stability of…
We prove a full Harnack inequality for local minimizers, as well as weak solutions to nonlocal problems with non-standard growth. The main auxiliary results are local boundedness and a weak Harnack inequality for functions in a…
Recently, there has been a strong ambition to translate models and algorithms from traditional image processing to non-Euclidean domains, e.g., to manifold-valued data. While the task of denoising has been extensively studied in the last…
In this paper, we study classes of discrete convex functions: submodular functions on modular semilattices and L-convex functions on oriented modular graphs. They were introduced by the author in complexity classification of minimum…
This paper proposes a local search algorithm for a specific combinatorial optimisation problem in graph theory: the Hamiltonian Completion Problem (HCP) on undirected graphs. In this problem, the objective is to add as few edges as possible…
Edge-homotopy and vertex-homotopy are equivalence relations on spatial graphs which are generalizations of Milnor's link-homotopy. We introduce some edge (resp. vertex)-homotopy invariants of spatial graphs by applying the Sato-Levine…
A multiscale numerical method is proposed for the solution of semi-linear elliptic stochastic partial differential equations with localized uncertainties and non-linearities, the uncertainties being modeled by a set of random parameters. It…
In this paper we investigate locally compact semitopological graph inverse semigroups. Our main result is the following: if a directed graph $E$ is strongly connected and contains a finite amount of vertices then a locally compact…
We consider the action of the (combinatorial) Laplacian of a finite and simple graph on integer vectors. By a \emph{Laplacian monopole} we mean an image vector negative at exactly one coordinate associated with a vertex. We consider a…
Variational inequalities, formulated on unknown dependent convex sets, are called quasi-variational inequalities (QVI). This paper is concerned with the abstract approach to a class of parabolic QVIs arising in many biochemical/mechanical…
The objective of this note is to provide an interpretation of the discrete version of Morse inequalities, following Witten's approach via supersymmetric quantum mechanics, adapted to finite graphs, as a particular instance of Morse-Witten…
We consider the fractional elliptic inequality with variable-exponent nonlinearity $$ (-\Delta)^{\frac{\alpha}{2}} u+\lambda\, \Delta u \geq |u|^{p(x)}, \quad x\in\mathbb{R}^N, $$ where $N\geq 1$, $\alpha\in (0,2)$, $\lambda\in\mathbb{R}$…
Fractional graph isomorphism is the linear relaxation of an integer programming formulation of graph isomorphism. It preserves some invariants of graphs, like degree sequences and equitable partitions, but it does not preserve others like…
The aim of the present paper is to analyse the spectrum of Laplace and Dirac type operators on metric graphs. In particular, we show for equilateral graphs how the spectrum (up to exceptional eigenvalues) can be described by a natural…