Searcharxiv⌕ Search

arXiv subjects

Daniel Hernández Serrano

Publications and source records attributed to Daniel Hernández Serrano.

7 recordsLinked to original sources
arXiv2026

From Persistence to Resilience: New Betti Numbers for Analyzing Robustness in Simplicial Complex Networks

We show how persistence can be used to measure the robustness of cohomological cycles in finite simplicial complexes. We introduce two families of invariants: thick Betti numbers, which measure whether connected components and holes are supported by simplices of sufficiently high dimension; and cohesive Betti numbers, which measure the strength of higher-order adjacencies supporting cohomology classes. We then study robustness under simplicial degradation processes by combining an attack parameter with either the thick or the cohesive parameter, and by analyzing the resulting ladder modules through their image, kernel, and cokernel persistence modules. This allows us to distinguish features that remain structurally robust from those that lose thickness or cohesion during the degradation process. Finally, we prove stability results using the second network distance, which provides a theoretical reliability guarantee for the proposed constructions.

math.AT↗
arXiv2026

Interval Decompositions for Multipersistence Modules over Finite Posets and Robustness of Sheaf Data on Simplicial Complexes

We prove structure theorems for multipersistence modules indexed by finite posets that are not totally ordered. Specifically, we consider pointwise finite-dimensional modules over the opposite of the poset of non-empty subsets of a finite set, and give sufficient conditions, expressed through transition morphisms, for such modules to split as direct sums of interval modules. In the general case, the interval summands and multiplicities are explicitly determined by dimensions at finitely many indices. Although the assumptions may look algebraically restrictive, we show that they have a natural geometric origin in a robustness theory of cellular sheaf data over simplicial complexes, where one studies how algebraic information, compatibility constraints, and cohomological obstructions persist under structural failures. We extend thickness and cohesion from simplicial cohomology to cellular sheaves: thickness detects the dependence of cohomology classes on high-dimensional support, while cohesion captures the influence of higher-order adjacencies on the cohomological features. We leverage our abstract structure theorems to obtain interval decompositions for the resulting geometric cohesion modules. Finally, we introduce biparameter persistence constructions for sheaf resilience, tracking whether global sections and cohomological obstructions remain detectable on thick or cohesive substructures during topological degradation.

math.AT↗
arXiv2020

Centrality measures in simplicial complexes: applications of Topological Data Analysis to Network Science

Many real networks in social sciences, biological and biomedical sciences or computer science have an inherent structure of simplicial complexes reflecting many-body interactions. Therefore, to analyse topological and dynamical properties of simplicial complex networks centrality measures for simplices need to be proposed. Many of the classical complex networks centralities are based on the degree of a node, so in order to define degree centrality measures for simplices (which would characterise the relevance of a simplicial community in a simplicial network), a different definition of adjacency between simplices is required. The aim of these notes is threefold: first we will use the recently introduced notions of higher order simplicial degrees to propose new degree based centrality measures in simplicial complexes. These theoretical centrality measures, such as the simplicial degree centrality or the eigenvector centrality would allow not only to study the relevance of a simplicial community and the quality of its higher-order connections in a simplicial network, but also they might help to elucidate topological and dynamical properties of simplicial networks; sencond, we define notions of walks and distances in simplicial complexes in order to study connectivity of simplicial networks and to generalise, to the simplicial case, the well known closeness and betweenness centralities (needed for instance to study the relevance of a simplicial community in terms of its ability of transmitting information); third, we propose a new clustering coefficient for simplices in a simplicial network, different from the one knows so far and which generalises the standard graph clustering of a vertex. This measure should be essential to know the density of a simplicial network in terms of its simplicial communities.

math.AT↗
arXiv2020

Simplicial degree in complex networks. Applications of Topological Data Analysis to Network Science

Network Science provides a universal formalism for modelling and studying complex systems based on pairwise interactions between agents. However, many real networks in the social, biological or computer sciences involve interactions among more than two agents, having thus an inherent structure of a simplicial complex. We propose new notions of higher-order degrees of adjacency for simplices in a simplicial complex, allowing any dimensional comparison among them and their faces, which as far as we know were lacked in the literature. We introduce multi-parameter boundary and coboundary operators in an oriented simplicial complex and also a novel multi-combinatorial Laplacian is defined, which generalises the graph and combinatorial Laplacian. To illustrate the potential applications of these theoretical results, we perform a structural analysis of higher-order connectivity in simplicial-complex networks by studying the associated distributions with these simplicial degrees in 17 real-world datasets coming from different domains such as coauthor networks, cosponsoring Congress bills, contacts in schools, drug abuse warning networks, e-mail networks or publications and users in online forums. We find rich and diverse higher-order connectivity structures and observe that datasets of the same type reflect similar higher-order collaboration patterns. Furthermore, we show that if we use what we have called the maximal simplicial degree (which counts the distinct maximal communities in which our simplex and all its strict sub-communities are contained), then its degree distribution is, in general, surprisingly different from the classical node degree distribution.

cs.SI↗
arXiv2016

Topological recursion, topological quantum field theory and Gromov-Witten invariants of BG

The purpose of this paper is to give a twisted version of the Eynard-Orantin topological recursion by a 2D Topological Quantum Field Theory. We define a kernel for a 2D TQFT and use an algebraic definition for a topological recursion to define how to twist a standard topological recursion by a 2D TQFT. The A-model side enumerative problem consists of counting cell graphs where in addition vertices are decorated by elements in a Frobenius algebra, and which are a twisted version of the generalized Catalan numbers of Dumitrescu-Mulase-Safnuk-Sorkin. We show that the function which counts these decorated graphs satisfies a twisted version of the same type of recursion of Catalan numbers with respect to the edge-contraction axioms of Dumitrescu-Mulase. The path we follow to pass from the A-model side to the remodelled B-model side is to use a discrete Laplace transform based on the ideas of the group of Mulase. We show that a twisted version by a 2D TQFT of the Eynard-Orantin differentials satisfies a twisted generalization of the topological recursion formula. We shall illustrate these results with a toy model for the theory arising from the orbifold cohomology of the classifying space of a finite group. In this example, the graphs are drawn on an orbifold punctured Riemann surface and defined out of the moduli space of stable morphisms from twisted curves to the classifying space of a finite group. In particular we show that the cotangent class intersection numbers on this moduli space satisfy a twisted Eynard-Orantin topological recursion and we derive an orbifold DVV equation as a consequence of it. This proves from a different perspective a result of Jarvis-Kimura, which states that the cotangent class intersection numbers on that moduli space satisfy the Virasoro constraint condition.

math.AG↗
arXiv2013

Determinants of finite potent endomorphisms, symbols and reciprocity laws

The aim of this paper is to offer an algebraic definition of infinite determinants of finite potent endomorphisms using linear algebra techniques. It generalizes Grothendieck's determinant for finite rank endomorphisms and is equivalent to the classic analytic definitions. The theory can be interpreted as a multiplicative analogue to Tate's formalism of abstract residues in terms of traces of finite potent linear operators on infinite-dimensional vector spaces, and allows us to relate Tate's theory to the Segal-Wilson pairing in the context of loop groups.

math.RA↗