Related papers: Hearing Shapes via p-Adic Laplacians
We provide two examples of spectral analysis techniques of Schroedinger operators applied to geometric Laplacians. In particular we show how to adapt the method of analytic dilation to Laplacians on complete manifolds with corners of…
We introduce an abstract framework for the study of clustering in metric graphs: after suitably metrising the space of graph partitions, we restrict Laplacians to the clusters thus arising and use their spectral gaps to define several…
We study the symmetry properties of the spectra of normalized Laplacians on signed graphs. We find a new machinery that generates symmetric spectra for signed graphs, which includes bipartiteness of unsigned graphs as a special case.…
The persistence diagram (PD) is an increasingly popular topological descriptor. By encoding the size and prominence of topological features at varying scales, the PD provides important geometric and topological information about a space.…
We obtain new bounds for the Laplacian spectral radius of a signed graph. Most of these new bounds have a dependence on edge sign, unlike previously known bounds, which only depend on the underlying structure of the graph. We then use some…
Several invariants of polarized metrized graphs and their applications in Arithmetic Geometry are studied recently. In this paper, we give fast algorithms to compute these invariants by expressing them in terms of the discrete Laplacian…
We introduce a new subclass of chordal graphs that generalizes split graphs, which we call well-partitioned chordal graphs. Split graphs are graphs that admit a partition of the vertex set into cliques that can be arranged in a star…
We introduce the first learning-based method for recovering shapes from Laplacian spectra. Given an auto-encoder, our model takes the form of a cycle-consistent module to map latent vectors to sequences of eigenvalues. This module provides…
A factor of a graph is a spanning subgraph. Spectral sufficient conditions are provided via spectral radius and signless Laplacian spectral radius for graphs with (i) a matching of given size (particularly, $1$-factor) containing any given…
We construct a spectral triple for the C$^*$-algebra of continuous functions on the space of $p$-adic integers by using a rooted tree obtained from coarse-grained approximation of the space, and the forward derivative on the tree.…
We investigate the problem of reconstructing a 2D piecewise smooth function from its bandlimited Fourier measurements. This is a well known and well studied problem with many real world implications, in particular in medical imaging. While…
Many tools from the field of graph signal processing exploit knowledge of the underlying graph's structure (e.g., as encoded in the Laplacian matrix) to process signals on the graph. Therefore, in the case when no graph is available, graph…
Contrary to the traditional pursuit of research on nonuniform sampling of bandlimited signals, the objective of the present paper is not to find sampling conditions that permit perfect reconstruction, but to perform the best possible signal…
Determining and analyzing the spectra of graphs is an important and exciting research topic in theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties and also on…
Many systems comprising entities in interactions can be represented as graphs, whose structure gives significant insights about how these systems work. Network theory has undergone further developments, in particular in relation to…
We consider Laplace operators on periodic discrete graphs perturbed by guides, i.e., graphs which are periodic in some directions and finite in other ones. The spectrum of the Laplacian on the unperturbed graph is a union of a finite number…
We show that arising out of noncmmutatve geometry is a natural family of {\em edge Laplacians} on the edges of a graph. The family includes a canonical edge Laplacian associated to the graph, extending the usual graph Laplacian on vertices,…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
Using the shuffle structure of the graphs, we introduce a new kind of the Hopf algebraic structure for tagged graphs with, or without loops. Like a quantum group structure, its product is non-commutative. With the help of the Hopf algebraic…
Exploring the relationship between geometry and the resonant frequencies of a shape is of interest to pure and applied mathematicians. These resonant frequencies are related to the spectrum of the Laplacian, a partial differential operator.…