ReP USP - Resultado da busca

Artigo de periodico
Cavity approach for the approximation of spectral density of graphs with heterogeneous structures (2024)
Guzman, Grover Enrique Castro ; Stadler, Peter F. ; Fujita, André
Source: Physical Review E. Unidade: IME
Assunto: MÉTODO DE MONTE CARLO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GUZMAN, Grover Enrique Castro e STADLER, Peter F. e FUJITA, André. Cavity approach for the approximation of spectral density of graphs with heterogeneous structures. Physical Review E, v. 109, n. 3, p. 1, 2024Tradução . . Disponível em: https://doi.org/10.1103/PhysRevE.109.034303. Acesso em: 03 set. 2024.
APA
Guzman, G. E. C., Stadler, P. F., & Fujita, A. (2024). Cavity approach for the approximation of spectral density of graphs with heterogeneous structures. Physical Review E, 109( 3), 1. doi:10.1103/PhysRevE.109.034303
NLM
Guzman GEC, Stadler PF, Fujita A. Cavity approach for the approximation of spectral density of graphs with heterogeneous structures [Internet]. Physical Review E. 2024 ; 109( 3): 1.[citado 2024 set. 03 ] Available from: https://doi.org/10.1103/PhysRevE.109.034303
Vancouver
Guzman GEC, Stadler PF, Fujita A. Cavity approach for the approximation of spectral density of graphs with heterogeneous structures [Internet]. Physical Review E. 2024 ; 109( 3): 1.[citado 2024 set. 03 ] Available from: https://doi.org/10.1103/PhysRevE.109.034303
Artigo de periodico
Efficient eigenvalue counts for tree-like networks (2022)
Guzman, Grover Enrique Castro ; Stadler, Peter F. ; Fujita, André
Source: Journal of Complex Networks. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GUZMAN, Grover Enrique Castro e STADLER, Peter F. e FUJITA, André. Efficient eigenvalue counts for tree-like networks. Journal of Complex Networks, v. 10, n. 5, 2022Tradução . . Disponível em: https://doi.org/10.1093/comnet/cnac040. Acesso em: 03 set. 2024.
APA
Guzman, G. E. C., Stadler, P. F., & Fujita, A. (2022). Efficient eigenvalue counts for tree-like networks. Journal of Complex Networks, 10( 5). doi:10.1093/comnet/cnac040
NLM
Guzman GEC, Stadler PF, Fujita A. Efficient eigenvalue counts for tree-like networks [Internet]. Journal of Complex Networks. 2022 ; 10( 5):[citado 2024 set. 03 ] Available from: https://doi.org/10.1093/comnet/cnac040
Vancouver
Guzman GEC, Stadler PF, Fujita A. Efficient eigenvalue counts for tree-like networks [Internet]. Journal of Complex Networks. 2022 ; 10( 5):[citado 2024 set. 03 ] Available from: https://doi.org/10.1093/comnet/cnac040
Artigo de periodico
Efficient Laplacian spectral density computations for networks with arbitrary degree distributions (2021)
Guzman, Grover Enrique Castro ; Stadler, Peter F. ; Fujita, André
Source: Network Science. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
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: 03 set. 2024.
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 2024 set. 03 ] 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 2024 set. 03 ] Available from: https://doi.org/10.1017/nws.2021.10

USP Schools

ReP

Filtros

Funding Agencies