2019
DOI: 10.1103/physreve.100.062311
|View full text |Cite
|
Sign up to set email alerts
|

Percolation on branching simplicial and cell complexes and its relation to interdependent percolation

Abstract: Network geometry has strong effects on network dynamics. In particular, the underlying hyperbolic geometry of discrete manifolds has recently been shown to affect their critical percolation properties. Here we investigate the properties of link percolation in non-amenable two-dimensional branching simplicial and cell complexes. We establish the relation between the equations determining the percolation probability in random branching cell complexes and the equation for interdependent percolation in multiplex n… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
20
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
5
3
1

Relationship

2
7

Authors

Journals

citations
Cited by 30 publications
(20 citation statements)
references
References 51 publications
0
20
0
Order By: Relevance
“…Many of the presented results are higher-dimensional analogues of the well-known phenomena in random graphs related to connectivity, giant component, cycles, etc., therefore we preamble, where possible, the higher-dimensional statements with brief recollections of their one-dimensional counterparts. The focus on mathematics taken in this review precludes us unfortunately from covering many exciting subjects, such as models of growing complexes [2][3][4][5][6][7], their applications, and phenomena in them including percolation [8][9][10][11][12][13]. Yet in the concluding Section 6 that outlines our view on interesting future directions, we also comment briefly on some applications and their implications for different models of random simplicial complexes.…”
Section: Introductionmentioning
confidence: 99%
“…Many of the presented results are higher-dimensional analogues of the well-known phenomena in random graphs related to connectivity, giant component, cycles, etc., therefore we preamble, where possible, the higher-dimensional statements with brief recollections of their one-dimensional counterparts. The focus on mathematics taken in this review precludes us unfortunately from covering many exciting subjects, such as models of growing complexes [2][3][4][5][6][7], their applications, and phenomena in them including percolation [8][9][10][11][12][13]. Yet in the concluding Section 6 that outlines our view on interesting future directions, we also comment briefly on some applications and their implications for different models of random simplicial complexes.…”
Section: Introductionmentioning
confidence: 99%
“…We note that these results do not exclude a priori that spatial effects might also be important elements determining the power-law increase in the number of cases. In particular, hierarchical and hyperbolic networks describing nested communities of people during lockdown can be responsible for a broadening of the critical region in which one can observe the power-law critical behaviour [27] similarly to what happens for percolation on the same type of networks [28,29,30,31,32].…”
Section: Introductionmentioning
confidence: 90%
“…Here, λ c indicates the so-called epidemic threshold. However, it has to be noted that in hyperbolic and hierarchical structures the critical region may stretch out for a finite range of values of the infectivity [27], which corresponds to the fact that in these networks one can observe two percolation thresholds [28,29,30,31,32]. When the onset of the epidemic is started from a single infected individual, the latter three dynamical regions are characterised by different dynamical properties: the supercritical region is characterised by an exponential increase of the number of infected individuals, the critical regimeby a power-law increase with exponent 2, while the subcritical regime -by finite size stochastic fluctuations.…”
Section: The Major Properties Of the Sir Modelmentioning
confidence: 99%
“…In other words, that the structure of a dynamic network may have memory of its past. Some examples of evolving network models include Price’s (1965) preferential attachment model 1 , the vertex copying model 2 , network optimisation models 3 , and branching simlicial complexes 4 , 5 . Preferential attachment, vertex copying models, and branching simplicial complexes all result in heavy-tailed degree distributions.…”
Section: Introductionmentioning
confidence: 99%