Related papers: Computing the $p$-Laplacian eigenpairs of signed g…
We consider a non self-adjoint Laplacian on a directed graph with non symmetric edge weights. We give necessary conditions for this Laplacian to be sectorial. We introduce a special self-adjoint operator and compare its essential spectrum…
Spectral hypergraph theory has recently attracted considerable interest as it provides a natural framework for modeling higher-order relationships beyond classical graphs. In this setting, eigenvalues of adjacency, Laplacian, and…
We discuss Neumann problems for self-adjoint Laplacians on (possibly infinite) graphs. Under the assumption that the heat semigroup is ultracontractive we discuss the unique solvability for non-empty subgraphs with respect to the vertex…
In this article we study the well-posedness (uniqueness and existence of solutions) of nonlinear elliptic Partial Differential Equations (PDEs) on a finite graph. These results are obtained using the discrete comparison principle and…
To address the peculiarities of directed and/or signed graphs, new Laplacian operators have emerged. For instance, in the case of directionality, we encounter the magnetic operator, dilation (which is underexplored), operators based on…
A divide-and-conquer based approach for computing the Moore-Penrose pseudo-inverse of the combinatorial Laplacian matrix $(\bb L^+)$ of a simple, undirected graph is proposed. % The nature of the underlying sub-problems is studied in detail…
We discuss how graph expansion is related to the behavior of $L^{p}$-functions on the covering tree. We show that the non-trivial eigenvalues of the adjacency operator on aa $(q+1)$-regular graph are bounded by $q^{1/p}+q^{(p-1)/p}$ - the…
In this paper, we develop a cascadic multigrid algorithm for fast computation of the Fiedler vector of a graph Laplacian, namely, the eigenvector corresponding to the second smallest eigenvalue. This vector has been found to have…
The Laplacian matrix of a graph $G$ is denoted by $L(G)=D(G)-A(G)$, where $D(G)=diag(d(v_{1}),\ldots , d(v_{n}))$ is a diagonal matrix and $A(G)$ is the adjacency matrix of $G$. Let $G_1$ and $G_2$ be two graphs. A one-edge connection of…
In this note, we use eigenvalue interlacing to derive an inequality between the maximum degree of a graph and its maximum and minimum adjacency eigenvalues. The case of equality is fully characterized.
We consider families of finite quantum graphs of increasing size and we are interested in how eigenfunctions are distributed over the graph. As a measure for the distribution of an eigenfunction on a graph we introduce the entropy, it has…
The problem that we would like to solve in this paper is to compute the edge p-Laplacian centrality for the air traffic network. In this problem, instead of computing the edge p-Laplacian centrality directly which is the very hard problem,…
Because of the significant increase in size and complexity of the networks, the distributed computation of eigenvalues and eigenvectors of graph matrices has become very challenging and yet it remains as important as before. In this paper…
Hypergraphs extend traditional graphs by enabling the representation of N-ary relationships through higher-order edges. Akin to a common approach of deriving graph Laplacians, we define function spaces and corresponding symmetric products…
This paper studies the Laplacian spectrum and the average effective resistance of (large) graphs that are sampled from graphons. Broadly speaking, our main finding is that the Laplacian eigenvalues of a large dense graph can be effectively…
This paper lies in the intersection of several fields: number theory, lattice theory, multilinear algebra, and scientific computing. We adapt existing solution algorithms for tensor eigenvalue problems to the tensor-train framework. As an…
This paper surveys some recent results and progress on the extremal prob- lems in a given set consisting of all simple connected graphs with the same graphic degree sequence. In particular, we study and characterize the extremal graphs…
Motivated by the work of P. Lindqvist, we study eigenfunctions of the one-dimensional $p$-Laplace operator, the $\sin_p$ functions, and prove several inequalities for these and $p$-analogues of other trigonometric functions and their…
Threshold graphs are generated from one node by repeatedly adding a node that links to all existing nodes or adding a node without links. In the weighted threshold graph, we add a new node in step $i$, which is linked to all existing nodes…
A graph is called "Laplacian integral" if the eigenvalues of its Laplacian matrix are all integers. We investigate the subset of these graphs whose Laplacian is furthermore diagonalized by a matrix with entries coming from a fixed set, in…