Higher-order triadic percolation on random hypergraphs (2407.14213v2)

Abstract: In this work, we propose a comprehensive theoretical framework combining percolation theory with nonlinear dynamics in order to study hypergraphs with a time-varying giant component. We consider in particular hypergraphs with higher-order triadic interactions that can upregulate or downregulate the hyperedges. Triadic interactions are a general type of signed regulatory interaction that occurs when a third node regulates the interaction between two other nodes. For example, in brain networks, the glia can facilitate or inhibit synaptic interactions between neurons. However, the regulatory interactions may not only occur between regulator nodes and pairwise interactions but also between regulator nodes and higher-order interactions (hyperedges), leading to higher-order triadic interactions. For instance, in biochemical reaction networks, the enzymes regulate the reactions involving multiple reactants. Here we propose and investigate higher-order triadic percolation on hypergraphs showing that the giant component can have a non-trivial dynamics. Specifically, we demonstrate that, under suitable conditions, the order parameter of this percolation problem, i.e., the fraction of nodes in the giant component, undergoes a route to chaos in the universality class of the logistic map. In hierarchical higher-order triadic percolation, we extend this paradigm in order to treat hierarchically nested triadic interactions demonstrating the non-trivial effect of their increased combinatorial complexity on the critical phenomena and the dynamical properties of the process. Finally, we consider other generalizations of the model studying the effect of considering interdependencies and node regulation instead of hyperedge regulation.