Asymptotic spectra of large (grid) graphs with a uniform local structure (part II): numerical applications

by   Andrea Adriani, et al.

In the current work we are concerned with sequences of graphs having a grid geometry, with a uniform local structure in a bounded domain Ω⊂ℝ^d, d≥ 1. When Ω=[0,1], such graphs include the standard Toeplitz graphs and, for Ω=[0,1]^d, the considered class includes d-level Toeplitz graphs. In the general case, the underlying sequence of adjacency matrices has a canonical eigenvalue distribution, in the Weyl sense, and it has been shown in the theoretical part of this work that we can associate to it a symbol 𝔣. The knowledge of the symbol and of its basic analytical features provides key information on the eigenvalue structure in terms of localization, spectral gap, clustering, and global distribution. In the present paper, many different applications are discussed and various numerical examples are presented in order to underline the practical use of the developed theory. Tests and applications are mainly obtained from the approximation of differential operators via numerical schemes such as Finite Differences (FDs), Finite Elements (FEs), and Isogeometric Analysis (IgA). Moreover, we show that more applications can be taken into account, since the results presented here can be applied as well to study the spectral properties of adjacency matrices and Laplacian operators of general large graphs and networks, whenever the involved matrices enjoy a uniform local structure.


page 1

page 2

page 3

page 4


Asymptotic spectra of large (grid) graphs with a uniform local structure

We are concerned with sequences of graphs having a grid geometry, with a...

Efficient numerical computation of the basic reproduction number for structured populations

As widely known, the basic reproduction number plays a key role in weigh...

Analysis of the spectral symbol function for spectral approximation of a differential operator

Given a differential operator L along with its own eigenvalue problem Lu...

Spectral Analysis Of Weighted Laplacians Arising In Data Clustering

Graph Laplacians computed from weighted adjacency matrices are widely us...

Spectral analysis and fast methods for large matrices arising from PDE approximation

The main goal of this thesis is to show the crucial role that plays the ...

Random Schreier graphs of the general linear group over finite fields and expanders

In this paper we discuss potentially practical ways to produce expander ...

Please sign up or login with your details

Forgot password? Click here to reset