Related papers: Spectral Graph Complexity
In this paper we continue the study of the higher-rank graphs associated to finite-dimensional complex semisimple Lie algebras, introduced by the author and R. Yuncken, whose construction relies on Kashiwara's theory of crystals. First we…
We give the first explicit computations of rational homotopy groups of spaces of "long knots" in Euclidean spaces. We define a spectral sequence which converges to these rational homotopy groups whose E^1 term is defined in terms of braid…
In this paper, we demonstrate a useful interaction between the theory of clique partitions, edge clique covers of a graph, and the spectra of graphs. Using a clique partition and an edge clique cover of a graph we introduce the notion of a…
This article introduces a new approach to discrete curvature based on the concept of effective resistances. We propose a curvature on the nodes and links of a graph and present the evidence for their interpretation as a curvature. Notably,…
Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs…
We propose the spectral degree exponent as a novel graph metric. Although Hofmeister \cite{HofmeisterThesis} has studied the same metric, we generalise Hofmeister's work to weighted graphs. We provide efficient iterative formulas and bounds…
Much recent work in bilingual lexicon induction (BLI) views word embeddings as vectors in Euclidean space. As such, BLI is typically solved by finding a linear transformation that maps embeddings to a common space. Alternatively, word…
We present a number of relations involving the number of cliques in a graph and its spectral radius.
The entropy of a graph is an information-theoretic quantity which expresses the complexity of a graph \cite{DM1,M}. After Shannon introduced the definition of entropy to information and communication, many generalizations of the entropy…
A graph's spectral wavelet signature determines a filtration, and consequently an associated set of extended persistence diagrams. We propose a framework that optimises the choice of wavelet for a dataset of graphs, such that their…
We establish an Expander Mixing Lemma for directed graphs in terms of the eigenvalues of an associated asymmetric transition probability matrix, extending the classical spectral inequality to the asymmetric setting. As an application, we…
We present a flexible framework for uncertainty principles in spectral graph theory. In this framework, general filter functions modeling the spatial and spectral localization of a graph signal can be incorporated. It merges several…
Graph classification plays an important role is data mining, and various methods have been developed recently for classifying graphs. In this paper, we propose a novel method for graph classification that is based on homotopy equivalence of…
We analyze complexity in spatial network ensembles through the lens of graph entropy. Mathematically, we model a spatial network as a soft random geometric graph, i.e., a graph with two sources of randomness, namely nodes located randomly…
In this paper, rough approximations of Cayley graphs are studied and rough edge Cayley graphs are introduced. Furthermore, a new algebraic definition called pseudo-Cayley graphs containing Cayley graphs is proposed. Rough approximation is…
In this paper the Weyl tensor is used to define operators that act on the space of forms. These operators are shown to have interesting properties and are used to classify the Weyl tensor, the well known Petrov classification emerging as a…
In this paper we present a mathematical framework on linking of embeddings of compact topological spaces into Euclidean spaces and separability of linked embeddings under a specific class of dimension reduction maps. As applications of the…
Hypergraphs require higher-dimensional representations, which makes it more difficult to compute and interpret their spectral properties. This survey article uses the framework of hypermatrices to give an in-depth overview of the spectral…
We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…
We reexamine from first principles the classical Goldberg-Sachs theorem from General Relativity. We cast it into the form valid for complex metrics, as well as real metrics of any signature. We obtain the sharpest conditions on the…