Renormalization group theory of percolation on pseudofractal simplicial and cell complexes
Abstract
Simplicial complexes are gaining increasing scientific attention as they are generalized network structures that can represent the manybody interactions existing in complex systems ranging from the brain to highorder social networks. Simplicial complexes are formed by simplicies, such as nodes, links, triangles, and so on. Cell complexes further extend these generalized network structures as they are formed by regular polytopes, such as squares, pentagons, etc. Pseudofractal simplicial and cell complexes are a major example of generalized network structures and they can be obtained by gluing twodimensional m polygons (m =3 triangles, m =4 squares, m =5 pentagons, etc.) along their links according to a simple iterative rule. Here we investigate the interplay between the topology of pseudofractal simplicial and cell complexes and their dynamics by characterizing the critical properties of link percolation defined on these structures. By using the renormalization group we show that the pseudofractal simplicial and cell complexes have a continuous percolation threshold at p_{c}=0 . When the pseudofractal structure is formed by polygons of the same size m , the transition is characterized by an exponential suppression of the order parameter P_{∞} that depends on the number of sides m of the polygons forming the pseudofractal cell complex, i.e., P_{∞}∝p exp(α /p^{m 2}) . Here these results are also generalized to random pseudofractal cell complexes formed by polygons of different number of sides m .
 Publication:

Physical Review E
 Pub Date:
 July 2020
 DOI:
 10.1103/PhysRevE.102.012308
 arXiv:
 arXiv:2005.02984
 Bibcode:
 2020PhRvE.102a2308S
 Keywords:

 Condensed Matter  Disordered Systems and Neural Networks;
 Condensed Matter  Statistical Mechanics;
 Computer Science  Social and Information Networks;
 Physics  Physics and Society
 EPrint:
 (11 pages,4 figures)