Grover E. C. Guzman

Orcid: 0000-0002-2900-3235

According to our database1, Grover E. C. Guzman authored at least 10 papers between 2020 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
A message-passing approach to obtain the trace of matrix functions with applications to network analysis.
Numer. Algorithms, January, 2026

StatGraph: an R package for complex network statistical analyses based on spectrum.
SoftwareX, 2026

2025
Vertex-wise graph's spectral density decomposition and its applications.
J. Complex Networks, 2025

Statistical methods for hypergraphs: a parameter estimator, a model selection, and a comparative test.
J. Complex Networks, 2025

2023
A fast algorithm to approximate the spectral density of locally tree-like networks with assortativity.
J. Complex Networks, February, 2023

2022
A fast parameter estimator for large complex networks.
J. Complex Networks, 2022

Efficient eigenvalue counts for tree-like networks.
J. Complex Networks, 2022

2021
Efficient Laplacian spectral density computations for networks with arbitrary degree distributions.
Netw. Sci., 2021

Convolution-based linear discriminant analysis for functional data classification.
Inf. Sci., 2021

2020
Quasiquadratic Time Algorithms for Square and Pentagon Counting in Real-World Networks.
Proceedings of the Information Management and Big Data, 2020


  Loading...