Related papers: The spectrum of the averaging operator on a networ…
For any multi-graph $G$ with edge weights and vertex potential, and its universal covering tree $\mathcal{T}$, we completely characterize the point spectrum of operators $A_{\mathcal{T}}$ on $\mathcal{T}$ arising as pull-backs of local,…
A metric tree is a tree whose edges are viewed as line segments of positive length. The Dirac operator on such tree is the operator which operates on each edge, complemented by the matching conditions at the vertices which were given by…
Due to the limited resources and the scale of the graphs in modern datasets, we often get to observe a sampled subgraph of a larger original graph of interest, whether it is the worldwide web that has been crawled or social connections that…
In this paper we investigate the reachability and observability properties of a network system, running a Laplacian based average consensus algorithm, when the communication graph is a path or a cycle. More in detail, we provide necessary…
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 a non-backtracking Laplace operator for graphs and we investigate its spectral properties. With the use of both theoretical and computational techniques, we show that the spectrum of this operator captures several structural…
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…
The total communicability of a network (or graph) is defined as the sum of the entries in the exponential of the adjacency matrix of the network, possibly normalized by the number of nodes. This quantity offers a good measure of how easily…
The links of a physical network cannot cross, which often forces the network layout into non-optimal entangled states. Here we define a network fabric as a two-dimensional projection of a network and propose the average crossing number as a…
We study relations between spectra of two operators that are connected to each other through some intertwining conditions. As application we obtain new results on the spectra of multiplication operators on $B(\cl H)$ relating it to the…
We consider the averaging process on a graph, that is the evolution of a mass distribution undergoing repeated averages along the edges of the graph at the arrival times of independent Poisson processes. We establish cutoff phenomena for…
Given a self-adjoint operator H, a self-adjoint trace class operator V and a fixed Hilbert-Schmidt operator F with trivial kernel and co-kernel, using limiting absorption principle an explicit set of full Lebesgue measure is defined such…
Let X be a finite set of complex numbers and let A be a normal operator with spectrum X that acts on a separable Hilbert space H. Relative to a fixed orthonormal basis e_1,e_2, ... for H, A gives rise to a matrix whose diagonal is a…
Virtually all network analyses involve structural measures between pairs of vertices, or of the vertices themselves, and the large amount of symmetry present in real-world complex networks is inherited by such measures. This has practical…
This paper explores a version of the classical Ces`aro integral operator for the Lebesgue space L2(0, 1) where we discuss its norm, adjoint, spectral properties, and invariant subspaces. An important tool will be semigroups of weighted…
An averaging operator on an associative algebra $A$ is an algebraic abstraction of the time average operator on the space of real-valued functions defined in time-space. In this paper, we consider relative averaging operators on a bimodule…
We consider the normalized Laplace operator for directed graphs with positive and negative edge weights. This generalization of the normalized Laplace operator for undirected graphs is used to characterize directed acyclic graphs. Moreover,…
A metrized graph is a finite weighted graph whose edges are thought of as line segments. In this expository paper, we study the Laplacian operator on a metrized graph and some important functions related to it, including the ``j-function'',…
A closure operator on a set $X$ is a function $\operatorname{cl}: \wp(X) \to \wp(X)$ satisfying, for all $A, B \subseteq X$, the following properties: extensivity, $A \subseteq \operatorname{cl}(A)$; monotonicity, which states that if $A…
This paper is devoted to the spectral theory of the Schr\"{o}dinger operator on the simplest fractal: Dyson's hierarchical lattice. An explicit description of the spectrum, eigenfunctions, resolvent and parabolic kernel are provided for the…