Gaussianization of the spectra of graphs and networks. Theory and applications
From MaRDI portal
Publication:1630605
DOI10.1016/j.jmaa.2018.10.039zbMath1401.05178OpenAlexW2896001573MaRDI QIDQ1630605
Ernesto Estrada, Alhanouf Alhomaidhi, Fawzi A. Al-Thukair
Publication date: 10 December 2018
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2018.10.039
matrix functionsspectral graph theorycomplex networkstight-binding HamiltonianGaussian matrix function
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
Double Gaussianization of graph spectra ⋮ The many facets of the Estrada indices of graphs and networks ⋮ A spectral method to detect community structure based on the communicability modularity ⋮ Matrix functions in network analysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectral characterizations of almost complete graphs
- Accounting for the role of long walks on networks via a new matrix function
- Characteristic vectors of bordered matrices with infinite dimensions
- Spektren endlicher Grafen
- A note on the graph's resolvent and the multifilar structure
- Clustering of spectra and fractals of regular graphs
- On multiple eigenvalues of trees
- On the spectrum of a complete multipartite graph
- Generalized walks-based centrality measures for complex biological networks
- Ranking hubs and authorities using matrix functions
- Parallel empirical pseudopotential electronic structure calculations for million atom systems
- Lower bounds for Gaussian Estrada index of graphs
- Network bipartivity and the transportation efficiency of European passenger airlines
- Estimating the Estrada index
- What is the meaning of the graph energy after all?
- A new status index derived from sociometric analysis
- Network Properties Revealed through Matrix Functions
- Emergence of Scaling in Random Networks
- Updating and Downdating Techniques for Optimizing Network Communicability
- The electron density function of the Hückel (tight-binding) model
- Exploring the “Middle Earth” of network spectra via a Gaussian matrix function
- The Largest Eigenvalue of Sparse Random Graphs
- On the Limiting Behavior of Parameter-Dependent Network Centrality Measures
- Functions of Matrices
