Related papers: Frames and Factorization of Graph Laplacians
Frames are the most natural generalization of orthonormal bases that allow the inclusion of redundant systems. In this article, we introduce the concept of frames generated by graphs in finite-dimensional spaces and study their properties.…
We establish metric graph counterparts of Pleijel's theorem on the asymptotics of the number of nodal domains $\nu_n$ of the $n$-th eigenfunction(s) of a broad class of operators on compact metric graphs, including Schr\"odinger operators…
Network data are increasingly available in various research fields, motivating statistical analysis for populations of networks where a network as a whole is viewed as a data point. Due to the non-Euclidean nature of networks, basic…
Let $L$ be the generator of an analytic semigroup whose kernels satisfy Gaussian upper bounds and H\"older's continuity. Also assume that $L$ has a bounded holomorphic functional calculus on $L^2(\mathbb{R}^n)$. In this paper, we construct…
Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumption and generalize the analysis of graph Laplacians to include…
We study Laplacians associated to a graph and single out a class of such operators with special regularity properties. In the case of locally finite graphs, this class consists of all selfadjoint, non-negative restrictions of the standard…
Several graph decompositions that factorize the determinant of the adjacency matrix isolate a K\H{o}nig-Egerv\'ary part, such as the SD--KE decomposition and the critical independence decomposition of Larson. This suggests that the study of…
On finite metric graphs the set of all realizations of the Laplace operator in the edgewise defined $L^2$-spaces are studied. These are defined by coupling boundary conditions at the vertices most of which define non-self-adjoint operators.…
We introduce a framework for emulating graphs and, through them, curved spaces of arbitrary dimension, using arrays of superconducting wires. The array consists of two stacked layers of wires, horizontal and vertical, such that wires are…
In a paper by Nishikawa and Motter, a quantity called the normalized spread of the Laplacian eigenvalues is used to measure the synchronizability of certain network dynamics. Through simulations, and without theoretical validation, it is…
We introduce a framework for generating, organizing, and reasoning with computational knowledge. It is motivated by the observation that most problems in Computational Sciences and Engineering (CSE) can be formulated as that of completing…
The prevalence of graph-based data has spurred the rapid development of graph neural networks (GNNs) and related machine learning algorithms. Yet, despite the many datasets naturally modeled as directed graphs, including citation, website,…
Learning a suitable graph is an important precursor to many graph signal processing (GSP) pipelines, such as graph spectral signal compression and denoising. Previous graph learning algorithms either i) make some assumptions on connectivity…
This article is in the spirit of our work on the consequences of the Regge calculus, where some edge length scale arises as an optimal initial point of the perturbative expansion after functional integration over connection. Now consider…
On a periodic planar graph whose edge weights satisfy a certain simple geometric condition, the discrete Laplacian and d-bar operators have the property that their determinants and inverses only depend on the local geometry of the graph. We…
We prove a factorization of completely bounded maps from a $C^*$-algebra $A$ (or an exact operator space $E\subset A$) to $\ell_2$ equipped with the operator space structure of $(C,R)_\theta$ ($0<\theta<1$) obtained by complex interpolation…
We study the boundary theory of a connected weighted graph $G$ from the viewpoint of stochastic integration. For the Hilbert space \HE of Dirichlet-finite functions on $G$, we construct a Gel'fand triple $S \ci {\mathcal H}_{\mathcal E} \ci…
Suppose a finite, unweighted, combinatorial graph $G = (V,E)$ is the union of several (degree-)regular graphs which are then additionally connected with a few additional edges. $G$ will then have only a small number of vertices $v \in V$…
Let $G$ be a finite non-abelian group and ${\Gamma}_{nc}(G)$ be its non-commuting graph. In this paper, we compute spectrum and energy of ${\Gamma}_{nc}(G)$ for certain classes of finite groups. As a consequence of our results we construct…
We study $p$-energy functionals on infinite locally summable graphs for $p\in (1,\infty)$ and show that many well-known characterizations for a parabolic space are also true in this discrete, non-local and non-linear setting. Among the…