Related papers: Optimal eigenvalues on a metric graph with densiti…

We explore a connection between geodesic nets and quantum graphs optimising certain functionals from spectral theory. For surfaces, critical metrics for the normalised $k^{\mathrm{th}}$ eigenvalue of the Laplacian give rise to isometric…

We adapt modulus of continuity estimates to the study of spectra of combinatorial graph Laplacians, as well as the Dirichlet spectra of certain weighted Laplacians. The latter case is equivalent to stoquastic Hamiltonians and is of current…

We consider metric graphs with a uniform lower bound on the edge lengths but no further restrictions. We discuss how to describe every local self-adjoint Laplace operator on such graphs by boundary conditions in the vertices given by…

Motivated by a geometric problem, we introduce a new non-convex graph partitioning objective where the optimality criterion is given by the sum of the Dirichlet eigenvalues of the partition components. A relaxed formulation is identified…

Let $m$ be a bounded function and $\alpha$ a nonnegative parameter. This article is concerned with the first eigenvalue $\lambda\_\alpha(m)$ of the drifted Laplacian type operator $\mathcal L\_m$ given by $\mathcal L\_m(u)=…

We establish an explicit maximum principle for the Dirichlet problem associated with the $p$-Laplacian ($p>1$), where the constant depends on both $p$ and the geometry of the domain. From this result we derive two main applications. First,…

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…

We provide an introductory review of some topics in spectral theory of Laplacians on metric graphs. We focus on three different aspects: the trace formula, the self-adjointness problem and connections between Laplacians on metric graphs and…

We consider the problem of minimising or maximising the quantity $\lambda(\O)T^q(\O)$ on the class of open sets of prescribed Lebesgue measure. Here $q>0$ is fixed, $\lambda(\O)$ denotes the first eigenvalue of the Dirichlet Laplacian on…

Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumption and generalize the analysis of graph Laplacians to include…

We consider the numerical construction of minimal Lagrangian graphs, which is related to recent applications in materials science, molecular engineering, and theoretical physics. It is known that this problem can be formulated as an…

We normalize the combinatorial Laplacian of a graph by the degree sum, look at its eigenvalues as a probability distribution and then study its Shannon entropy. Equivalently, we represent a graph with a quantum mechanical state and study…

The Dirichlet problem and Dirichlet to Neumann map are analyzed for elliptic equations on a large collection of infinite quantum graphs. For a dense set of continuous functions on the graph boundary, the Dirichlet to Neumann map has values…

In an attempt to characterize the structure of eigenvectors of random regular graphs, we investigate the correlations between the components of the eigenvectors associated to different vertices. In addition, we provide numerical…

We prove that in Riemannian manifolds the $k$-th Steklov eigenvalue on a domain and the square root of the $k$-th Laplacian eigenvalue on its boundary can be mutually controlled in terms of the maximum principal curvature of the boundary…

We study entanglement properties of mixed density matrices obtained from combinatorial Laplacians. This is done by introducing the notion of the density matrix of a graph. We characterize the graphs with pure density matrices and show that…

Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the submanifold. The graph Laplacian of such a graph is used in…

We consider a spectral optimal design problem involving the Neumann traces of the Dirichlet-Laplacian eigenfunctions on a smooth bounded open subset $\Omega$ of $\R^n$. The cost functional measures the amount of energy that Dirichlet…

We offer a new method for proving that the maximal eigenvalue of the normalized graph Laplacian of a graph with $n$ vertices is at least $\frac{n+1}{n-1}$ provided the graph is not complete and that equality is attained if and only if the…

In this short note, we show that the continuous intrinsic graph Laplace operator with Gaussian kernel on a compact Riemannian manifold without boundary uniquely determines both the Riemannian metric and the sampling density, provided the…