Related papers: Nodal domain theorems for $p$-Laplacians on signed…
We introduce an abstract framework for the study of clustering in metric graphs: after suitably metrising the space of graph partitions, we restrict Laplacians to the clusters thus arising and use their spectral gaps to define several…
We prove lower bounds for the first non-trivial eigenvalue of the drift Laplacian on manifolds with Wentzell-type boundary condition in terms of some Cheeger-type constants for bulk-boundary interactions. Our results are in the spirit of…
This paper deals with dynamical networks for which the relations between node signals are described by proper transfer functions and external signals can influence each of the node signals. In particular, we are interested in…
In this paper, we establish the relation between classic invariants of graphs and their integer Laplacian eigenvalues, focusing on a subclass of chordal graphs, the strictly chordal graphs, and pointing out how their computation can be…
We investigate properties of spectrum of normalized Laplacian $\mathcal L$ for finite graphs over non-Archimedean ordered fields. We prove a Cheeger's inequality for first non-zero eigenvalue. Then we describe properties of the operator…
We study harmonic functions on general weighted graphs which allow for a compatible intrinsic metric. We prove an $L^{p}$ Liouville type theorem which is a quantitative integral $L^{p}$ estimate of harmonic functions analogous to Karp's…
We develop an index theory for variational problems on noncompact quantum graphs. The main results are a spectral flow formula, relating the net change of eigenvalues to the Maslov index of boundary data, and a Morse index theorem, equating…
On a compact metric graph, we consider the spectrum of the Laplacian defined with a mix of standard and Dirichlet vertex conditions. A Cheeger-type lower bound on the gap $\lambda_2 - \lambda_1$ is established, with a constant that depends…
The spectrum of the normalized graph Laplacian yields a very comprehensive set of invariants of a graph. In order to understand the information contained in those invariants better, we systematically investigate the behavior of this…
We introduce and develop a theory of limits for sequences of sparse graphs based on $L^p$ graphons, which generalizes both the existing $L^\infty$ theory of dense graph limits and its extension by Bollob\'as and Riordan to sparse graphs…
We define, for any graph $G=(V,E)$, a boundary $\partial G \subseteq V$. The definition coincides with what one would expected for the discretization of (sufficiently nice) Euclidean domains and contains all vertices from the…
We introduce a new variational principle for the study of eigenvalues and eigenfunctions of the Laplacians with Neumann and Dirichlet boundary conditions on planar domains. In contrast to the classical variational principles, its minimizers…
We give lower bounds for the first non-zero Steklov eigenvalue on connected graphs. These bounds depend on the extrinsic diameter of the boundary and not on the diameter of the graph. We obtain a lower bound which is sharp when the cardinal…
In this article we examine the adjacency and Laplacian matrices and their eigenvalues and energies of the general product (non-complete extended $p$-sum, or NEPS) of signed graphs. We express the adjacency matrix of the product in terms of…
Synchronization over networks depends strongly on the structure of the coupling between the oscillators. When the coupling presents certain regularities, the dynamics can be coarse-grained into clusters by means of External Equitable…
Based on matrix perturbation theory, closed-form analytic expansions are studied for a Laplacian eigenvalue of an undirected, possibly weighted graph, which is close to a unique degree in that graph. An approximation is presented to provide…
In this paper we show that all nodes can be found optimally for almost all random Erd\H{o}s-R\'enyi ${\mathcal G}(n,p)$ graphs using continuous-time quantum spatial search procedure. This works for both adjacency and Laplacian matrices,…
The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been…
We study a pseudo-differential equation driven by the degenerate fractional p-Laplacian, under Dirichlet type conditions in a smooth domain. First we show that the solution set within the order interval given by a sub-supersolution pair is…
We obtain lower bounds for the number of nodal domains of Hecke eigenfunctions on the sphere. Assuming the generalized Lindelof hypothesis we prove that the number of nodal domains of any Hecke eigenfunction grows with the eigenvalue of the…