Efficient Laplacian spectral density computations for networks with arbitrary degree distributions (2021)
- Authors:
- USP affiliated authors: FUJITA, ANDRÉ - IME ; GUZMÁN, GROVER ENRIQUE CASTRO - IME
- Unidade: IME
- DOI: 10.1017/nws.2021.10
- Assunto: TEORIA DOS GRAFOS
- Keywords: spectral density; Laplacian matrix; normalized Laplacian matrix; configuration model tree-like network
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Network Science
- ISSN: 2050-1242
- Volume/Número/Paginação/Ano: v. 9, n. 3, p. 312-327, 2021
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
GUZMAN, Grover Enrique Castro e STADLER, Peter F. e FUJITA, André. Efficient Laplacian spectral density computations for networks with arbitrary degree distributions. Network Science, v. 9, n. 3, p. 312-327, 2021Tradução . . Disponível em: https://doi.org/10.1017/nws.2021.10. Acesso em: 12 fev. 2026. -
APA
Guzman, G. E. C., Stadler, P. F., & Fujita, A. (2021). Efficient Laplacian spectral density computations for networks with arbitrary degree distributions. Network Science, 9( 3), 312-327. doi:10.1017/nws.2021.10 -
NLM
Guzman GEC, Stadler PF, Fujita A. Efficient Laplacian spectral density computations for networks with arbitrary degree distributions [Internet]. Network Science. 2021 ; 9( 3): 312-327.[citado 2026 fev. 12 ] Available from: https://doi.org/10.1017/nws.2021.10 -
Vancouver
Guzman GEC, Stadler PF, Fujita A. Efficient Laplacian spectral density computations for networks with arbitrary degree distributions [Internet]. Network Science. 2021 ; 9( 3): 312-327.[citado 2026 fev. 12 ] Available from: https://doi.org/10.1017/nws.2021.10 - Primitive, edge-short, isometric, and pantochordal cycles
- StatGraph: an R package for complex network statistical analyses based on spectrum
- Vertex-wise graph’s spectral density decomposition and its applications
- A fast algorithm to approximate the spectral density of locally tree-like networks with assortativity
- A fast parameter estimator for large complex networks
- A message-passing approach to obtain the trace of matrix functions with applications to network analysis
- Spectral densities approximations of incidence-based locally treelike hypergraph matrices via the cavity method
- Convolution-based linear discriminant analysis for functional data classification
- Statistical methods for hypergraphs: a parameter estimator, a model selection, and a comparative test
- Cavity approach for the approximation of spectral density of graphs with heterogeneous structures
Informações sobre o DOI: 10.1017/nws.2021.10 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3049748.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
