Related papers: Frames for Graph Signals on the Symmetric Group: A…
In this paper we show how to produce a large number of representations of a graph C*-algebra in the space of the bounded linear operators in $L^2(X,\mu)$. These representations are very concrete and, in the case of graphs that satisfy…
A frame matroid M is graphic if there is a graph G with cycle matroid isomorphic to M. In general, if there is one such graph, there will be many. Zaslavsky has shown that frame matroids are precisely those having a representation as a…
Let $G$ be a finite abelian group, let $E$ be a subset of $G$, and form the Cayley (directed) graph of $G$ with connecting set $E$. We explain how, for various matrices associated to this graph, the spectrum can be used to give information…
Statistical models that possess symmetry arise in diverse settings such as random fields associated to geophysical phenomena, exchangeable processes in Bayesian statistics, and cyclostationary processes in engineering. We formalize the…
The adaptive processing of structured data is a long-standing research topic in machine learning that investigates how to automatically learn a mapping from a structured input to outputs of various nature. Recently, there has been an…
Given a finite transitive permutation group $G\leq \operatorname{Sym}(\Omega)$, with $|\Omega|\geq 2$, the derangement graph $\Gamma_G$ of $G$ is the Cayley graph $\operatorname{Cay}(G,\operatorname{Der}(G))$, where $\operatorname{Der}(G)$…
We establish for the matrix group $G=\mathrm{SL}_{n}\left(\mathbb{F}_{p}\right)$ that there exist absolute constants $c\in\left(0,1\right)$ and $C>0$ such that any symmetric generating set $A$, with $\left|A\right|\geq\left|G\right|^{1-c}$…
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…
Graphons are infinite-dimensional objects that represent the limit of convergent sequences of graphs as their number of nodes goes to infinity. This paper derives a theory of graphon signal processing centered on the notions of graphon…
The area of Data Analytics on graphs promises a paradigm shift as we approach information processing of classes of data, which are typically acquired on irregular but structured domains (social networks, various ad-hoc sensor networks).…
To characterize the location (mean, median) of a set of graphs, one needs a notion of centrality that is adapted to metric spaces, since graph sets are not Euclidean spaces. A standard approach is to consider the Frechet mean. In this work,…
This work extends the theory of reciprocal diagrams in graphic statics to frameworks that are invariant under finite group actions by utilizing the homology and representation theory of cellular cosheaves, recent tools from applied…
In a recent paper Gunnells, Scott and Walden have determined the complete spectrum of the Schreier graph on the symmetric group corresponding to the Young subgroup $S_{n-2}\times S_2$ and generated by initial reversals. In particular they…
Given a quantum graph $ \Gamma $, a finite symmetry group $ G $ acting on it and a representation $ R $ of $ G $, the quotient quantum graph $ \Gamma /R $ is described and constructed in the literature [1, 2, 18]. In particular, it was…
We perform a comprehensive study of a certain class of discrete symmetries of families of Feynman integrals, defined as affine changes of variables that map different sectors of the family into each other. We show that these transformations…
Graphs are ubiquitous in modelling relational structures. Recent endeavours in machine learning for graph-structured data have led to many architectures and learning algorithms. However, the graph used by these algorithms is often…
We introduce a graphical framework for Bayesian inference that is sufficiently general to accommodate not just the standard case but also recent proposals for a theory of quantum Bayesian inference wherein one considers density operators…
A vertex transitive graph $\Gamma$ is said to be $2$-distance transitive if for each vertex $u$, the group of automorphisms of $\Gamma$ fixing the vertex $u$ acts transitively on the set of vertices at distance $1$ and $2$ from $u$, while…
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…
Representation learning on graphs has been gaining attention due to its wide applicability in predicting missing links, and classifying and recommending nodes. Most embedding methods aim to preserve certain properties of the original graph…