相关论文: The graph, range and level set singularity spectra…

We develop novel methods to compute auto-correlation functions, or power spectral densities, for chaotic dynamical systems generated by an inverse method whose starting point is an invariant distribution and a two-form. In general, the…

Let $(X,E_X)$ and $(V,E_V)$ be finite connected graphs without loops. We assume that $V$ has two distinguished vertices $a,b$ and an automorphism $\gamma$ which exchanges $a$ and~$b$. The $V$-edge substitution of $X$ is the graph $X[V]$…

We present and discuss isospectral quantum graphs which are not isometric. These graphs are the analogues of the isospectral domains in R2 which were introduced recently and are all based on Sunada's construction of isospectral domains.…

We give an upper bound on the maximal eigenvalue of the adjacency matrix of a connected graph in terms of its maximum degree, diameter and order. This bound is best possible up to a constant factor and improves prevoius results of…

The meromorphic functional calculus developed in Part I overcomes the nondiagonalizability of linear operators that arises often in the temporal evolution of complex systems and is generic to the metadynamics of predicting their behavior.…

Interdependent networks are ubiquitous in our society, ranging from infrastructure to economics, and the study of their cascading behaviors using percolation theory has attracted much attention in the recent years. To analyze the…

By Brook's Theorem, every n-vertex graph of maximum degree at most Delta >= 3 and clique number at most Delta is Delta-colorable, and thus it has an independent set of size at least n/Delta. We give an approximate characterization of graphs…

Let G be an arbitrary finite weighted digraph with weights in the set of complex rational functions. A general procedure is proposed which allows for the reduction of G to a smaller graph with a less complicated structure having the same…

A metrized graph is a compact singular 1-manifold endowed with a metric. A given metrized graph can be modelled by a family of weighted combinatorial graphs. If one chooses a sequence of models from this family such that the vertices become…

A theory of sections of simplicial height functions is developed. At the core of this theory lies the section complex, which is assembled from higher section spaces. The latter encode flow lines along the height, as well as their…

For an iterated function system (IFS) of simillitidues, we define two graphs on the representing symbolic space. We show that if the self-similar set $K$ has positive Lebesgue measure or the IFS satisfies the weak separation condition, then…

In this paper we deal with a subclass of chordal graphs, which are simultaneously strictly chordal and interval, the strictly interval graphs. We present a new characterization of the class that leads to a simple linear recognition…

We compute spectra of symmetric random matrices defined on graphs exhibiting a modular structure. Modules are initially introduced as fully connected sub-units of a graph. By contrast, inter-module connectivity is taken to be incomplete.…

Cospectral graphs are a fascinating concept in graph theory, where two non-isomorphic graphs possess identical sets of eigenvalues. In this paper, we compute the $A_\alpha$-characteristic polynomial of neighbour and non-neighbour splitting…

We derive a spectral interpretation of the pivot operation on a graph and generalise this operation to hypergraphs. We establish lower bounds on the number of flat spectra of a Boolean function, depending on internal structures, with…

We define a (pseudo-)distance between graphs based on the spectrum of the normalized Laplacian, which is easy to compute or to estimate numerically. It can therefore serve as a rough classification of large empirical graphs into families…

This paper investigates the asymptotic nature of graph spectra when some edges of a graph are subdivided sufficiently many times. In the special case where all edges of a graph are subdivided, we find the exact limits of the $k$-th largest…

The task of comparing the Hausdorff spectrum, the computational spectrum, and the Legendre spectrum of a fractal set endowed with a probability measure, was tackled by several authors - Cawley and Mauldin, Riedi and Mandelbrot, among…

In this paper, we aim to address the open questions raised in various recent papers regarding characterization of circulant graphs with three or four distinct eigenvalues in their spectra. Our focus is on providing characterizations and…

In this article, we introduce the notion of a wedge of graphs and provide detailed computations for the independence complex of a wedge of path and cycle graphs. In particular, we show that these complexes are either contractible or wedges…