arXiv subjects

Aina Ferrà Marcús

Publications and source records attributed to Aina Ferrà Marcús.

3 recordsLinked to original sources

arXiv2026

Chordless cycle filtrations for dimensionality detection in complex networks via topological data analysis

Many complex networks, ranging from social to biological systems, exhibit structural patterns consistent with an underlying hyperbolic geometry. Revealing the dimensionality of this latent space can disentangle the structural complexity of communities, impact efficient network navigation, and fundamentally shape connectivity and system behavior. We introduce a topological data analysis weighting scheme for graphs based on chordless cycles to estimate network dimensionality in a data-driven way. We further show that the resulting descriptors can effectively estimate network dimensionality using a neural network architecture trained on a synthetic graph database constructed for this purpose, which requires no retraining to transfer effectively to real-world networks. Thus, by combining cycle-aware filtrations, algebraic topology, and machine learning, our approach provides a robust and effective method for uncovering the hidden geometry of complex networks and guiding accurate modeling and low-dimensional embedding.

physics.soc-ph↗

arXiv2026

Topological analysis of hemodynamic response to cardiac resynchronization therapy

Objective: The Mapper algorithm is a qualitative method in topological data analysis that constructs graphs from point clouds by combining dimensionality reduction and clustering techniques. The aim of this study is to apply Mapper, together with novel quantitative indices, to compare the effects of biventricular pacing from the left ventricular epicardium versus the endocardium in a swine model of pacing-induced non-ischemic cardiomyopathy. Methods: The distributions of four hemodynamic variables from a previous study on endocardial and epicardial cardiac resynchronization in an experimental swine model of nonischemic cardiomyopathy were analyzed using the Mapper algorithm, enhanced with numerical indices quantifying self-connectivity, scattering, and homogeneity of the resulting colored graphs. Results: Statistically significant differences were observed between pacing from basal regions versus mid or apical regions, with the following self-connectivity index values: basal $0.57$; mid $0.14$ ($p < 0.01$); apical $0.24$ ($p < 0.01$). Endocardial stimulation at lateral sites increased the contrast between the distributions of basal versus mid or apical data, when compared with epicardial stimulation. Conclusions: Topological analysis using the Mapper algorithm, enhanced with quantitative statistical measures, revealed new and biologically plausible significant differences in pacing effects across heart regions.

q-bio.QM↗

arXiv2026

Motif-based filtrations for persistent homology: A framework for graph isomorphism and property prediction

Determining whether two graphs are isomorphic is a fundamental problem with practical applications in areas such as molecular chemistry or social network analysis, yet it remains a challenging task, with exact solutions often being computationally expensive. We address this task using persistent homology built on motif-based filtrations of graphs, a method from topological data analysis that summarizes the shape of data by tracking the persistence of structural features along filtrations. Specifically, we use edge-weighting schemes based on the densities of triangles, chordless squares, and chordless pentagons, which have been shown to be effective for detecting network dimensionality. Our cycle-density filtrations distinguish non-isomorphic graphs perfectly or nearly perfectly across four demanding graph families, many of which exhibit symmetries. We outperform curvature-based, degree-based, and Vietoris--Rips filtrations, and match or exceed the accuracy of egonet-distance methods while incurring a lower computational cost. The expressive power of our filtrations goes beyond isomorphism testing: because they capture rich structural information from graphs, they consistently achieve top performance on property prediction tasks using real-world data, and exhibit high sensitivity to edge rewiring and removal. Together, these findings establish cycle-density filtrations as an effective and computationally tractable framework for graph comparison and characterization, bridging topological data analysis and network science.

math.AT↗