36,400 research outputs found
Spectra of complex networks
We propose a general approach to the description of spectra of complex
networks. For the spectra of networks with uncorrelated vertices (and a local
tree-like structure), exact equations are derived. These equations are
generalized to the case of networks with correlations between neighboring
vertices. The tail of the density of eigenvalues at large
is related to the behavior of the vertex degree distribution
at large . In particular, as , . We propose a simple approximation, which enables us to
calculate spectra of various graphs analytically. We analyse spectra of various
complex networks and discuss the role of vertices of low degree. We show that
spectra of locally tree-like random graphs may serve as a starting point in the
analysis of spectral properties of real-world networks, e.g., of the Internet.Comment: 10 pages, 4 figure
On the Spectrum of Hecke Type Operators related to some Fractal Groups
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 transforms of the Julia sets associated to some quadratic maps. The
graphs involved are Schreier graphs of fractal groups of intermediate growth,
and are also ``substitutional graphs''. We also formulate our results in terms
of Hecke type operators related to some irreducible quasi-regular
representations of fractal groups and in terms of the Markovian operator
associated to noncommutative dynamical systems via which these fractal groups
were originally defined. In the computations we performed, the self-similarity
of the groups is reflected in the self-similarity of some operators; they are
approximated by finite counterparts whose spectrum is computed by an ad hoc
factorization process.Comment: 1 color figure, 2 color diagrams, many figure
From self-similar groups to self-similar sets and spectra
The survey presents developments in the theory of self-similar groups leading
to applications to the study of fractal sets and graphs, and their associated
spectra
Line-Graph Lattices: Euclidean and Non-Euclidean Flat Bands, and Implementations in Circuit Quantum Electrodynamics
Materials science and the study of the electronic properties of solids are a
major field of interest in both physics and engineering. The starting point for
all such calculations is single-electron, or non-interacting, band structure
calculations, and in the limit of strong on-site confinement this can be
reduced to graph-like tight-binding models. In this context, both
mathematicians and physicists have developed largely independent methods for
solving these models. In this paper we will combine and present results from
both fields. In particular, we will discuss a class of lattices which can be
realized as line graphs of other lattices, both in Euclidean and hyperbolic
space. These lattices display highly unusual features including flat bands and
localized eigenstates of compact support. We will use the methods of both
fields to show how these properties arise and systems for classifying the
phenomenology of these lattices, as well as criteria for maximizing the gaps.
Furthermore, we will present a particular hardware implementation using
superconducting coplanar waveguide resonators that can realize a wide variety
of these lattices in both non-interacting and interacting form
- …