相关论文: Singular Continuous Spectrum for the Laplacian on …

Using methods from algebraic graph theory and convex optimization, we study the relationship between local structural features of a network and spectral properties of its Laplacian matrix. In particular, we derive expressions for the…

For dendrite graphs from biological experiments on mouse's retinal ganglion cells, a paper by Nakatsukasa, Saito and Woei reveals a mysterious phase transition phenomenon in the spectra of the corresponding graph Laplacian matrices. While…

We look at periodic Jacobi matrices on trees. We provide upper and lower bounds on the gap of such operators analogous to the well known gap in the spectrum of the Laplacian on the upper half-plane with hyperbolic metric. We make some…

A fractafold, a space that is locally modeled on a specified fractal, is the fractal equivalent of a manifold. For compact fractafolds based on the Sierpinski gasket, it was shown by the first author how to compute the discrete spectrum of…

We study spectrum inclusion regions for complex Jacobi matrices which are compact perturbations of the discrete laplacian. The condition sufficient for the lack of discrete spectrum for such matrices is given.

In this paper we study the adjacency spectrum of families of finite rooted trees with regular branching properties. In particular, we show that in the case of constant branching, the eigenvalues are realized as the roots of a family of…

For ergodic 1d Jacobi operators we prove that the random singular components of any spectral measure are almost surely mutually disjoint as long as one restricts to the set of positive Lyapunov exponent. In the context of extended Harper's…

For a graph G, the generating function of rooted forests, counted by the number of connected components, can be expressed in terms of the eigenvalues of the graph Laplacian. We generalize this result from graphs to cell complexes of…

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…

We are interested in various aspects of spectral rigidity of Cayley and Schreier graphs of finitely generated groups. For each pair of integers $d\geq 2$ and $m \ge 1$, we consider an uncountable family of groups of automorphisms of the…

Uniform spanning trees are a statistical model obtained by taking the set of all spanning trees on a given graph (such as a portion of a cubic lattice in d dimensions), with equal probability for each distinct tree. Some properties of such…

We study some spectral properties of a matrix that is constructed as a combination of a Laplacian and an adjacency matrix of simple graphs. The matrix considered depends on a positive parameter, as such we consider the implications in…

We compute the spectral density for ensembles of of sparse symmetric random matrices using replica, managing to circumvent difficulties that have been encountered in earlier approaches along the lines first suggested in a seminal paper by…

We introduce a family of post-critically finite fractal trees indexed by the number of branches they possess. Then we produce a Laplacian operator on graph approximations to these fractals and use spectral decimation to describe the…

We construct the "spectral" decomposition of the sets $\bar{Per\,f}$, $\omega(f)=\cup\omega(x)$ and $\Omega(f)$ for a continuous map $f$ of the interval to itself. Several corollaries are obtained; the main ones describe the generic…

The uniform recursive tree (URT) is one of the most important models and has been successfully applied to many fields. Here we study exactly the topological characteristics and spectral properties of the Laplacian matrix of a deterministic…

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…

We derive exact equations that determine the spectra of undirected and directed sparsely connected regular graphs containing loops of arbitrary length. The implications of our results to the structural and dynamical properties of networks…

We study structure, eigenvalue spectra and diffusion dynamics in a wide class of networks with subgraphs (modules) at mesoscopic scale. The networks are grown within the model with three parameters controlling the number of modules, their…

There are several common ways to encode a tree as a matrix, such as the adjacency matrix, the Laplacian matrix (that is, the infinitesimal generator of the natural random walk), and the matrix of pairwise distances between leaves. Such…