Vertex-wise graph’s spectral density decomposition and its applications (2025)
- Authors:
- USP affiliated authors: FUJITA, ANDRÉ - IME ; GUZMÁN, GROVER ENRIQUE CASTRO - IME
- Unidade: IME
- DOI: 10.1093/comnet/cnaf013
- Subjects: GRAFOS ALEATÓRIOS; ÁLGEBRA LINEAR NUMÉRICA; REDES COMPLEXAS
- Keywords: Spectral distribution; vertex decomposition; random graphs; localization
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Journal of Complex Networks
- ISSN: 2051-1329
- Volume/Número/Paginação/Ano: v. 13, n. 4, p. 1-18, 2025
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
GUZMAN, Grover Enrique Castro e TAKAHASHI, Daniel Yasumasa e FUJITA, André. Vertex-wise graph’s spectral density decomposition and its applications. Journal of Complex Networks, v. 13, n. 4, p. 1-18, 2025Tradução . . Disponível em: https://doi.org/10.1093/comnet/cnaf013. Acesso em: 12 fev. 2026. -
APA
Guzman, G. E. C., Takahashi, D. Y., & Fujita, A. (2025). Vertex-wise graph’s spectral density decomposition and its applications. Journal of Complex Networks, 13( 4), 1-18. doi:10.1093/comnet/cnaf013 -
NLM
Guzman GEC, Takahashi DY, Fujita A. Vertex-wise graph’s spectral density decomposition and its applications [Internet]. Journal of Complex Networks. 2025 ; 13( 4): 1-18.[citado 2026 fev. 12 ] Available from: https://doi.org/10.1093/comnet/cnaf013 -
Vancouver
Guzman GEC, Takahashi DY, Fujita A. Vertex-wise graph’s spectral density decomposition and its applications [Internet]. Journal of Complex Networks. 2025 ; 13( 4): 1-18.[citado 2026 fev. 12 ] Available from: https://doi.org/10.1093/comnet/cnaf013 - Primitive, edge-short, isometric, and pantochordal cycles
- StatGraph: an R package for complex network statistical analyses based on spectrum
- 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
- Efficient Laplacian spectral density computations for networks with arbitrary degree distributions
- 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.1093/comnet/cnaf013 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3259028_-_Vertex-wise_gra... | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
