Advanced search
Start date
Betweenand

Advancements in Network Statistics: extensions to HPC and hypergraphs.

Abstract

Networks pervade various domains, from molecular biology to social networks. However, empirical networks often exhibit stochastic behavior, challenging traditional graph theory-based approaches. Traditional approaches relying on graph theory face limitations in capturing the stochastic nature of empirical networks, motivating the need for alternative methodologies. Graph neural networks offer promising predictive accuracy but lack interpretability. In contrast, probabilistic models and statistical tools based on network invariants provide a framework for understanding complex network behavior. The network spectral density (NSD) emerges as an invariant for network characterization, but its computational cost limits scalability. We propose GPU-based implementations and algorithmic optimizations to enable efficient analysis of billion-node networks. Additionally, we highlight the necessity of extending statistical methods to hypergraphs, which offer a more natural representation of specific biological networks. Our proposed methodologies have broad applications, ranging from neuroscience to public policy. By enabling analysis of large-scale networks, including billion-node networks and hypergraphs, we unlock new avenues for understanding complex systems and identifying critical patterns. In conclusion, this proposal advances network analysis methodologies, bridging the gap between theoretical frameworks and practical applications in real-world complex systems. (AU)

Articles published in Agência FAPESP Newsletter about the research grant:
More itemsLess items
Articles published in other media outlets ( ):
More itemsLess items
VEICULO: TITULO (DATA)
VEICULO: TITULO (DATA)