Related papers: Harmonic analysis invariants for infinite graphs v…
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper we study convex graph invariants, which are graph invariants…
This paper introduces an inner product on chain complexes of finite simplicial complexes that is well-adapted to the harmonic study of subdivisions. Its definition utilizes a decomposition of the chain spaces that suggests a sequence of…
We consider the inverse problem for countable, locally finite electrical networks with edge weights in an arbitrary field. The electrical inverse problem seeks to determine the weights of the edges knowing only the potential and current…
We construct invariant differential operators acting on sections of vector bundles of densities over a smooth manifold without using a Riemannian metric. The spectral invariants of such operators are invariant under both the diffeomorphisms…
The field of Graph Signal Processing (GSP) has proposed tools to generalize harmonic analysis to complex domains represented through graphs. Among these tools are translations, which are required to define many others. Most works propose to…
Motivated by potential theory on discrete spaces, we study a family of unbounded Hermitian operators in Hilbert space which generalize the usual graph-theoretic discrete Laplacian. These operators are discrete analogues of the classical…
Graph invariants provide a powerful analytical tool for investigation of abstract structures of graphs. They, combined in convenient relations, carry global and general information about a graph and its various substructures such as cycle…
In this paper, we study the Dirichlet-to-Neumann operators on infinite subgraphs of graphs. For an infinite graph, we prove Cheeger-type estimates for the bottom spectrum of the Dirichlet-to-Neumann operator, and the higher order Cheeger…
An application of the Gordan-Hilbert finite algebraic basis theorem is suggested.
This paper studies the $p$-biharmonic equation on graphs, which arises in point cloud processing and can be interpreted as a natural extension of the graph $p$-Laplacian from the perspective of hypergraph. The asymptotic behavior of the…
The adjacency operator of a graph has a spectrum and a class of scalar-valued spectral measures which have been systematically analyzed; it also has a spectral multiplicity function which has been less studied. The first purpose of this…
Hierarchical graphs often exhibit tree-like branching patterns, a structural property that challenges the design of traditional graph filters. We introduce a boundary-weighted operator that rescales each edge according to how far its…
In this paper authors consider representations of graphs in Hilbert spaces applying a restriction of local scalarity on them. It enables to obtain a theory, similar to the classical theory of representations of graphs in vector spaces. In…
In this article we introduce the notion of weak harmonic labeling of a graph, a generalization of the concept of harmonic labeling defined recently by Benjamini et al. that allows extension to finite graphs and graphs with leaves. We…
Our main theorem is in the generality of the axioms of Hilbert space, and the theory of unbounded operators. Consider two Hilbert spaces such that their intersection contains a fixed vector space D. It is of interest to make a precise…
We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…
We uncover the very rich graph topology of generic bounded non-Hermitian spectra, distinct from the topology of conventional band invariants and complex spectral winding. The graph configuration of complex spectra are characterized by the…
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…
We compare the space of square-summable functions on an infinite graph (denoted $\ell^2(G)$) with the space of functions of finite energy (denoted $\mathcal{H}_{\mathcal{E}}$). There is a notion of inclusion that allows $\ell^2(G)$ to be…
We study Hamiltonian flows in a real separable Hilbert space endowed with a symplectic structure. Measures on the Hilbert space that are invariant with respect to the flows of completely integrable Hamiltonian systems are investigated.…