Related papers: Tight Frames Generated By A Graph Short-Time Fouri…
The toughness of graph $G$, denoted by $\tau(G)$, is $\tau(G)=\min\{\frac{|S|}{c(G-S)}:S\subseteq V(G),c(G-S)\geq2\}$ for every vertex cut $S$ of $V(G)$ and the number of components of $G$ is denoted by $c(G)$. Bondy in 1973, suggested the…
This paper reports the synthesis and detailed characterization of graphite thin films produced by thermal decomposition of the (0001) face of a 6H-SiC wafer, demonstrating the successful growth of single crystalline films down to…
We describe a method for generating graphs that provide difficult examples for practical Graph Isomorphism testers. We first give the theoretical construction, showing that we can have a family of graphs without any non-trivial…
The newly realized twisted graphene systems such as twisted bilayer graphene (TBG), twisted double bilayer graphene (TDBG), and twisted trilayer graphene (TTG) have attracted widespread theoretical attention. Therefore, a simple and…
With the wide application of spectral and algebraic theory in discrete signal processing techniques in the field of graph signal processing, an increasing number of signal processing methods have been proposed, such as the graph Fourier…
This work introduces the multidimensional Graph Fourier Transformation Neural Network (GFTNN) for long-term trajectory predictions on highways. Similar to Graph Neural Networks (GNNs), the GFTNN is a novel network architecture that operates…
The large variety of Fourier transforms in geometric algebras inspired the straight forward definition of ``A General Geometric Fourier Transform`` in Bujack et al., Proc. of ICCA9, covering most versions in the literature. We showed which…
Graph signal processing (GSP) is a framework to analyze and process graph-structured data. Many research works focus on developing tools such as Graph Fourier transforms (GFT), filters, and neural network models to handle graph signals.…
We study some spectral properties of a matrix that is constructed as a combination of a Laplacian and an adjacency matrix of simple graphs. The matrix considered depends on a positive parameter, as such we consider the implications in…
The increasing demand for Fourier transforms on geometric algebras has resulted in a large variety. Here we introduce one single straight forward definition of a general geometric Fourier transform covering most versions in the literature.…
This paper introduces a couple of new time-frequency transforms, designed to adapt their scale to specific features of the analyzed function. Such an adaptation is implemented via so-called focus functions, which control the window scale as…
Classical Graph Signal Processing (GSP) provides a robust framework for analyzing signals on irregular domains, utilizing the graph Fourier transform as a cornerstone for spectral analysis and filtering. However, as data structures grow in…
Diffusion models have shown great promise in data generation, yet generating time series data remains challenging due to the need to capture complex temporal dependencies and structural patterns. In this paper, we present \textit{TSGDiff},…
This work studies the spectral convergence of graph Laplacian to the Laplace-Beltrami operator when the graph affinity matrix is constructed from $N$ random samples on a $d$-dimensional manifold embedded in a possibly high dimensional…
We introduce and study a generalization of conformal rigidity for graphs. A graph is $k$-conformally rigid if the uniform edge weights simultaneously maximize the sum of the $k$ smallest nontrivial Laplacian eigenvalues and minimize the sum…
This paper provides new sufficient and necessary conditions for the frame property of generalized translation-invariant systems. The conditions are formulated in the Fourier domain and consists of estimates involving the upper and lower…
The graph entropy describes the structural information of graph. Motivated by the definition of graph entropy in general graphs, the graph entropy of hypergraphs based on Laplacian degree are defined. Some results on graph entropy of simple…
Graph signal processing (GSP) advances spectral analysis on irregular domains. However, existing two-dimensional graph fractional Fourier transform (2D-GFRFT) employs a single fractional order for both factor graphs, thereby limiting its…
A Burling graph is an induced subgraph of some graph in Burling's construction of triangle-free high-chromatic graphs. Equivalently, a Burling graph is a graph that admits a so-called strict frame representation. We provide a…
In geometric analysis, an index theorem relates the difference of the numbers of solutions of two differential equations to the topological structure of the manifold or bundle concerned, sometimes using the heat kernels of two higher-order…