Related papers: On nonlocal minimal graphs
We discuss a variational approach to the length functional and its relation to sub-Hamiltonian equations on sub-Finsler manifolds. Then, we introduce the notion of the nonholonomic sub-Finslerian structure and prove that the distributions…
We give a survey on graphs with fixed smallest eigenvalue, especially on graphs with large minimal valency and also on graphs with good structures. Our survey mainly consists of the following two parts: (i) Hoffman graphs, the basic theory…
This paper studies observability for non-uniform hypergraphs with inputs and outputs. To capture higher-order interactions, we define a canonical non-homogeneous dynamical system with nonlinear outputs on hypergraphs. We then construct…
We study the problem of few-shot graph classification across domains with nonequivalent feature spaces by introducing three new cross-domain benchmarks constructed from publicly available datasets. We also propose an attention-based graph…
We present in a unified setting the foundations for a theory of non-bilinear Dirichlet functionals on Hilbert spaces. We prove known and new equivalences between non-linear semigroups, non-linear resolvents, non-linear generators, and their…
Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumption and generalize the analysis of graph Laplacians to include…
A visualized graph is a powerful tool for data analysis and synthesis tasks. In this case, the task of visualization constitutes not only in displaying vertices and edges according to the graph representation, but also in ensuring that the…
We study some semi-linear equations for the $(m,p)$-Laplacian operator on locally finite weighted graphs. We prove existence of weak solutions for all $m\in\mathbb{N}$ and $p\in(1,+\infty)$ via a variational method already known in the…
We prove the removable singularity theorem for nonlocal minimal graphs. Specifically, we show that any nonlocal minimal graph in $\Omega \setminus K$, where $\Omega \subset \mathbb{R}^n$ is an open set and $K \subset \Omega$ is a compact…
We show that there is a system of 14 non-trivial finitary functions on the random graph with the following properties: Any non-trivial function on the random graph generates one of the functions of this system by means of composition with…
We compare ground states for the nonlinear Schr\"odinger equation on metric graphs, defined as global minimizers of the action functional constrained on the Nehari manifold, and least action solutions, namely minimizers of the action among…
We present a provably more efficient implementation of the Minimum Norm Point Algorithm conceived by Fujishige than the one presented in \cite{FUJI06}. The algorithm solves the minimization problem for a class of functions known as…
Local minimizers of integral functionals of the calculus of variations are analyzed under growth conditions dictated by different lower and upper bounds for the integrand. Growths of non-necessarily power type are allowed. The local…
In this paper, we study some functional inequalities (such as Poincar\'e inequalities, logarithmic Sobolev inequalities, generalized Cheeger isoperimetric inequalities, transportation-information inequalities and transportation-entropy…
Finding structural similarities in graph data, like social networks, is a far-ranging task in data mining and knowledge discovery. A (conceptually) simple reduction would be to compute the automorphism group of a graph. However, this…
We consider Gallai's graph Modular Decomposition theory for network analytics. On the one hand, by arguing that this is a choice tool for understanding structural and functional similarities among nodes in a network. On the other, by…
Motivated by a geometric problem, we introduce a new non-convex graph partitioning objective where the optimality criterion is given by the sum of the Dirichlet eigenvalues of the partition components. A relaxed formulation is identified…
As relational datasets modeled as graphs keep increasing in size and their data-acquisition is permeated by uncertainty, graph-based analysis techniques can become computationally and conceptually challenging. In particular, node centrality…
This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…
Formation of a molecular network from multifunctional precursors is modelled with a random graph process. The random graph model favours reactivity for monomers that are positioned close in the network topology, and disfavours reactivity…