Related papers: Persistent Laplacians: properties, algorithms and …

In this work we introduce a concept of complexity for undirected graphs in terms of the spectral analysis of the Laplacian operator defined by the incidence matrix of the graph. Precisely, we compute the norm of the vector of eigenvalues of…

This paper further investigates \emph{Laplacian simplices}. A construction by Braun and the first author associates to a simple connected graph $G$ a simplex $\cP_G$ whose vertices are the rows of the Laplacian matrix of $G$. In this paper…

We investigate combinatorial properties of aperiodic simple Toeplitz subshifts, as well as spectral properties of Jacobi operators defined by them. More precisely, we derive explicit formulas for complexity, palindrome complexity and, for…

We generalise the dynamic Laplacian introduced in (Froyland, 2015) to a dynamic $p$-Laplacian, in analogy to the generalisation of the standard $2$-Laplacian to the standard $p$-Laplacian for $p>1$. Spectral properties of the dynamic…

The challenge of selecting the most relevant features of a given dataset arises ubiquitously in data analysis and dimensionality reduction. However, features found to be of high importance for the entire dataset may not be relevant to…

We introduce a new family of algorithms for detecting and estimating a rank-one signal from a noisy observation under prior information about that signal's direction, focusing on examples where the signal is known to have entries biased to…

In this paper, a discrete form of the Kato inequality for discrete magnetic Laplacians on graphs is used to study asymptotic properties of the spectrum of discrete magnetic Schrodinger operators. We use the existence of a ground state with…

This paper is concerned with the construction of discrete counterparts of the Laplace-Beltrami operator on Riemannian manifolds that can be effectively used in the numerical solution of partial differential equations. Since existing…

We study the relationship between the arithmetic and the spectrum of the Laplacian for manifolds arising from congruent arithmetic subgroups of SL(1,D), where D is an indefinite quaternion division algebra defined over a number field F. We…

We propose an SQP algorithm for mathematical programs with vanishing constraints which solves at each iteration a quadratic program with linear vanishing constraints. The algorithm is based on the newly developed concept of $\mathcal…

We investigate the spectrum of the self-similar Laplacian, which generates the so-called "$pq$ random walk" on the integer half-line $\mathbb{Z}_+$. Using the method of spectral decimation, we prove that the spectral type of the Laplacian…

We extend discrete calculus for arbitrary ($p$-form) fields on embedded lattices to abstract discrete geometries based on combinatorial complexes. We then provide a general definition of discrete Laplacian using both the primal cellular…

Under the lack of variational structure and nondegeneracy, we investigate three notions of \textit{generalized principal eigenvalue} for a general infinity Laplacian operator with gradient and homogeneous term. A Harnack inequality and…

We prove new properties of the non-backtracking graph and the non-backtracking Laplacian for graphs. In particular, among other results, we prove that two simple graphs are isomorphic if and only if their corresponding non-backtracking…

We study the complex property $\partial\partial = 0$ of the boundary operator $\partial$ on a weighted, infinite, and possibly non-locally finite simplicial complex. We give a characterization of this property in $\ell^2$ in terms of the…

We study spectral properties of the standard (also called Kirchhoff) Laplacian and the anti-standard (or anti-Kirchhoff) Laplacian on a finite, compact metric graph. We show that the positive eigenvalues of these two operators coincide…

In this paper we combine many of the standard and more recent algebraic techniques for testing isomorphism of finite groups (GpI) with combinatorial techniques that have typically been applied to Graph Isomorphism. In particular, we show…

The Laplacian matrix of a graph G describes the combinatorial dynamics of the Abelian Sandpile Model and the more general Riemann-Roch theory of G. The lattice ideal associated to the lattice generated by the columns of the Laplacian…

The Dunkl Laplacian is used to define the Hamiltonian of a modified quantum harmonic oscillator, associated with any finite reflection group. The potential is a sum of the inverse squares of the linear functions whose zero sets are the…

We study the spectral convergence of a symmetrized Graph Laplacian matrix induced by a Gaussian kernel evaluated on pairs of embedded data, sampled from a manifold with boundary, a sub-manifold of $\mathbb{R}^m$. Specifically, we deduce the…