Superstable Geometry in Triadic Percolation
arXiv:2602.01374 · doi:10.1103/b29t-62kv
Abstract
Triadic percolation turns bond percolation into a dynamical problem governed by an effective one-dimensional unimodal map. We show that the geometry of superstable cycles provides a direct, map-agnostic probe of local nonlinearity: specifically, the distance from the map's maximum to a distinguished next-to-maximum point on the attracting -cycle (which coincides with a preimage of the maximum at -superstability) scales as with , where is the nonflat order of the maximum. This prediction is verified across canonical unimodal families and heterogeneous triadic ensembles, with Lyapunov spectra corroborating the one-dimensional reduction. A derivative condition on the activation kernel fixes the local nonlinearity order (and thus, under standard unimodal-map hypotheses, the associated -logistic universality class) and gives conditions under which can be realized. The diagnostic operates directly on orbit data under standard regularity assumptions, providing a practical tool to classify universality in higher-order networks.
7 pages, 5 figures
References in corpus (13)
- Random graphs with arbitrary degree distributions and their applications
- The spread of epidemic disease on networks
- Networks beyond pairwise interactions: structure and dynamics
- The physics of higher-order interactions in complex systems
- Recent advances in percolation theory and its applications
- The dynamic nature of percolation on networks with triadic interactions
- Deeper but smaller: Higher-order interactions increase linear stability but shrink basins
- Dynamical Mean-Field Theory of Complex Systems on Sparse Directed Networks
- Unveiling the Importance of Nonshortest Paths in Quantum Networks
- Triadic percolation induces dynamical topological patterns in higher-order networks
- Higher-order triadic percolation on random hypergraphs
- Mining higher-order triadic interactions
- Triadic percolation on multilayer networks