Related papers: Hearing Shapes via p-Adic Laplacians
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…
In this paper, we construct a digraph structure on $p$-adic dynamical systems defined by rational functions. We study the conditions under which the functions are measure-preserving, invertible and isometric, ergodic, and minimal on…
The spectral theory of graphs provides a bridge between classical signal processing and the nascent field of graph signal processing. In this paper, a spectral graph analogy to Heisenberg's celebrated uncertainty principle is developed.…
The two matrix model is considered, with measure given by the exponential of a sum of polynomials in two different variables. It is shown how to derive a sequence of pairs of ``dual'' finite size systems of ODEs for the corresponding…
We describe the construction of theta summable and finitely summable spectral triples associated to Mumford curves and some classes of higher dimensional buildings. The finitely summable case is constructed by considering the stabilization…
Many degree sequences can only be realised in graphs that contain a `ds-completable card', defined as a vertex-deleted subgraph in which the erstwhile neighbours of the deleted vertex can be identified from their degrees, if one knows the…
We explore the geometric implications of introducing a spectral cut-off on Riemannian manifolds. This is naturally phrased in the framework of non-commutative geometry, where we work with spectral triples that are \emph{truncated} by…
We investigate the inverse source problem for the wave equation, arising in photo- and thermoacoustic tomography. There exist quite a few theoretically exact inversion formulas explicitly expressing solution of this problem in terms of the…
Let $(X,E_X)$ and $(V,E_V)$ be finite connected graphs without loops. We assume that $V$ has two distinguished vertices $a,b$ and an automorphism $\gamma$ which exchanges $a$ and~$b$. The $V$-edge substitution of $X$ is the graph $X[V]$…
Joint spectra of tuples of operators are subsets in complex projective space. The corresponding tuple of operators can be viewed as an infinite dimensional analog of a determinantal representation of the joint spectrum. We investigate the…
Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…
Graph disaggregation is a technique used to address the high cost of computation for power law graphs on parallel processors. The few high-degree vertices are broken into multiple small-degree vertices, in order to allow for more efficient…
Signal processing on graphs has received a lot of attention in the recent years. A lot of techniques have arised, inspired by classical signal processing ones, to allow studying signals on any kind of graph. A common aspect of these…
Musicians and audio engineers sculpt and transform their sounds by connecting multiple processors, forming an audio processing graph. However, most deep-learning methods overlook this real-world practice and assume fixed graph settings. To…
The generalized composition graph is used by Cardoso and some researchers for factorization of the adjacency spectrum and Laplacian of a simple graph. Because the generalized composition graph is an example of a set-theoretic linear operad,…
The aim of this article is to show that p-adic geometry of modular curves is useful in the study of p-adic properties of traces of singular moduli. In order to do so, we partly answer a question by Ono. As our goal is just to illustrate how…
We study two different types of gluing for graphs: interface (obtained by choosing a common subgraph as the gluing component) and bridge gluing (obtained by adding a set of edges to the given subgraphs). We introduce formulae for computing…
Key to successfully deal with complex contemporary datasets is the development of tractable models that account for the irregular structure of the information at hand. This paper provides a comprehensive and unifying view of several…
We study the spectral curves of dimer models on periodic Fisher graphs, obtained from a ferromagnetic Ising model on $\mathbb{Z}^2$. The spectral curve is defined by the zero locus of the determinant of a modified weighted adjacency matrix.…
The $p$-widths are a nonlinear analogue of the spectrum of the Laplacian. We prove that each $p$-width of a polygon in $\mathbb{R}^2$ is achieved by a union of billiard trajectories. We also compute the $p$-widths of the equilateral…