相关论文: Stability of critical equipartitions of graphs
A spectral minimal partition of a manifold is a decomposition into disjoint open sets that minimizes a spectral energy functional. While it is known that bipartite minimal partitions correspond to nodal partitions of Courant-sharp Laplacian…
A spectral minimal partition of a manifold is its decomposition into disjoint open sets that minimizes a spectral energy functional. It is known that bipartite spectral minimal partitions coincide with nodal partitions of Courant-sharp…
A number of recent papers have considered signed graph Laplacians, a generalization of the classical graph Laplacian, where the edge weights are allowed to take either sign. In the classical case, where the edge weights are all positive,…
The oscillation of a Laplacian eigenfunction gives a great deal of information about the manifold on which it is defined. This oscillation can be encoded in the nodal deficiency, an important geometric quantity that is notoriously hard to…
We present a novel spectral embedding of graphs that incorporates weights assigned to the nodes, quantifying their relative importance. This spectral embedding is based on the first eigenvectors of some properly normalized version of the…
We undertake a systematic investigation of the maxima and minima of the eigenfunctions associated with the first nontrivial eigenvalue of the Laplacian on a metric graph equipped with standard (continuity--Kirchhoff) vertex conditions. This…
In this paper, we first study the $\alpha-$energy functional, Euler-Lagrange operator and $\alpha$-stress energy tensor. Second, it is shown that the critical points of $\alpha-$ energy functional are explicitly related to harmonic maps…
Given a graph Laplacian with positively and negatively weighted edges we are interested in characterizing the set of weights that give a particular spectral index, i.e.~give a prescribed number of positive, zero, and negative eigenvalues.…
We show a norm convergence result for the Laplacian on a class of post-critically finite fractals with arbitrary Borel regular probability measure which can be approximated by a sequence of finite-dimensional graph Laplacians with…
We establish a connection between the stability of an eigenvalue under a magnetic perturbation and the number of zeros of the corresponding eigenfunction. Namely, we consider an eigenfunction of discrete Laplacian on a graph and count the…
Courant theorem provides an upper bound for the number of nodal domains of eigenfunctions of a wide class of Laplacian-type operators. In particular, it holds for generic eigenfunctions of quantum graph. The theorem stipulates that, after…
The notion of network connectivity is used to characterize the robustness and failure tolerance of networks, with high connectivity being a desirable feature. In this paper, we develop a novel approach to the problem of identifying critical…
The Laplacian energy of a graph is the sum of the distances of the eigenvalues of the Laplacian matrix of the graph to the graph's average degree. The maximum Laplacian energy over all graphs on $n$ nodes and $m$ edges is conjectured to be…
In this paper, we investigate critical points of the Laplacian's eigenvalues considered as functionals on the space of Riemmannian metrics or a conformal class of metrics on a compact manifold. We obtain necessary and sufficient conditions…
For a regular polyhedron (or polygon) centered at the origin, the coordinates of the vertices are eigenvectors of the graph Laplacian for the skeleton of that polyhedron (or polygon) associated with the first (non-trivial) eigenvalue. In…
This paper is devoted to the investigation of the spectral theory and dynamical properties of periodic graphs which are not locally finite but carry non-negative, symmetric and summable edge weights. These graphs are shown to exhibit rather…
We study the structure of eigenfunctions of the Laplacian on quantum graphs, with a particular focus on Morse eigenfunctions via nodal and Neumann domains. Building on Courant-type arguments, we establish upper bounds for the number of…
We address the problem of computing the graph $p$-Laplacian eigenpairs for $p\in (2,\infty)$. We propose a reformulation of the graph $p$-Laplacian eigenvalue problem in terms of a constrained weighted Laplacian eigenvalue problem and…
We consider a magnetic Laplacian with periodic magnetic potentials on periodic discrete graphs. Its spectrum consists of a finite number of bands, where degenerate bands are eigenvalues of infinite multiplicity. We obtain a specific…
The nodal domains of eigenvectors of the discrete Schrodinger operator on simple, finite and connected graphs are considered. Courant's well known nodal domain theorem applies in the present case, and sets an upper bound to the number of…