Grover Enrique Castro Guzman
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Grover Enrique Castro Guzman has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- André Fujita
University of São Paulo
5 shared publications - Peter Florian Stadler
Bioinformatics Group, Department of Computer Science, Leipzig University, Leipzig, Germany
4 shared publications - Ana Rocío Cárdenas Maita
Universidade de São Paulo
1 shared publication Castro Guzman
1 shared publication- Claudinei Eduardo Biazoli
Center of Mathematics, Computing and Cognition. Federal University of ABC, São Bernardo do Campo, São Paulo, Brazil
1 shared publication - Harley Vera-Olivera
Universidad Nacional de San Antonio Abad del Cusco
1 shared publication
Latest Publications
- 12 January 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 113 (1) , 014309
Spectral densities approximations of incidence-based locally treelike hypergraph matrices via the cavity method
Network science has significantly advanced our understanding of complex systems by representing them as graphs. Vertices correspond to system components, and edges capture pairwise interactions. However, many real-world systems (e.g., chemical reactions, brain networks, scientific collaborations) involve higher-order interactions that graphs fail to capture fully. Hypergraphs offer a more suitable framework, allowing interactions among multiple components, with each hyperedge connecting an arbitrary number of vertices. While significant progress has been made in studying the spectral properties of the matrix representation of a hypergraph, less attention has been given to efficiently computing its spectral density. Existing approaches primarily rely on direct diagonalization, which scales cubically with the number of vertices and is thus computationally prohibitive for large hypergraphs. In this work, we develop an efficient method for computing the spectral density of the signless Laplacian, adjacency, and Laplacian matrices of weighted hypergraphs using the cavity method. The cavity method is based on the incidence matrix, the most common way to represent hypergraphs. We further refine this approach to derive a more efficient method for unweighted hypergraphs that requires only the degree and order sequences. Finally, we validate the effectiveness of our processes demonstrating their computational efficiency and accuracy.
- 12 January 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 113 (1) , 014309
Spectral densities approximations of incidence-based locally treelike hypergraph matrices via the cavity method
Network science has significantly advanced our understanding of complex systems by representing them as graphs. Vertices correspond to system components, and edges capture pairwise interactions. However, many real-world systems (e.g., chemical reactions, brain networks, scientific collaborations) involve higher-order interactions that graphs fail to capture fully. Hypergraphs offer a more suitable framework, allowing interactions among multiple components, with each hyperedge connecting an arbitrary number of vertices. While significant progress has been made in studying the spectral properties of the matrix representation of a hypergraph, less attention has been given to efficiently computing its spectral density. Existing approaches primarily rely on direct diagonalization, which scales cubically with the number of vertices and is thus computationally prohibitive for large hypergraphs. In this work, we develop an efficient method for computing the spectral density of the signless Laplacian, adjacency, and Laplacian matrices of weighted hypergraphs using the cavity method. The cavity method is based on the incidence matrix, the most common way to represent hypergraphs. We further refine this approach to derive a more efficient method for unweighted hypergraphs that requires only the degree and order sequences. Finally, we validate the effectiveness of our processes demonstrating their computational efficiency and accuracy.
- Open Access
- 10 March 2025
- Published by University of Primorska Press in The Art of Discrete and Applied Mathematics
- Vol. 8 (2) , #P2.01
Primitive, edge-short, isometric, and pantochordal cycles
The Art of Discrete and Applied Mathematics (ADAM) is a modern, dynamic, platinum open access, electronic journal that will publish high-quality articles of arbitrary length in contemporary discrete and applied mathematics in which neither the authors nor the readers incur any costs.
- 10 March 2025
- Published by University of Primorska Press in The Art of Discrete and Applied Mathematics
- Vol. 8 (2) , #P2.01
Open AccessPrimitive, edge-short, isometric, and pantochordal cycles
The Art of Discrete and Applied Mathematics (ADAM) is a modern, dynamic, platinum open access, electronic journal that will publish high-quality articles of arbitrary length in contemporary discrete and applied mathematics in which neither the authors nor the readers incur any costs.
- 20 January 2025
- Published by Springer Nature in Numerical Algorithms
- Vol. 101 (1) , 455-476
A message-passing approach to obtain the trace of matrix functions with applications to network analysis
- 20 January 2025
- Published by Springer Nature in Numerical Algorithms
- Vol. 101 (1) , 455-476
A message-passing approach to obtain the trace of matrix functions with applications to network analysis
- 7 March 2024
- Published by American Physical Society (APS) in Physical Review E
- Vol. 109 (3) , 034303
Cavity approach for the approximation of spectral density of graphs with heterogeneous structures
Graphs have become widely used to represent and study social, biological, and technological systems. Statistical methods to analyze empirical graphs were proposed based on the graph's spectral density. However, their running time is cubic in the number of vertices, precluding direct application to large instances. Thus, efficient algorithms to calculate the spectral density become necessary. For sparse graphs, the cavity method can efficiently approximate the spectral density of locally treelike undirected and directed graphs. However, it does not apply to most empirical graphs because they have heterogeneous structures. Thus, we propose methods for undirected and directed graphs with heterogeneous structures using a new vertex's neighborhood definition and the cavity approach. Our methods' time and space complexities are and , respectively, where is the number of edges, is the size of the largest local neighborhood of a vertex, and is the number of iterations required for convergence. We demonstrate the practical efficacy by estimating the spectral density of simulated and real-world undirected and directed graphs.- 7 March 2024
- Published by American Physical Society (APS) in Physical Review E
- Vol. 109 (3) , 034303
Cavity approach for the approximation of spectral density of graphs with heterogeneous structures
Graphs have become widely used to represent and study social, biological, and technological systems. Statistical methods to analyze empirical graphs were proposed based on the graph's spectral density. However, their running time is cubic in the number of vertices, precluding direct application to large instances. Thus, efficient algorithms to calculate the spectral density become necessary. For sparse graphs, the cavity method can efficiently approximate the spectral density of locally treelike undirected and directed graphs. However, it does not apply to most empirical graphs because they have heterogeneous structures. Thus, we propose methods for undirected and directed graphs with heterogeneous structures using a new vertex's neighborhood definition and the cavity approach. Our methods' time and space complexities are and , respectively, where is the number of edges, is the size of the largest local neighborhood of a vertex, and is the number of iterations required for convergence. We demonstrate the practical efficacy by estimating the spectral density of simulated and real-world undirected and directed graphs.- Open Access
- 19 July 2021
- Published by Universidad de Lima in Interfases
- No. 014,p. e5451
SaminBot: un asistente virtual para recolectar datos durante la pandemia del COVID-19
La falta de base de datos para tomar decisiones en acciones rápidas durante la pandemia ocasionada por el COVID-19, mostraron la necesidad de usar nuevas tecnologías para agilizar el proceso de captura de información descentralizada. Este artículo presenta un asistente virtual (“chatbot”) denominado “SaminBot”, como una alternativa para recolectar datos y brindar información durante la pandemia del COVID-19, este chatbot se aplicó en la región del Cusco-Perú con conversaciones en las áreas de salud, economía y educación de enero a agosto del 2020. “SaminBot” inicia la recolección de datos en función del área de interés del usuario, obtiene información demográfica del mismo y lo va guiando a través de preguntas con la intención de proveerle información útil de acuerdo con su situación personal. Los cuestionarios fueron validados por especialistas de acuerdo a su campo, el proceso de recolección de datos inició en Enero y finalizó en Junio del 2021 mediante las plataformas WhatsApp, Facebook Messenger y la página web donde se obtuvo 1586 registros.
- 19 July 2021
- Published by Universidad de Lima in Interfases
- No. 014,p. e5451
Open AccessSaminBot: un asistente virtual para recolectar datos durante la pandemia del COVID-19
La falta de base de datos para tomar decisiones en acciones rápidas durante la pandemia ocasionada por el COVID-19, mostraron la necesidad de usar nuevas tecnologías para agilizar el proceso de captura de información descentralizada. Este artículo presenta un asistente virtual (“chatbot”) denominado “SaminBot”, como una alternativa para recolectar datos y brindar información durante la pandemia del COVID-19, este chatbot se aplicó en la región del Cusco-Perú con conversaciones en las áreas de salud, economía y educación de enero a agosto del 2020. “SaminBot” inicia la recolección de datos en función del área de interés del usuario, obtiene información demográfica del mismo y lo va guiando a través de preguntas con la intención de proveerle información útil de acuerdo con su situación personal. Los cuestionarios fueron validados por especialistas de acuerdo a su campo, el proceso de recolección de datos inició en Enero y finalizó en Junio del 2021 mediante las plataformas WhatsApp, Facebook Messenger y la página web donde se obtuvo 1586 registros.
- 12 May 2021
- Published by Springer Nature
- p. 460-470
Quasiquadratic Time Algorithms for Square and Pentagon Counting in Real-World Networks
- 12 May 2021
- Published by Springer Nature
- p. 460-470
Quasiquadratic Time Algorithms for Square and Pentagon Counting in Real-World Networks
- 22 November 2019
- Published by Elsevier
- p. 397-408
Network analysis of neuropsychiatry disorders