相关论文: Explicit construction of the eigenvectors and eige…

The complete knowledge of Laplacian eigenvalues and eigenvectors of complex networks plays an outstanding role in understanding various dynamical processes running on them; however, determining analytically Laplacian eigenvalues and…

The eigenvalues of the normalized Laplacian matrix of a network plays an important role in its structural and dynamical aspects associated with the network. In this paper, we study the spectra and their applications of normalized Laplacian…

A central issue in the study of polymer physics is to understand the relation between the geometrical properties of macromolecules and various dynamics, most of which are encoded in the Laplacian spectra of a related graph describing the…

We describe our current understanding on the phase transition phenomenon of the graph Laplacian eigenvectors constructed on a certain type of unweighted trees, which we previously observed through our numerical experiments. The eigenvalue…

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 derive the determinant of the Laplacian for the Hanoi networks and use it to determine their number of spanning trees (or graph complexity) asymptotically. While spanning trees generally proliferate with increasing average degree, the…

We consider the family of undirected Cayley graphs associated with odd cyclic groups, and study statistics for the eigenvalues in their spectra. Our results are motivated by analogies between arithmetic geometry and graph theory.

Discrete amorphous materials are best described in terms of arbitrary networks which can be embedded in three dimensional space. Investigating the thermodynamic equilibrium as well as non-equilibrium behavior of such materials around second…

Determining and analyzing the spectra of graphs is an important and exciting research topic in theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties and also on…

Many popular graph metrics encode average properties of individual network elements. Complementing these conventional graph metrics, the eigenvalue spectrum of the normalized Laplacian describes a network's structure directly at a systems…

The work in this thesis concerns the investigation of eigenvalues of the Laplacian matrix, normalized Laplacian matrix, signless Laplacian matrix and distance signless Laplacian matrix of graphs. In Chapter 1, we present a brief…

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 the Laplacian of the undirected De Bruijn graph over an alphabet $A$ of order $k$. While the eigenvalues of this Laplacian were found in 1998 by Delorme and Tillich [1], an explicit description of its eigenvectors has remained…

We provide explicit upper bounds for the eigenvalues of the Laplacian on a finite metric tree subject to standard vertex conditions. The results include estimates depending on the average length of the edges or the diameter. In particular,…

Spectral hypergraph theory has recently attracted considerable interest as it provides a natural framework for modeling higher-order relationships beyond classical graphs. In this setting, eigenvalues of adjacency, Laplacian, and…

We establish a sharp lower bound on the first non-trivial eigenvalue of the Laplacian on a metric graph equipped with natural (i.e., continuity and Kirchhoff) vertex conditions in terms of the diameter and the total length of the graph.…

Laplacian Eigenvectors of the graph constructed from a data set are used in many spectral manifold learning algorithms such as diffusion maps and spectral clustering. Given a graph constructed from a random sample of a $d$-dimensional…

We show how the spectrum of a graph Laplacian changes with respect to a certain type of rank-one perturbation. We apply our finding to give new short proofs of the spectral version of Kirchhoff's Matrix Tree Theorem and known derivations…

The standard notion of the Laplacian of a graph is generalized to the setting of a graph with the extra structure of a ``transmission`` system. A transmission system is a mathematical representation of a means of transmitting…

Typically, graph structures are represented by one of three different matrices: the adjacency matrix, the unnormalised and the normalised graph Laplacian matrices. The spectral (eigenvalue) properties of these different matrices are…