15-18 settembre 2025
Conference Center – University of Naples Federico II
Europe/Rome timezone

EuCompChem2025 – Nico Di Fonte – Oral

Not scheduled
Sala Azzurra (Conference Center – University of Naples Federico II)

Sala Azzurra

Conference Center – University of Naples Federico II

Complesso Universitario di Monte Sant’Angelo Via Cintia, 26, 80126 – Napoli Italy
Poster Presentation

Speaker

Nico Di Fonte (University of L'Aquila)

Description

The integration of graph theory into the analysis of molecular dynamics (MD) simulations offers a powerful and versatile framework for addressing complex structural identification problems[1,2]. By representing atomic or molecular interactions as nodes connected by edges within a graph, it is possible to use a vast array of well-established, highly-optimized algorithms originally developed for fields such as computer science, social networks, and transport systems, to analyze and interpret simulation data. We employ graph-based methods to investigate key structural features arising from MD simulations, including the formation and evolution of molecular aggregates and the identification of water channels within protein environments (Figure 1). These problems, often challenging to address with conventional spatial or density-based techniques, benefit significantly from the flexibility and scalability of graph approaches[3,4]. The cross-disciplinary nature of graph theory not only enhances computational performance but also allows access to new information in the study of molecular structures.

We are currently developing an open-source tool designed to make graph-theory analysis of molecular dynamics trajectories accessible and customizable for the broader scientific community. The tool will allow users to construct graphs from atomic or molecular data and to flexibly define node and edge criteria based on chemical identity of the nodes, distance thresholds, and hydrogen bonding. Leveraging the tunability of graph parameters, users can tailor the analysis to their specific system and research question, whether it involves detecting aggregating behavior, mapping solvent networks, or identifying functional pathways such as water channels in proteins. By building on widely used graph libraries, the tool aims to interface MD simulations with graph analytics in a way that is both robust and user-friendly.

[1] Faccio, C., Di Fonte, N., Daidone, I., & Zanetti-Polzi, L. Enhanced connectivity and mobility in liquid water: Implications for the high density liquid structure and its onset. Journal of Molecular Liquids, 2023, 392, 123425.

[2] Di Fonte, N., Faccio, C., Zanetti-Polzi, L., & Daidone, I. Early prediction of spinodal-like relaxation events in supercooled liquid water. The Journal of Chemical Physics, 2024 161(3).

[3] Li, J., Lai, S., Shuai, Z., Tan, Y., Jia, Y., Yu, M., ... & Lu, Y. A comprehensive review of community detection in graphs. Neurocomputing, 2024, 128169.

[4] Magzhan, K., & Jani, H. M. A review and evaluations of shortest path algorithms. Int. J. Sci. Technol. Res, 2013, 2(6), 99-104.

Primary author

Nico Di Fonte (University of L'Aquila)

Co-authors

Dr. Laura Zanetti-Polzi (CNR Nanoscience Institute) Prof. Isabella Daidone (University of L'Aquila)

Presentation Materials

There are no materials yet.
Your browser is out of date!

Update your browser to view this website correctly. Update my browser now

×