Related papers: Hearing Shapes via p-Adic Laplacians
Let $\Gamma=(G,\sigma)$ be a signed graph, where $\sigma$ is the sign function on the edges of $G$. In this paper, we use the operation of partial transpose to obtain non-isomorphic Laplacian cospectral signed graphs. We will introduce two…
We review the properties of eigenvectors for the graph Laplacian matrix, aiming at predicting a specific eigenvalue/vector from the geometry of the graph. After considering classical graphs for which the spectrum is known, we focus on…
Associative spectra of graph algebras are examined with the help of homomorphisms of DFS trees. Undirected graphs are classified according to the associative spectra of their graph algebras; there are only three distinct possibilities:…
Graph-based techniques and spectral graph theory have enriched the field of machine learning with a variety of critical advances. A central object in the analysis is the graph Laplacian L, which encodes the structure of the graph. We…
A matrix polynomial is a polynomial in a complex variable $\lambda$ with coefficients in $n \times n$ complex matrices. The spectral curve of a matrix polynomial $P(\lambda)$ is the curve $\{ (\lambda, \mu) \in \mathbb{C}^2 \mid…
We give a construction of a family of (weighted) graphs that are pairwise cospectral with respect to the normalized Laplacian matrix, or equivalently probability transition matrix. This construction can be used to form pairs of cospectral…
This paper deals with spectral graph theory issues related to questions of monotonicity and comparison of eigenvalues. We consider finite directed graphs with non symmetric edge weights and we introduce a special self-adjoint operator as…
We develop a new approach to the study of spectral asymmetry. Working with the operator $\operatorname{curl}:=*\mathrm{d}$ on a connected oriented closed Riemannian 3-manifold, we construct, by means of microlocal analysis, the asymmetry…
The Bridge graph is a special type of graph which are constructed by connecting identical connected graphs with path graphs. We discuss different types of bridge graphs $B_{n\times l}^{m\times k}$ in this paper. In particular, we discuss…
A propeller graph is obtained from an $\infty$-graph by attaching a path to the vertex of degree four, where an $\infty$-graph consists of two cycles with precisely one common vertex. In this paper, we prove that all propeller graphs are…
Feature learning in the presence of a mixed type of variables, numerical and categorical types, is an important issue for related modeling problems. For simple neighborhood queries under mixed data space, standard practice is to consider…
We give a method to construct cospectral graphs for the normalized Laplacian by a local modification in some graphs with special structure. Namely, under some simple assumptions, we can replace a small bipartite graph with a cospectral mate…
Two method for computation of the spectra of certain infinite graphs are suggested. The first one can be viewed as a reversed Gram--Schmidt orthogonalization procedure. It relies heavily on the spectral theory of Jacobi matrices. The second…
Graph-based representations play a key role in machine learning. The fundamental step in these representations is the association of a graph structure to a dataset. In this paper, we propose a method that aims at finding a block sparse…
We define a (pseudo-)distance between graphs based on the spectrum of the normalized Laplacian, which is easy to compute or to estimate numerically. It can therefore serve as a rough classification of large empirical graphs into families…
A new class of isospectral graphs is presented. These graphs are isospectral with respect to both the normalised Laplacian on the discrete graph and the standard differential Laplacian on the corresponding metric graph. The new class of…
The spectra of digraphs, unlike those of graphs, is a relatively unexplored territory. In a digraph, a separation is a pair of sets of vertices X and Y such that there are no arcs from X and Y . For a subclass of eulerian digraphs, we give…
A topological invariant of a polynomial map $p:X\to B$ from a complex surface containing a curve $C\subset X$ to a one-dimensional base is given by a rational second homology class in the compactification of the moduli space of genus $g$…
This paper considers a class C(Z_p) of closed sets of the p-adic integers obtained by graph-directed constructions analogous to those of Mauldin and Williams over the real numbers. These sets are characterized as collections of those p-adic…
In the past decades, graphs that are determined by their spectrum have received more attention, since they have been applied to several fields, such as randomized algorithms, combinatorial optimization problems and machine learning. An…