Related papers: Lipschitz Bounds for Persistent Laplacian Eigenval…

We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize the geometry of the graph. In many interesting cases, the existence of…

Since the control of the Lipschitz constant has a great impact on the training stability, generalization, and robustness of neural networks, the estimation of this value is nowadays a real scientific challenge. In this paper we introduce a…

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…

Spectral methods that are based on eigenvectors and eigenvalues of discrete graph Laplacians, such as Diffusion Maps and Laplacian Eigenmaps are often used for manifold learning and non-linear dimensionality reduction. It was previously…

We use heat kernels or eigenfunctions of the Laplacian to construct local coordinates on large classes of Euclidean domains and Riemannian manifolds (not necessarily smooth, e.g. with $\mathcal{C}^\alpha$ metric). These coordinates are…

The ordered eigenvalues define a Lipschitz map on the real vector space of Hermitian $d \times d$ matrices. We prove that this map acts continuously, but not uniformly continuously, by superposition on the Sobolev spaces $W^{1,q}$, for all…

We consider general second order uniformly elliptic operators subject to homogeneous boundary conditions on open sets $\phi (\Omega)$ parametrized by Lipschitz homeomorphisms $\phi $ defined on a fixed reference domain $\Omega$. Given two…

We use persistent homology along with the eigenfunctions of the Laplacian to study similarity amongst triangulated 2-manifolds. Our method relies on studying the lower-star filtration induced by the eigenfunctions of the Laplacian. This…

The Lipschitz space of an infinite (locally-finite) graph is defined as the set of functions on the vertices of the graph such that the differences of the values between adjacent vertices remain bounded. In this paper we prove that this set…

We use the averaged variational principle introduced in a recent article on graph spectra [7] to obtain upper bounds for sums of eigenvalues of several partial differential operators of interest in geometric analysis, which are analogues of…

The purpose of this paper is to explore the asymptotics of the eigenvalue spectrum of the Laplacian on 2 dimensional spaces of constant curvature, giving strong experimental evidence for a conjecture of the second author…

Lipschitz continuity is a crucial functional property of any predictive model, that naturally governs its robustness, generalisation, as well as adversarial vulnerability. Contrary to other works that focus on obtaining tighter bounds and…

Lipschitz Bound Estimation is an effective method of regularizing deep neural networks to make them robust against adversarial attacks. This is useful in a variety of applications ranging from reinforcement learning to autonomous systems.…

In this paper, our main goal is to study the evolution problem associated with the Laplacian operator with Dirichlet boundary conditions on a regular tree. To this end, we place special emphasis on the associated first eigenvalue problem,…

We are concerned with inverse boundary problems for first order perturbations of the Laplacian, which arise as model operators in the acoustic tomography of a moving fluid. We show that the knowledge of the Dirichlet--to--Neumann map on the…

Existing Rademacher complexity bounds for neural networks rely only on norm control of the weight matrices and depend exponentially on depth via a product of the matrix norms. Lower bounds show that this exponential dependence on depth is…

The lowest eigenvalue of the Laplacian within the S-sided regular polygon with Dirichlet boundary conditions is the focus of this report. As suggested by others, this eigenvalue may be expressed as an asymptotic expansion in powers of 1/S…

Discontinuity with respect to data perturbations is common in algebraic computation where solutions are often highly sensitive. Such problems can be modeled as solving systems of equations at given data parameters. By appending auxiliary…

In this paper we show the existence of two principal eigenvalues associated to general non-convex fully nonlinear elliptic operators with Neumann boundary conditions in a bounded $C^2$ domain. We study these objects and we establish some of…

The largest eigenvalue of a matrix is always larger or equal than its largest diagonal entry. We show that for a large class of random Laplacian matrices, this bound is essentially tight: the largest eigenvalue is, up to lower order terms,…