Search arXiv⌕ Search

arXiv · 2611.09967

Persistent A-homotopy of Complex Networks

Abstract

We study how loop classes in a network change when cycles up to a prescribed length are declared contractible. The resulting sequence of quotient groups contains the fundamental group of the clique complex at length three and the graph $A$-fundamental group at length four. Its mod-two abelianisation has a barcode whose death scales are the lengths in a minimum cycle basis. This separates the choice of a network filtration from the choice of local loop relations and provides a computable connection between persistent $A$-homotopy and persistent homology. We illustrate the construction on lattices, Watts--Strogatz networks and nine benchmark networks. Filling the plaquettes of a periodic square lattice recovers the fundamental group of the torus. In the Watts--Strogatz simulations, the normalised largest death scale falls below the normalised mean path length over the sampled range, while most clique-homology classes survive the square relations at small rewiring probabilities. The power grid has fewer surviving classes but a longer tail of death scales than five degree-preserving randomisations. We also examine connectivity graphs of maximal cliques in ego networks. Explicit certificates establish non-trivial $A$-classes even though the original ego clique complexes are contractible. The group construction and its linear summary answer related but distinct questions about which loop relations a network model permit.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Milan Rajkovic. 2026-10-29. Persistent A-homotopy of Complex Networks. https://arxiv.org/abs/2611.09967

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Giant strongly biconnected components of directed networks: a generating function approach

Strongly connected components (SCCs) characterize modular structure in directed networks but are fragile to single node failures. We study strongly biconnected components (SBCs), which are the set of nodes in which every node pair remains mutually reachable after the removal of any single node, as a more robust notion of connectivity. Using a generating function formalism, we derive the size of the giant SBC and analyze its percolation behavior under random node and link removal. We show that the giant SBC emerges at the same threshold as the giant SCC but grows more slowly, consistent with previous findings for undirected networks. We also applied our theoretical framework to real-world biological networks including gene regulatory networks and neural connectome. Our framework provides insight into the interplay between connectivity, redundancy, and robustness in complex directed systems.

physics.soc-ph↗

Two preregistered datasets on production-type labelling in the ENTSO-E Transparency Platform: multi-fuel reporting, register vintages, persistent misclassification, and cross-product consistency

The ENTSO-E Transparency Platform is the single mandated publication point for European electricity market data, and three of its data items carry a production-type label. Commission Regulation (EU) No 543/2013 Article 16(1)(a) requires actual generation output per generation unit but does not mention production type; the label on that item is ENTSO-E's own addition through the schema, and Article 5(d) delegates the classification of production types to a Manual of Procedures. This data descriptor documents two preregistered datasets that measure what that classification does in practice, along four axes: simultaneous multi-fuel reporting, type change between capacity-register vintages, persistent misclassification without type change, and cross-product consistency between the per-unit and the aggregated series. Criteria were locked and checksummed before measurement, thresholds are derived from measured noise rather than chosen, and what did not survive is recorded: six claims are withdrawn, three of them from published versions of the datasets themselves. Across 2191 documents covering 199 generation units in three bidding zones where biomass co-firing is documented in a dated primary source, no unit carries two production types in the same document. One practical warning applies to every user of the hourly series: all of it carries curveType A03, a step curve in which a missing position means the previous value holds rather than that data are absent. A parser that sums only the points listed under-reports energy unevenly, by 22.6 percent for one Finnish unit in 2021.

physics.soc-ph↗

Transferable reconstruction of equilibria in network dynamics from sentinel nodes

Reconstructing the state of a large networked system from measurements at only a few nodes is a challenge for monitoring, prediction, and intervention. Here we ask whether such reconstruction is possible for equilibrium states and whether it can transfer across different nonlinear dynamics. We study this question across various networks and across $17$ nonlinear dynamics on networks from different domains. For each network, we observe only a vanishingly small fraction of sentinel nodes and train either a neural network or linear decoder. We find that accurate reconstruction is often possible, and that transferability is structured rather than universal. Eleven dynamics with adjacency-matrix-type coupling form a robust transferable class. By contrast, six diffusively coupled dynamics form isolated transfer components. Non-random sentinel selection is consistently important, and linear decoders often approach neural-network performance. These results show that sparse node observations can encode enough information to reconstruct full network equilibria across broad families of nonlinear dynamics, while also revealing sharp limits to universal transfer.

physics.soc-ph↗