Related papers: Spectral Graph Complexity
Given a connected undirected weighted graph, we are concerned with problems related to partitioning the graph. First of all we look for the closest disconnected graph (the minimum cut problem), here with respect to the Euclidean norm. We…
Properties of graphs that can be characterized by the spectrum of the adjacency matrix of the graph have been studied systematically recently. Motivated by the complexity of these properties, we show that there are such properties for which…
For a graph representation of a dataset, a straightforward normality measure for a sample can be its graph degree. Considering a weighted graph, degree of a sample is the sum of the corresponding row's values in a similarity matrix. The…
Suppose $\mathfrak{g}$ is a semisimple complex Lie algebra and $\mathfrak{h}$ is a Cartan subalgebra of $\mathfrak{g}$. To the pair $(\mathfrak{g},\mathfrak{h})$ one can associate both a Weyl group and a set of Kac diagrams. There is a…
In estimating the complexity of objects, in particular of graphs, it is common practice to rely on graph- and information-theoretic measures. Here, using integer sequences with properties such as Borel normality, we explain how these…
Graph spectral analysis can yield meaningful embeddings of graphs by providing insight into distributed features not directly accessible in nodal domain. Recent efforts in graph signal processing have proposed new decompositions-e.g., based…
We define a graded graph, called the Schur--Weyl graph, which arises naturally when one considers simultaneously the RSK algorithm and the classical duality between representations of the symmetric and general linear groups. As one of the…
Every graph G can be embedded in a Euclidean space as a two-distance set. The Euclidean representation number of G is the smallest dimension in which G is representable by such an embedding. We consider spherical and J-spherical…
In `A survey of two-graphs' \cite{Sei}, J.J. Seidel lays out the connections between simple graphs, two-graphs, equiangular lines and strongly regular graph. It is well known that there is a one-to-one correspondence between regular…
We describe an efficient and scalable spherical graph embedding method. The method uses a generalization of the Euclidean stress function for Multi-Dimensional Scaling adapted to spherical space, where geodesic pairwise distances are…
The weak minor G of a graph G is the graph obtained from G by a sequence of edge-contraction operations on G. A weak-minor-closed family of upper embeddable graphs is a set G of upper embeddable graphs that for each graph G in G, every weak…
We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…
Mining graph data has become a popular research topic in computer science and has been widely studied in both academia and industry given the increasing amount of network data in the recent years. However, the huge amount of network data…
Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these…
Simplicial complexes are extensively studied in the field of algebraic topology. They have gained attention in recent time due to their applications in fields like theoretical distributed computing and simplicial neural networks. Graphs are…
A graph is $\ell$-choosable if, for any choice of lists of $\ell$ colors for each vertex, there is a list coloring, which is a coloring where each vertex receives a color from its list. We study complexity issues of choosability of graphs…
We characterize which local matrix structures saturate Weyl's eigenvalue perturbation bound for graph Laplacians under geometrically constrained vertex displacements. Geometric graphs with heavy-tailed vertex noise arise across sensor…
Statistical analysis of a graph often starts with embedding, the process of representing its nodes as points in space. How to choose the embedding dimension is a nuanced decision in practice, but in theory a notion of true dimension is…
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth $D(G)$ of a graph $G$ is equal to the minimum quantifier depth of a sentence defining $G$…
The transmission of a vertex $v$ of a graph $G$ is the sum of distances from $v$ to all the other vertices in $G$. The Wiener complexity of $G$ is the number of different transmissions of its vertices. Similarly, the eccentric complexity of…