Related papers: Edge Laplacians and Edge Poisson Transforms for Gr…
This paper uses the theory of covering graphs to characterize some of the edge-transitive graphs which can arise as token graphs.
Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been…
The Dirac operator provides a unified framework for processing signals defined over different order topological domains, such as node and edge signals. Its eigenmodes define a spectral representation that inherently captures cross-domain…
Let $x : M \to E^m$ be an isometric immersion of a Riemannian manifold $M$ into a Euclidean $m$-space. Denote by $\Delta$ the Laplace operator of $M$. Then $\Delta$ gives rise to a differentiable map $L :M \to E^m$, called the Laplace map,…
We study operators on rooted graphs with a certain spherical homogeneity. These graphs are called path commuting and allow for a decomposition of the adjacency matrix and the Laplacian into a direct sum of Jacobi matrices which reflect the…
We study the discrete version of the $p$-Laplacian. Based on its variational properties we discuss some features of the associated parabolic problem. Our approach allows us in turn to obtain interesting information about positivity and…
Construction of graphs with equal eigenvalues (co-spectral graphs) is an interesting problem in spectral graph theory. Seidel switching is a well-known method for generating co-spectral graphs. From a matrix theoretic point of view, Seidel…
Laplacian eigenvectors capture natural community structures on graphs and are widely used in spectral clustering and manifold learning. The use of Laplacian eigenvectors as embeddings for the purpose of multiscale graph comparison has…
The spectral theory of graphs provides a bridge between classical signal processing and the nascent field of graph signal processing. In this paper, a spectral graph analogy to Heisenberg's celebrated uncertainty principle is developed.…
Given a natural number k and an orientable surface S of finite type, define the k-curve graph to be the graph with vertices corresponding to isotopy classes of essential simple closed curves on S and with edges corresponding to pairs of…
A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isometry) solution. In 2007, Jackson, Servatius and Servatius…
The discrete Laplace operator is ubiquitous in spectral shape analysis, since its eigenfunctions are provably optimal in representing smooth functions defined on the surface of the shape. Indeed, subspaces defined by its eigenfunctions have…
The integrals of motion of the classical two dimensional superintegrable systems with quadratic integrals of motion close in a restrained quadratic Poisson algebra, whose the general form is investigated. Each classical superintegrable…
We demonstrate that a large class of one-dimensional quantum and classical exchange models can be described by the same type of graphs, namely Cayley graphs of the permutation group. Their well-studied spectral properties allow us to derive…
A large class of supersymmetric quantum field theories, including all theories with $\mathcal{N} = 2$ supersymmetry in three dimensions and theories with $\mathcal{N} = 2$ supersymmetry in four dimensions, possess topological-holomorphic…
We initiate a systematic study of quantum properties of finite graphs, namely, quantum asymmetry, quantum symmetry, and quantum isomorphism. We define the Schmidt alternative for a class of graphs, which reveals to be a useful tool for…
We describe a technique to determine the automorphism group of a geometrically represented graph, by understanding the structure of the induced action on all geometric representations. Using this, we characterize automorphism groups of…
We consider the problem of finding universal bounds of "isoperimetric" or "isodiametric" type on the spectral gap of the Laplacian on a metric graph with natural boundary conditions at the vertices, in terms of various analytical and…
We report our experiments in identifying large bipartite subgraphs of simple connected graphs which are based on the sign pattern of eigenvectors belonging to the extremal eigenvalues of different graph matrices: adjacency, signless…
In this article, we introduce a geometric and a spectral preorder relation on the class of weighted graphs with a magnetic potential. The first preorder is expressed through the existence of a graph homomorphism respecting the magnetic…