Related papers: On nonlocal minimal graphs
In this paper, we investigate the minimization of a functional in which the usual perimeter is competing with a nonlocal singular term comparable (but not necessarily equal to) a fractional perimeter. The motivation for this problem is a…
We define a class of spaces on which one may generalise the notion of compactness following motivating examples from higher-dimensional number theory. We establish analogues of several well-known topological results (such as Tychonoff's…
We approximate functionals depending on the gradient of $u$ and on the behaviour of $u$ near the discontinuity points, by families of non-local functionals where the gradient is replaced by finite differences. We prove pointwise…
In this paper, a new class of hemivariational inequalities is introduced. It concerns Laplace operator on locally finite graphs together with multivalued nonmonotone nonlinearities expressed in terms of Clarke's subdifferential. First of…
Theoretical analyses for graph learning methods often assume a complete observation of the input graph. Such an assumption might not be useful for handling any-size graphs due to the scalability issues in practice. In this work, we develop…
Motivated by applications in data science, we study partial differential equations on graphs. By a classical fixed-point argument, we show existence and uniqueness of solutions to a class of nonlocal continuity equations on graphs. We…
In this paper, we introduce a functional and a geometric setting for an obstacle problem for nonlocal minimal graphs. In particular we study existence of solutions, a priori estimates, and we prove the equivalence of the two settings. We…
We study energy functionals obtained by adding a possibly discontinuous potential to an interaction term modeled upon a Gagliardo-type fractional seminorm. We prove that minimizers of such non-differentiable functionals are locally bounded,…
We study a nonlocal perimeter functional inspired by the Minkowski content, whose main feature is that it interpolates between the classical perimeter and the volume functional. This problem is related by a generalized coarea formula to a…
We consider the problem of minimizing the number of triangles in a graph of given order and size and describe the asymptotic structure of extremal graphs. This is achieved by characterizing the set of flag algebra homomorphisms that…
In this paper we introduce the functional centrality as a generalization of the subgraph centrality. We propose a general method for characterizing nodes in the graph according to the number of closed walks starting and ending at the node.…
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…
We present an algorithm based on continuation techniques that can be applied to solve numerically minimization problems with equality constraints. We focus on problems with a great number of local minima which are hard to obtain by local…
Nonlocal metric dimension ${\rm dim}_{\rm n\ell}(G)$ of a graph $G$ is introduced as the cardinality of a smallest nonlocal resolving set, that is, a set of vertices which resolves each pair of non-adjacent vertices of $G$. Graphs $G$ with…
The work is devoted to the construction of a new type of intervals -- functional intervals. These intervals are built on the idea of expanding boundaries from numbers to functions. Functional intervals have shown themselves to be promising…
We introduce an abstract framework for the study of clustering in metric graphs: after suitably metrising the space of graph partitions, we restrict Laplacians to the clusters thus arising and use their spectral gaps to define several…
Entropy functionals (i.e. convex integral functionals) and extensions of these functionals are minimized on convex sets. This paper is aimed at reducing as much as possible the assumptions on the constraint set. Dual equalities and…
We study $H^1$ versus $C^1$ local minimizers for functionals defined on spaces of symmetric functions, namely functions that are invariant by the action of some subgroups of $\mathcal{O}(N)$. These functionals, in many cases, are associated…
We introduce a generalized similarity analysis which grants a qualitative description of the localised solutions of any nonlinear differential equation. This procedure provides relations between amplitude, width, and velocity of the…
Local sets, a graph structure invariant under local complementation, have been originally introduced in the context of quantum computing for the study of quantum entanglement within the so-called graph state formalism. A local set in a…