2012
DOI: 10.1017/s0963548312000442
|View full text |Cite
|
Sign up to set email alerts
|

Explosive Percolation in Erdős–Rényi-Like Random Graph Processes

Abstract: The study of the phase transition of random graph processes, and recently in particular Achlioptas processes, has attracted much attention. Achlioptas, D'Souza and Spencer (Science, 2009) gave strong numerical evidence that a variety of edge-selection rules in Achlioptas processes exhibit a discontinuous phase transition. However, Riordan and Warnke (Science, 2011) recently showed that all these processes have a continuous phase transition.In this work we prove discontinuous phase transitions for three random … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
14
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(14 citation statements)
references
References 15 publications
0
14
0
Order By: Relevance
“…The order parameter R behaves as R − R 0 ∼ (K − K c ) β , where R 0 is the jump in the order parameter, and K c is the transition point [20,22,27,28]. The exponent β is approximately β ≈ 0.75, independent of h, which is in contrary to the behavior in the r-ER model for hybrid percolation transitions induced by cluster merging dynamics [18]. However, K c depends on h: K c increases as h is increased.…”
Section: Numerical Resultsmentioning
confidence: 81%
“…The order parameter R behaves as R − R 0 ∼ (K − K c ) β , where R 0 is the jump in the order parameter, and K c is the transition point [20,22,27,28]. The exponent β is approximately β ≈ 0.75, independent of h, which is in contrary to the behavior in the r-ER model for hybrid percolation transitions induced by cluster merging dynamics [18]. However, K c depends on h: K c increases as h is increased.…”
Section: Numerical Resultsmentioning
confidence: 81%
“…In 1960s, two Hungarian mathematicians Erdos and Renyi set up a random graph theory [2], which was regarded as a systematic study of complex networks theory in mathematics. In the next 40 years, people had been using random graph theory as the basic theory of complex networks research.…”
Section: Introductionmentioning
confidence: 99%
“…For percolation, hybrid percolation transitions (HPTs) may be classified into two categories: one occurring during the cascade process as in k-core percolation [5][6][7][8][9][10][11][12] , and the other during the cluster merging process [30][31][32] . For the former case, dynamics proceed only in one direction of decreasing occupation probability, and a reverse process may not be well defined, i.e., a cascade cluster aggregation process is hardly imagined.…”
mentioning
confidence: 99%
“…In this paper, we consider a reverse process of the cluster merging dynamics of the so-called restricted Erdős-Rényi (r-ER) model. It is known that the r-ER model [30][31][32] exhibits an HPT. In the reverse fragmentation process, a restriction is given to the breakage of large clusters.…”
mentioning
confidence: 99%