Related papers: The graph, range and level set singularity spectra…
The scaling properties of spectra of real world complex networks are studied by using the wavelet transform. It is found that the spectra of networks are multifractal. According to the values of the long-range correlation exponent, the Hust…
The paper considers the spectral determinant of quantum graph families with chaotic classical limit and no symmetries. The secular coefficients of the spectral determinant are found to follow distributions with zero mean and variance…
For a given self-adjoint operator $A$ with discrete spectrum, we completely characterize possible eigenvalues of its rank-one perturbations~$B$ and discuss the inverse problem of reconstructing $B$ from its spectrum.
We investigate stochastic processes possessing scale invariance properties which we refer to as multifractal processes. The examples of such processes known so far do not go much beyond the original cascade construction of Mandelbrot. We…
Many natural and social systems develop complex networks, that are usually modelled as random graphs. The eigenvalue spectrum of these graphs provides information about their structural properties. While the semi-circle law is known to…
Conjecturally, almost all graphs are determined by their spectra. This problem has also been studied for variants such as the spectra of the Laplacian and signless Laplacian. Here we consider the problem of determining graphs with Ihara and…
In this article we consider the connection of separating finctions $\rho_r$ with locally scalar representations of graphs and with spectral graph theory.
Spanning trees of complete bipartite graphs exhibit a rich interaction between degree sequences and graph structure. In this paper, we obtain lower bounds on the number of isomorphism classes of spanning trees in $K_{a,b}, 2 \leq a \leq b$…
We develop eigenvalue estimates for the Laplacians on discrete and metric graphs using different types of boundary conditions at the vertices of the metric graph. Via an explicit correspondence of the equilateral metric and discrete graph…
It is well-known that the spectral radius of a connected uniform hypergraph is an eigenvalue of the hypergraph. However, its algebraic multiplicity remains unknown. In this paper, we use the Poisson Formula and matching polynomials to…
Let G be a simple connected graph of order n with degree sequence d_1, d_2, ..., d_n in non-increasing order. The spectral radius rho(G) of G is the largest eigenvalue of its adjacency matrix. For each positive integer L at most n, we give…
We consider the random hypergraph on a finite vertex set by choosing each set of vertices as an hyperedge independently at random. We express the probability distributions of the (lower-)associated simplicial complex and the…
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…
We present a general method for obtaining the spectra of large graphs with short cycles using ideas from statistical mechanics of disordered systems. This approach leads to an algorithm that determines the spectra of graphs up to a high…
We compute the spectral statistics of the sum H of two independent complex Wishart matrices, each of which is correlated with a different covariance matrix. Random matrix theory enjoys many applications including sums and products of random…
The bounded degree complex $BD(G,\lambda)$ is a generalization of the matching complexes of a graph. In this paper, we show that the bounded degree complex of a forest is shellable, by using independence complexes of hypergraphs. We obtain…
The spectrum of the $k$-power hypergraph of a graph $G$ is called the $k$-ordered spectrum of $G$.If graphs $G_1$ and $G_2$ have same $k$-ordered spectrum for all positive integer $k\geq2$, $G_1$ and $G_2$ are said to be high-ordered…
In this article, we explore the concept of spectral redundancy within the class of pineapple graphs, denoted as $\mathcal{P}(\alpha,\beta)$. These graphs are constructed by attaching $\beta$ pendent edges to a single vertex of a complete…
The covering spectrum is a geometric invariant of a Riemannian manifold, more generally of a metric space, that measures the size of its one-dimensional holes by isolating a portion of the length spectrum. In a previous paper we…
The method of spectral decimation is applied to an infinite collection of self--similar fractals. The sets considered belong to the class of nested fractals, and are thus very symmetric. An explicit construction is given to obtain formulas…