Related papers: The spectrum of the averaging operator on a networ…
We present the spectrum of the (normalized) graph Laplacian as a systematic tool for the investigation of networks, and we describe basic properties of eigenvalues and eigenfunctions. Processes of graph formation like motif joining or…
It is common knowledge that a key dynamical characteristic of a network is its spectrum (the collection of all eigenvalues of the network's weighted adjacency matrix). In \cite{BW10} we demonstrated that it is possible to reduce a network,…
A nonnegative function on the vertices of an infinite graph G which vanishes at a distinguished vertex o, has Laplacian 1 at o, and is harmonic at all other vertices is called a potential. We survey basic properties of potentials in…
A majority of real life networks are weighted and sparse. The present article aims at characterization of weighted networks based on sparsity, as a measure of inherent diversity, of different network parameters. It utilizes sparsity index…
Joint spectra of tuples of operators are subsets in complex projective space. The corresponding tuple of operators can be viewed as an infinite dimensional analog of a determinantal representation of the joint spectrum. We investigate the…
Motivated by the work of Abreu and Freitas, we study the invariant spectrum of the Laplace operator associated to hermitian line bundles endowed with invariant metrics over $\mathbb{p}^1$.
We establish the various properties as well as diverse relations of the ascent and descent spectra for bounded linear operators. We specially focus on the theory of subspectrum. Furthermore, we construct a new concept of convergence for…
Let $G$ be a simple connected undirected graph. The Laplacian spectral ratio of $G$, denoted by $R_L(G)$, is defined as the quotient between the largest and second smallest Laplacian eigenvalues of $G$, which is closely related to the…
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of its connectivity. These eigenvalues can be used to analyze the robustness, resilience, and synchronizability of networks, and are related to…
We study the Laplacian operator of an uncorrelated random network and, as an application, consider hopping processes (diffusion, random walks, signal propagation, etc.) on networks. We develop a strict approach to these problems. We derive…
In this paper, we introduce a quadratic stochastic operators on the set of all probability measures of a measurable space. We study the dynamics of the Lebesgue quadratic stochastic operator on the set of all Lebesgue measures of the set…
Several new spectral properties of the normalized Laplacian defined for oriented hypergraphs are shown. The eigenvalue $1$ and the case of duplicate vertices are discussed; two Courant nodal domain theorems are established; new quantities…
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…
The term interlacing refers to systematic inequalities between the sequences of eigenvalues of two operators defined on objects related by a specific oper- ation. In particular, knowledge of the spectrum of one of the objects then implies…
The aim of the present article is to give an overview of spectral theory on metric graphs guided by spectral geometry on discrete graphs and manifolds. We present the basic concept of metric graphs and natural Laplacians acting on it and…
Statistical properties of binary complex networks are well understood and recently many attempts have been made to extend this knowledge to weighted ones. There is, however, a subtle difference between networks where weights are continuos…
Let $A\colon H\rightarrow H$ be a normal operator on an infinite-dimensional separable Hilbert space $H$ and let $S\subseteq H$ be a finite subset such that $\{A^nx\}_{n\geq 0,\,x\in S}$ can be rescaled to form a frame for $H$. That is,…
Adaptive control is a classical control method for complex cyber-physical systems, including transportation networks. In this work, we analyze the convergence properties of such methods on exemplar graphs, both theoretically and…
We give the first example of a connected 4-regular graph whose Laplace operator's spectrum is a Cantor set, as well as several other computations of spectra following a common ``finite approximation'' method. These spectra are simple…
In this paper we consider two classes of random Hamiltonians on $L^2(\RR^d)$ one that imitates the lattice case and the other a Schr\"odinger operator with non-decaying, non-sparse potential both of which exhibit a.c. spectrum. In the…