Related papers: A generalization of the persistent Laplacian to si…
This article presents a novel and succinct algorithmic framework via alternating quantum walks, unifying quantum spatial search, state transfer and uniform sampling on a large class of graphs. Using the framework, we can achieve exact…
Network topology is a flourishing interdisciplinary subject that is relevant for different disciplines including quantum gravity and brain research. The discrete topological objects that are investigated in network topology are simplicial…
A matching M is a dominating induced matching of a graph, if every edge of the graph is either in $M$ or has a common end-vertex with exactly one edge in $M$. The concept of complete dominating induced matching is introduced as graphs where…
A regularized optimization problem over a large unstructured graph is studied, where the regularization term is tied to the graph geometry. Typical regularization examples include the total variation and the Laplacian regularizations over…
Given a Hermitian vector bundle over an infinite weighted graph, we define the Laplacian associated to a unitary connection on this bundle and study the essential self-adjointness of a perturbation of this Laplacian by an operator-valued…
We study the Laplacian spectrum of token graphs, also called symmetric powers of graphs. The $k$-token graph $F_k(G)$ of a graph $G$ is the graph whose vertices are the $k$-subsets of vertices from $G$, two of which being adjacent whenever…
In network science, the interplay between dynamical processes and the underlying topologies of complex systems has led to a diverse family of models with different interpretations. In graph signal processing, this is manifested in the form…
Laplacian eigenvectors capture natural community structures on graphs and are widely used in spectral clustering and manifold learning. The use of Laplacian eigenvectors as embeddings for the purpose of multiscale graph comparison has…
We introduce a non-backtracking Laplace operator for graphs and we investigate its spectral properties. With the use of both theoretical and computational techniques, we show that the spectrum of this operator captures several structural…
In this paper, we generalize the combinatorial Laplace operator of Horak and Jost by introducing the $\phi$-weighted coboundary operator induced by a weight function $\phi$. Our weight function $\phi$ is a generalization of Dawson's…
We propose a symmetric graph convolutional autoencoder which produces a low-dimensional latent representation from a graph. In contrast to the existing graph autoencoders with asymmetric decoder parts, the proposed autoencoder has a newly…
The set $S_{i,n}=\{0,1,2,\ldots,n-1,n\}\setminus\{i\}$, $1\leqslant i\leqslant n$ is called Laplacian realizable if there exists an undirected simple graph whose Laplacian spectrum is $S_{i,n}$. The existence of such graphs was established…
The diagonal entries of pseudoinverse of the Laplacian matrix of a graph appear in many important practical applications, since they contain much information of the graph and many relevant quantities can be expressed in terms of them, such…
In this article we show that the fractional Laplacian in $R^{2}$ can be factored into a product of the divergence operator, a Riesz potential operator, and the gradient operator. Using this factored form we introduce a generalization of the…
We introduce and investigate generalizations of interval and proper interval graphs to simplicial complexes, including strong interval, unit interval, and under closed variants. Through equivalent combinatorial and algebraic…
We introduce a new notion of graph sparsificaiton based on spectral similarity of graph Laplacians: spectral sparsification requires that the Laplacian quadratic form of the sparsifier approximate that of the original. This is equivalent to…
The work in this thesis concerns the investigation of eigenvalues of the Laplacian matrix, normalized Laplacian matrix, signless Laplacian matrix and distance signless Laplacian matrix of graphs. In Chapter 1, we present a brief…
We present a systematic collection of spectral surgery principles for the Laplacian on a metric graph with any of the usual vertex conditions (natural, Dirichlet or $\delta$-type), which show how various types of changes of a local or…
We prove a generalization of the Expander Mixing Lemma for arbitrary (finite) simplicial complexes. The original lemma states that concentration of the Laplace spectrum of a graph implies combinatorial expansion (which is also referred to…
This paper makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group which are preserved by automorphisms of the…