Related papers: Combinatorial and Hodge Laplacians: Similarity and…
The present paper describes a way to relate Martin boundaries on spaces of varying topology. This enables us to approach some detailed inductive analysis of the eigenfunctions of conformal Laplacians on minimal hypersurfaces near their…
Graph Laplacians and related nonlinear mappings into low dimensional spaces have been shown to be powerful tools for organizing high dimensional data. Here we consider a data set X in which the graph associated with it changes depending on…
We propose a monotone discretization for the integral fractional Laplace equation on bounded Lipschitz domains with the homogeneous Dirichlet boundary condition. The method is inspired by a quadrature-based finite difference method of Huang…
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…
We introduce a new topological invariant of complex line arrangements in the complex projective plane, derived from the interaction between their complement and the boundary of a regular neighbourhood. The motivation is to identify Zariski…
An invariant for cospectral graphs is a property shared by all cospectral graphs. In this paper, we establish three novel arithmetic invariants for cospectral graphs, revealing deep connections between spectral properties and combinatorial…
This paper develops a framework for privatizing the spectrum of the graph Laplacian of an undirected graph using differential privacy. We consider two privacy formulations. The first obfuscates the presence of edges in the graph and the…
The Cheeger inequalities give an upper and lower bound on the spectral gap of discrete Laplacians defined on a graph in terms of the geometric characteristics of the graph. We generalise this approach and we employ it to determine if a…
It is reported that dynamical systems over digraphs have superior performance in terms of system damping and tolerance to time delays if the underlying graph Laplacian has a purely real spectrum. This paper investigates the topological…
In many instances of holographic correspondences between a d dimensional boundary theory and a d+1 dimensional bulk, a direct argument in the boundary theory implies that there must exist a simple and precise relation between the Euclidean…
We study the eigenvalues of the connection Laplacian on a graph with an orthogonal group or unitary group signature. We establish higher order Buser type inequalities, i.e., we provide upper bounds for eigenvalues in terms of Cheeger…
For $\Pi \subset \mathbb{R}^2$ a connected, open, bounded set whose boundary is a finite union of disjoint polygons whose vertices have integer coordinates, the logarithm of the discrete Laplacian on $L\Pi \cap \mathbb{Z}^2$ with Dirichlet…
Higher-Order Hypergraph Learning (HOHL) was recently introduced as a principled alternative to classical hypergraph regularization, enforcing higher-order smoothness via powers of multiscale Laplacians induced by the hypergraph structure.…
A Shared Nearest Neighbor (SNN) graph is a type of graph construction using shared nearest neighbor information, which is a secondary similarity measure based on the rankings induced by a primary $k$-nearest neighbor ($k$-NN) measure. SNN…
This paper presents an analysis of properties of two hybrid discretization methods for Gaussian derivatives, based on convolutions with either the normalized sampled Gaussian kernel or the integrated Gaussian kernel followed by central…
This paper aims to compute and estimate the eigenvalues of the Hodge Laplacians on directed graphs. We have devised a new method for computing Hodge spectra with the following two ingredients. (I) We have observed that the product rule does…
Many problems in machine learning can be expressed by means of a graph with nodes representing training samples and edges representing the relationship between samples in terms of similarity, temporal proximity, or label information. Graphs…
Recently Rohleder proposed a new variational approach to an inequality between the Neumann and Dirichlet eigenvalues in the simply connected planar case using the language of classical vector analysis. Writing his approach in terms of…
We propose the notion of integrable boundary in the context of discrete integrable systems on quad-graphs. The equation characterizing the boundary must satisfy a compatibility equation with the one characterizing the bulk that we called…
The recent development of spectral method has been praised for its high-order convergence in simulating complex physical problems. The combination of embedded boundary method and spectral method becomes a mainstream way to tackle…