ReP USP - Resultado da busca

Artigo de periodico
Vertex-wise graph’s spectral density decomposition and its applications (2025)
Guzman, Grover Enrique Castro ; Takahashi, Daniel Yasumasa ; Fujita, André
Source: Journal of Complex Networks. Unidade: IME
Subjects: GRAFOS ALEATÓRIOS, ÁLGEBRA LINEAR NUMÉRICA, REDES COMPLEXAS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
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: 08 out. 2025.
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 2025 out. 08 ] 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 2025 out. 08 ] Available from: https://doi.org/10.1093/comnet/cnaf013
Artigo de periodico
Statistical methods for hypergraphs: a parameter estimator, a model selection, and a comparative test (2025)
Guzman, Grover Enrique Castro ; Fujita, André
Source: Journal of Complex Networks. Unidade: IME
Subjects: SELEÇÃO DE MODELOS, ESPECTROS, OPERADORES, TEORIA DOS GRAFOS, GRAFOS ALEATÓRIOS, INFERÊNCIA PARAMÉTRICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GUZMAN, Grover Enrique Castro e FUJITA, André. Statistical methods for hypergraphs: a parameter estimator, a model selection, and a comparative test. Journal of Complex Networks, v. 13, n. 4, p. 1-16, 2025Tradução . . Disponível em: https://doi.org/10.1093/comnet/cnaf019. Acesso em: 08 out. 2025.
APA
Guzman, G. E. C., & Fujita, A. (2025). Statistical methods for hypergraphs: a parameter estimator, a model selection, and a comparative test. Journal of Complex Networks, 13( 4), 1-16. doi:10.1093/comnet/cnaf019
NLM
Guzman GEC, Fujita A. Statistical methods for hypergraphs: a parameter estimator, a model selection, and a comparative test [Internet]. Journal of Complex Networks. 2025 ; 13( 4): 1-16.[citado 2025 out. 08 ] Available from: https://doi.org/10.1093/comnet/cnaf019
Vancouver
Guzman GEC, Fujita A. Statistical methods for hypergraphs: a parameter estimator, a model selection, and a comparative test [Internet]. Journal of Complex Networks. 2025 ; 13( 4): 1-16.[citado 2025 out. 08 ] Available from: https://doi.org/10.1093/comnet/cnaf019
Artigo de periodico
Predicting soccer matches with complex networks and machine learning (2024)
Baratela, Eduardo Alves; Xavier, Felipe Jordão; Peron, Thomas ; Villas Boas, Paulino Ribeiro ; Rodrigues, Francisco Aparecido
Source: Journal of Complex Networks. Unidade: ICMC
Subjects: REDES COMPLEXAS, FUTEBOL, ANÁLISE ESTATÍSTICA DE DADOS, APRENDIZADO COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BARATELA, Eduardo Alves et al. Predicting soccer matches with complex networks and machine learning. Journal of Complex Networks, v. 12, n. 6, p. 1-16, 2024Tradução . . Disponível em: https://doi.org/10.1093/comnet/cnae043. Acesso em: 08 out. 2025.
APA
Baratela, E. A., Xavier, F. J., Peron, T., Villas Boas, P. R., & Rodrigues, F. A. (2024). Predicting soccer matches with complex networks and machine learning. Journal of Complex Networks, 12( 6), 1-16. doi:10.1093/comnet/cnae043
NLM
Baratela EA, Xavier FJ, Peron T, Villas Boas PR, Rodrigues FA. Predicting soccer matches with complex networks and machine learning [Internet]. Journal of Complex Networks. 2024 ; 12( 6): 1-16.[citado 2025 out. 08 ] Available from: https://doi.org/10.1093/comnet/cnae043
Vancouver
Baratela EA, Xavier FJ, Peron T, Villas Boas PR, Rodrigues FA. Predicting soccer matches with complex networks and machine learning [Internet]. Journal of Complex Networks. 2024 ; 12( 6): 1-16.[citado 2025 out. 08 ] Available from: https://doi.org/10.1093/comnet/cnae043
Artigo de periodico
A fast algorithm to approximate the spectral density of locally tree-like networks with assortativity (2023)
Guzman, Grover Enrique Castro ; Fujita, André
Source: Journal of Complex Networks. Unidade: IME
Subjects: GRAFOS ALEATÓRIOS, TEORIA ESPECTRAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GUZMAN, Grover Enrique Castro e FUJITA, André. A fast algorithm to approximate the spectral density of locally tree-like networks with assortativity. Journal of Complex Networks, v. 11, n. 2, p. 1-15, 2023Tradução . . Disponível em: https://doi.org/10.1093/comnet/cnad005. Acesso em: 08 out. 2025.
APA
Guzman, G. E. C., & Fujita, A. (2023). A fast algorithm to approximate the spectral density of locally tree-like networks with assortativity. Journal of Complex Networks, 11( 2), 1-15. doi:10.1093/comnet/cnad005
NLM
Guzman GEC, Fujita A. A fast algorithm to approximate the spectral density of locally tree-like networks with assortativity [Internet]. Journal of Complex Networks. 2023 ; 11( 2): 1-15.[citado 2025 out. 08 ] Available from: https://doi.org/10.1093/comnet/cnad005
Vancouver
Guzman GEC, Fujita A. A fast algorithm to approximate the spectral density of locally tree-like networks with assortativity [Internet]. Journal of Complex Networks. 2023 ; 11( 2): 1-15.[citado 2025 out. 08 ] Available from: https://doi.org/10.1093/comnet/cnad005
Artigo de periodico
Analysis of quantile graphs in EGC data from elderly and young individuals using machine learning and deep learning (2023)
Pineda, Aruane Mello ; Rodrigues, Francisco Aparecido ; Alves, Caroline Lourenço ; Möckel, Michael; Oliveira, Thaise Graziele Lima de ; Porto, Joel Augusto Moura
Source: Journal of Complex Networks. Unidades: ICMC, IFSC
Subjects: TECNOLOGIAS DA SAÚDE, APRENDIZADO COMPUTACIONAL, REDES COMPLEXAS, RECONHECIMENTO DE IMAGEM, DIAGNÓSTICO POR COMPUTADOR, DOENÇAS VASCULARES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
PINEDA, Aruane Mello et al. Analysis of quantile graphs in EGC data from elderly and young individuals using machine learning and deep learning. Journal of Complex Networks, v. 11, n. 5, p. cnad030-1-cnad030-21, 2023Tradução . . Disponível em: https://doi.org/10.1093/comnet/cnad030. Acesso em: 08 out. 2025.
APA
Pineda, A. M., Rodrigues, F. A., Alves, C. L., Möckel, M., Oliveira, T. G. L. de, & Porto, J. A. M. (2023). Analysis of quantile graphs in EGC data from elderly and young individuals using machine learning and deep learning. Journal of Complex Networks, 11( 5), cnad030-1-cnad030-21. doi:10.1093/comnet/cnad030
NLM
Pineda AM, Rodrigues FA, Alves CL, Möckel M, Oliveira TGL de, Porto JAM. Analysis of quantile graphs in EGC data from elderly and young individuals using machine learning and deep learning [Internet]. Journal of Complex Networks. 2023 ; 11( 5): cnad030-1-cnad030-21.[citado 2025 out. 08 ] Available from: https://doi.org/10.1093/comnet/cnad030
Vancouver
Pineda AM, Rodrigues FA, Alves CL, Möckel M, Oliveira TGL de, Porto JAM. Analysis of quantile graphs in EGC data from elderly and young individuals using machine learning and deep learning [Internet]. Journal of Complex Networks. 2023 ; 11( 5): cnad030-1-cnad030-21.[citado 2025 out. 08 ] Available from: https://doi.org/10.1093/comnet/cnad030
Artigo de periodico
A fast parameter estimator for large complex networks (2022)
Guzman, Grover Enrique Castro ; Takahashi, Daniel Yasumasa; 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 TAKAHASHI, Daniel Yasumasa e FUJITA, André. A fast parameter estimator for large complex networks. Journal of Complex Networks, v. 10, n. artigo cnac022. p. 1-11, 2022Tradução . . Disponível em: https://doi.org/10.1093/comnet/cnac022. Acesso em: 08 out. 2025.
APA
Guzman, G. E. C., Takahashi, D. Y., & Fujita, A. (2022). A fast parameter estimator for large complex networks. Journal of Complex Networks, 10( artigo cnac022. p. 1-11). doi:10.1093/comnet/cnac022
NLM
Guzman GEC, Takahashi DY, Fujita A. A fast parameter estimator for large complex networks [Internet]. Journal of Complex Networks. 2022 ; 10( artigo cnac022. p. 1-11):[citado 2025 out. 08 ] Available from: https://doi.org/10.1093/comnet/cnac022
Vancouver
Guzman GEC, Takahashi DY, Fujita A. A fast parameter estimator for large complex networks [Internet]. Journal of Complex Networks. 2022 ; 10( artigo cnac022. p. 1-11):[citado 2025 out. 08 ] Available from: https://doi.org/10.1093/comnet/cnac022
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: 08 out. 2025.
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 2025 out. 08 ] 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 2025 out. 08 ] Available from: https://doi.org/10.1093/comnet/cnac040
Artigo de periodico
Spectral density of random graphs: convergence properties and application in model fitting (2021)
Santos, Suzana de Siqueira ; Fujita, André ; Matias, Catherine
Source: Journal of Complex Networks. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SANTOS, Suzana de Siqueira e FUJITA, André e MATIAS, Catherine. Spectral density of random graphs: convergence properties and application in model fitting. Journal of Complex Networks, v. 9, n. 6, p. 1-27, 2021Tradução . . Disponível em: https://doi.org/10.1093/comnet/cnab041. Acesso em: 08 out. 2025.
APA
Santos, S. de S., Fujita, A., & Matias, C. (2021). Spectral density of random graphs: convergence properties and application in model fitting. Journal of Complex Networks, 9( 6), 1-27. doi:10.1093/comnet/cnab041
NLM
Santos S de S, Fujita A, Matias C. Spectral density of random graphs: convergence properties and application in model fitting [Internet]. Journal of Complex Networks. 2021 ; 9( 6): 1-27.[citado 2025 out. 08 ] Available from: https://doi.org/10.1093/comnet/cnab041
Vancouver
Santos S de S, Fujita A, Matias C. Spectral density of random graphs: convergence properties and application in model fitting [Internet]. Journal of Complex Networks. 2021 ; 9( 6): 1-27.[citado 2025 out. 08 ] Available from: https://doi.org/10.1093/comnet/cnab041
Artigo de periodico
A semi-parametric statistical test to compare complex networks (2020)
Fujita, André ; Lira, Eduardo Silva ; Santos, Suzana de Siqueira ; Bando, Sílvia Yumi ; Soares, Gabriela Eleuterio ; Takahashi, Daniel Yasumasa
Source: Journal of Complex Networks. Unidades: IME, FM, EEFERP
Subjects: INFERÊNCIA PARAMÉTRICA, BIOINFORMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FUJITA, André et al. A semi-parametric statistical test to compare complex networks. Journal of Complex Networks, v. 8, n. 2, 2020Tradução . . Disponível em: https://doi.org/10.1093/comnet/cnz028. Acesso em: 08 out. 2025.
APA
Fujita, A., Lira, E. S., Santos, S. de S., Bando, S. Y., Soares, G. E., & Takahashi, D. Y. (2020). A semi-parametric statistical test to compare complex networks. Journal of Complex Networks, 8( 2). doi:10.1093/comnet/cnz028
NLM
Fujita A, Lira ES, Santos S de S, Bando SY, Soares GE, Takahashi DY. A semi-parametric statistical test to compare complex networks [Internet]. Journal of Complex Networks. 2020 ; 8( 2):[citado 2025 out. 08 ] Available from: https://doi.org/10.1093/comnet/cnz028
Vancouver
Fujita A, Lira ES, Santos S de S, Bando SY, Soares GE, Takahashi DY. A semi-parametric statistical test to compare complex networks [Internet]. Journal of Complex Networks. 2020 ; 8( 2):[citado 2025 out. 08 ] Available from: https://doi.org/10.1093/comnet/cnz028
Artigo de periodico
Labelled network subgraphs reveal stylistic subtleties in written texts (2018)
Marinho, Vanessa Queiroz; Hirst, Graeme; Amancio, Diego Raphael
Source: Journal of Complex Networks. Unidade: ICMC
Subjects: REDES COMPLEXAS, PROCESSAMENTO DE LINGUAGEM NATURAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MARINHO, Vanessa Queiroz e HIRST, Graeme e AMANCIO, Diego Raphael. Labelled network subgraphs reveal stylistic subtleties in written texts. Journal of Complex Networks, v. 6, n. 4, p. 620-638, 2018Tradução . . Disponível em: https://doi.org/10.1093/comnet/cnx047. Acesso em: 08 out. 2025.
APA
Marinho, V. Q., Hirst, G., & Amancio, D. R. (2018). Labelled network subgraphs reveal stylistic subtleties in written texts. Journal of Complex Networks, 6( 4), 620-638. doi:10.1093/comnet/cnx047
NLM
Marinho VQ, Hirst G, Amancio DR. Labelled network subgraphs reveal stylistic subtleties in written texts [Internet]. Journal of Complex Networks. 2018 ; 6( 4): 620-638.[citado 2025 out. 08 ] Available from: https://doi.org/10.1093/comnet/cnx047
Vancouver
Marinho VQ, Hirst G, Amancio DR. Labelled network subgraphs reveal stylistic subtleties in written texts [Internet]. Journal of Complex Networks. 2018 ; 6( 4): 620-638.[citado 2025 out. 08 ] Available from: https://doi.org/10.1093/comnet/cnx047
Artigo de periodico
A general Markov chain approach for disease and rumour spreading in complex networks (2018)
Arruda, Guilherme Ferraz de; Rodrigues, Francisco Aparecido ; Rodriguez, Pablo Martin; Cozzo, Emanuele; Moreno, Yamir
Source: Journal of Complex Networks. Unidade: ICMC
Subjects: REDES COMPLEXAS, TEORIA DOS GRAFOS, PROBABILIDADE, INFERÊNCIA ESTATÍSTICA, PROCESSOS ESTOCÁSTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ARRUDA, Guilherme Ferraz de et al. A general Markov chain approach for disease and rumour spreading in complex networks. Journal of Complex Networks, v. 6, n. 2, p. 215-242, 2018Tradução . . Disponível em: https://doi.org/10.1093/comnet/cnx024. Acesso em: 08 out. 2025.
APA
Arruda, G. F. de, Rodrigues, F. A., Rodriguez, P. M., Cozzo, E., & Moreno, Y. (2018). A general Markov chain approach for disease and rumour spreading in complex networks. Journal of Complex Networks, 6( 2), 215-242. doi:10.1093/comnet/cnx024
NLM
Arruda GF de, Rodrigues FA, Rodriguez PM, Cozzo E, Moreno Y. A general Markov chain approach for disease and rumour spreading in complex networks [Internet]. Journal of Complex Networks. 2018 ; 6( 2): 215-242.[citado 2025 out. 08 ] Available from: https://doi.org/10.1093/comnet/cnx024
Vancouver
Arruda GF de, Rodrigues FA, Rodriguez PM, Cozzo E, Moreno Y. A general Markov chain approach for disease and rumour spreading in complex networks [Internet]. Journal of Complex Networks. 2018 ; 6( 2): 215-242.[citado 2025 out. 08 ] Available from: https://doi.org/10.1093/comnet/cnx024
Artigo de periodico
Representation of texts as complex networks: a mesoscopic approach (2018)
Arruda, Henrique Ferraz de; Silva, Filipi Nascimento; Marinho, Vanessa Queiroz; Amancio, Diego Raphael ; Costa, Luciano da Fontoura
Source: Journal of Complex Networks. Unidades: ICMC, IFSC
Subjects: REDES COMPLEXAS, ANÁLISE DE TEXTO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ARRUDA, Henrique Ferraz de et al. Representation of texts as complex networks: a mesoscopic approach. Journal of Complex Networks, v. 6, n. 1, p. 125-144, 2018Tradução . . Disponível em: https://doi.org/10.1093/comnet/cnx023. Acesso em: 08 out. 2025.
APA
Arruda, H. F. de, Silva, F. N., Marinho, V. Q., Amancio, D. R., & Costa, L. da F. (2018). Representation of texts as complex networks: a mesoscopic approach. Journal of Complex Networks, 6( 1), 125-144. doi:10.1093/comnet/cnx023
NLM
Arruda HF de, Silva FN, Marinho VQ, Amancio DR, Costa L da F. Representation of texts as complex networks: a mesoscopic approach [Internet]. Journal of Complex Networks. 2018 ; 6( 1): 125-144.[citado 2025 out. 08 ] Available from: https://doi.org/10.1093/comnet/cnx023
Vancouver
Arruda HF de, Silva FN, Marinho VQ, Amancio DR, Costa L da F. Representation of texts as complex networks: a mesoscopic approach [Internet]. Journal of Complex Networks. 2018 ; 6( 1): 125-144.[citado 2025 out. 08 ] Available from: https://doi.org/10.1093/comnet/cnx023
Artigo de periodico
Predicting efficiency in master-slave grid computing systems (2013)
Travieso, Gonzalo ; Ruggiero, Carlos Antônio; Bruno, Odemir Martinez ; Costa, Luciano da Fontoura
Source: Journal of Complex Networks. Unidade: IFSC
Subjects: TOPOLOGIA EM COMPUTAÇÃO, REDES COMPLEXAS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TRAVIESO, Gonzalo et al. Predicting efficiency in master-slave grid computing systems. Journal of Complex Networks, v. 1, n. 1, p. 63-71, 2013Tradução . . Disponível em: https://doi.org/10.1093/comnet/cnt005. Acesso em: 08 out. 2025.
APA
Travieso, G., Ruggiero, C. A., Bruno, O. M., & Costa, L. da F. (2013). Predicting efficiency in master-slave grid computing systems. Journal of Complex Networks, 1( 1), 63-71. doi:10.1093/comnet/cnt005
NLM
Travieso G, Ruggiero CA, Bruno OM, Costa L da F. Predicting efficiency in master-slave grid computing systems [Internet]. Journal of Complex Networks. 2013 ; 1( 1): 63-71.[citado 2025 out. 08 ] Available from: https://doi.org/10.1093/comnet/cnt005
Vancouver
Travieso G, Ruggiero CA, Bruno OM, Costa L da F. Predicting efficiency in master-slave grid computing systems [Internet]. Journal of Complex Networks. 2013 ; 1( 1): 63-71.[citado 2025 out. 08 ] Available from: https://doi.org/10.1093/comnet/cnt005

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Date published

Subjects

Funding Agencies

Indexado em

Non normalized affiliation

Countries of institutions of collaboration