Related papers: On phase in scaled graphs
There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…
Signed graphs are powerful models for representing complex relations with both positive and negative connections. Recently, Signed Graph Neural Networks (SGNNs) have emerged as potent tools for analyzing such graphs. To our knowledge, no…
We present a velocity-gauge formalism for computing nonlinear current response functions in periodic systems and apply it to the Su-Schrieffer-Heeger (SSH) model as a minimal topological testbed. By retaining the full minimal coupling…
In this short note we formulate a stabilizer formalism in the language of noncommutative graphs. The classes of noncommutative graphs we consider are obtained via unitary representations of compact groups, and suitably chosen operators on…
Signed graphs are graphs whose edges get a sign $+1$ or $-1$ (the signature). Signed graphs can be studied by means of graph matrices extended to signed graphs in a natural way. Recently, the spectra of signed graphs have attracted much…
Signed Graph Neural Networks (SGNNs) are vital for analyzing complex patterns in real-world signed graphs containing positive and negative links. However, three key challenges hinder current SGNN-based signed graph representation learning:…
Point signatures based on the Laplacian operators on graphs, point clouds, and manifolds have become popular tools in machine learning for graphs, clustering, and shape analysis. In this work, we propose a novel point signature, the power…
We present a new approach for learning unsupervised node representations in community graphs. We significantly extend the Interferometric Graph Transform (IGT) to community labeling: this non-linear operator iteratively extracts features…
The spectral properties of signed directed graphs, which may be naturally obtained by assigning a sign to each edge of a directed graph, have received substantially less attention than those of their undirected and/or unsigned counterparts.…
The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent…
Some of the basic properties of any dynamical system can be summarized by a graph. The dynamical systems in our theory run from maps like the logistic map to ordinary differential equations to dissipative partial differential equations. Our…
A signed graph is a graph in which each edge has a positive or negative sign. In this article, first we characterize the distance compatibility in the case of a connected signed graph and discussed the distance compatibility criterion for…
Given a symmetric social network, we are interested in testing whether it has only one community or multiple communities. The desired tests should (a) accommodate severe degree heterogeneity, (b) accommodate mixed-memberships, (c) have a…
In this paper, we investigate signatures of topological phase transitions in interacting systems. We show that the key signature is the existence of a topologically protected level crossing, which is robust and sharply defines the…
A signed graph is one that features two types of edges: positive and negative. Balanced signed graphs are those in which all cycles contain an even number of positive edges. In the adjacency matrix of a signed graph, entries can be $0$,…
Temporal graphs represent graph evolution over time, and have been receiving considerable research attention. Work on expressing temporal graph patterns or discovering temporal motifs typically assumes relatively simple temporal…
We present a methodology for detecting non-linearities in data sets based on the characterization of the structural features of the Fourier phase maps. A Fourier phase map is a 2D set of points $M= \{(\phi_{\vec{k}}, \phi_{\vec{k} +…
Rhythmic activity is ubiquitous in biological systems from the cellular to organism level. Reconstructing the instantaneous phase is the first step in analyzing the essential mechanism leading to a synchronization state from the observed…
In the last decade, the concept of path signature has achieved significant success in data science applications. It offers a powerful set of features that effectively capture and describe the characteristics of paths or sequential data.…
A matrix-weighted graph is an undirected graph with a $k\times k$ positive semidefinite matrix assigned to each edge. There are natural generalizations of the Laplacian and adjacency matrices for such graphs. These matrices can be used to…