Bounds for entries of matrix functions based on Gauss-type quadrature rules are applied to adjacency matrices associated with graphs. This technique allows to develop inexpensive and accurate upper and lower bounds for certain quantities (Estrada index, subgraph centrality, communicability) that describe properties of networks. © 2010 Elsevier Inc. All rights reserved.

Quadrature rule-based bounds for functions of adjacency matrices

Benzi, Michele;BOITO, Paola
2010

Abstract

Bounds for entries of matrix functions based on Gauss-type quadrature rules are applied to adjacency matrices associated with graphs. This technique allows to develop inexpensive and accurate upper and lower bounds for certain quantities (Estrada index, subgraph centrality, communicability) that describe properties of networks. © 2010 Elsevier Inc. All rights reserved.
2010
Communicability; Decay bounds; Estrada index; Graphs; Lanczos algorithm; Matrix exponential; Networks; Quadrature rules; Resolvent; Sparse matrices; Subgraph centrality; Algebra and Number Theory; Numerical Analysis; Geometry and Topology; Discrete Mathematics and Combinatorics
1.1 Articolo in rivista
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11384/75264
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 62
  • ???jsp.display-item.citation.isi??? 60
  • OpenAlex ND
social impact