Menu

Filtros : "Journal of Complex Networks" "GRAFOS ALEATÓRIOS" Limpar

Filtros

Limitar por data

  • 1

1 - 3 (3 registros)

  • Artigo de periodico

    Vertex-wise graph’s spectral density decomposition and its applications (2025)

    Guzman, Grover Enrique Castro ; Takahashi, Daniel Yasumasa ; Fujita, André

    Fonte: Journal of Complex Networks. Unidade: IME

    Assuntos: GRAFOS ALEATÓRIOS, ÁLGEBRA LINEAR NUMÉRICA, REDES COMPLEXAS

    Versão PublicadaAcesso à fonteDOIComo citar
    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: 09 nov. 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 nov. 09 ] 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 nov. 09 ] 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é

    Fonte: Journal of Complex Networks. Unidade: IME

    Assuntos: SELEÇÃO DE MODELOS, ESPECTROS, OPERADORES, TEORIA DOS GRAFOS, GRAFOS ALEATÓRIOS, INFERÊNCIA PARAMÉTRICA

    PrivadoAcesso à fonteDOIComo citar
    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: 09 nov. 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 nov. 09 ] 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 nov. 09 ] Available from: https://doi.org/10.1093/comnet/cnaf019

  • 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é

    Fonte: Journal of Complex Networks. Unidade: IME

    Assuntos: GRAFOS ALEATÓRIOS, TEORIA ESPECTRAL

    PrivadoAcesso à fonteDOIComo citar
    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: 09 nov. 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 nov. 09 ] 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 nov. 09 ] Available from: https://doi.org/10.1093/comnet/cnad005
  • 1

1 - 3 (3 registros)

Biblioteca Digital de Produção Intelectual da Universidade de São Paulo     2012 - 2025