Related papers: Tight Frames Generated By A Graph Short-Time Fouri…

A metrized graph is a finite weighted graph whose edges are thought of as line segments. In this expository paper, we study the Laplacian operator on a metrized graph and some important functions related to it, including the ``j-function'',…

The graph Laplacian operator is widely studied in spectral graph theory largely due to its importance in modern data analysis. Recently, the Fourier transform and other time-frequency operators have been defined on graphs using Laplacian…

Temporal graphs provide a useful model for many real-world networks. Unfortunately the majority of algorithmic problems we might consider on such graphs are intractable. There has been recent progress in defining structural parameters which…

We provide the foundations of a Hilbert space theory for the short-time Fourier transform (STFT) where the flat tori \begin{equation*} \mathbb{T}_{N}^2=\mathbb{R}^2/(\mathbb{Z}\times N\mathbb{Z})=[0,1]\times \lbrack 0,N] \end{equation*} act…

We propose a general principle for the low-energy theory of narrow bands with concentrated Berry curvature and Fubini-Study metric in the form of a map to Anderson-"+" models composed of heavy fermions hybridizing and interacting with…

A computationally efficient workflow for obtaining the low-energy symmetric tight-binding Hamiltonians for twisted multilayer systems is presented in this work. We apply this scheme to twisted bilayer graphene at the first magic angle. As…

We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…

We prove that unless Exponential Time Hypothesis (ETH) fails, deciding if there is a homomorphism from graph $G$ to graph $H$ cannot be done in time $|V(H)|^{o(|V(G)|)}$. Combined with the reduction of Cygan, Pachocki, and Soca{\l}a, our…

A Weyl-Heisenberg frame for L^2(R) is a frame consisting of translates and modulates of a fixed function. In this paper we give necessary and sufficient conditions for this family to form a tight WH-frame. This allows us to write down…

Many hard graph problems, such as Hamiltonian Cycle, become FPT when parameterized by treewidth, a parameter that is bounded only on sparse graphs. When parameterized by the more general parameter clique-width, Hamiltonian Cycle becomes…

In this thesis, we analyze the stochastic completeness of a heat kernel on graphs which is a function of three variables: a pair of vertices and a continuous time, for infinite, locally finite, connected graphs. For general graphs, a…

Because of the significant increase in size and complexity of the networks, the distributed computation of eigenvalues and eigenvectors of graph matrices has become very challenging and yet it remains as important as before. In this paper…

Graph signal processing (GSP) uses a shift operator to define a Fourier basis for the set of graph signals. The shift operator is often chosen to capture the graph topology. However, in many applications, the graph topology may be unknown a…

Equiangular tight frames (ETFs) are configurations of vectors which are optimally geometrically spread apart and provide resolutions of the identity. Many known constructions of ETFs are group covariant, meaning they result from the action…

For any particular class of graphs, algorithms for computational problems restricted to the class often rely on structural properties that depend on the specific problem at hand. This begs the question if a large set of such results can be…

We consider a Laplacian on periodic discrete graphs. Its spectrum consists of a finite number of bands. In a class of periodic 1-forms, i.e., functions defined on edges of the periodic graph, we introduce a subclass of minimal forms with a…

Graph signal processing is a framework to handle graph structured data. The fundamental concept is graph shift operator, giving rise to the graph Fourier transform. While the graph Fourier transform is a centralized procedure, distributed…

The study of complex systems benefits from graph models and their analysis. In particular, the eigendecomposition of the graph Laplacian lets emerge properties of global organization from local interactions; e.g., the Fiedler vector has the…

In 1984, Fan gave a sufficient condition involving maximum degree of every pair of vertices at distance two for a graph to be Hamiltonian. Motivated by Fan's result, we say that an induced subgraph $H$ of a graph $G$ is $f$-heavy if for…

We study the frame properties of the Gabor systems $$\mathfrak{G}(g;\alpha,\beta):=\{e^{2\pi i \beta m x}g(x-\alpha n)\}_{m,n\in\mathbb{Z}}.$$ In particular, we prove that for Herglotz windows $g$ such systems always form a frame for…