相关论文: Critical behavior of two-choice rules: a class of …
Bounded-size rules are dynamic random graph processes which incorporate limited choice along with randomness in the evolution of the system. One starts with the empty graph and at each stage two edges are chosen uniformly at random. One of…
Explosive percolation in the Achlioptas process, which has attracted much research attention, is known to exhibit a rich variety of critical phenomena that are anomalous from the perspective of continuous phase transitions. Hereby, we show…
We study four Achlioptas type processes with "explosive" percolation transitions. All transitions are clearly continuous, but their finite size scaling functions are not entire holomorphic. The distributions of the order parameter, the…
Perhaps the best understood phase transition is that in the component structure of the uniform random graph process introduced by Erd\H{o}s and R\'enyi around 1960. Since the model is so fundamental, it is very interesting to know which…
The growth of two-dimensional lattice bond percolation clusters through a cooperative Achlioptas-type of process, where the choice of which bond to occupy next depends upon the masses of the clusters it connects, is shown to go through an…
The biased link occupation rule in the Achlioptas process (AP) discourages the large clusters to grow much ahead of others and encourages faster growth of clusters which lag behind. In this paper we propose a model where this tendency is…
We study scale-free networks constructed via a cooperative Achlioptas growth process. Links between nodes are introduced in the network in order to produce a scale-free graph with given exponent lambda for the degree distribution, but the…
The Achlioptas process, which suppresses the aggregation of large-sized clusters, can exhibit an explosive percolation (EP) where the order parameter emerges abruptly yet continuously in the thermodynamic limit. It is known that EP is…
We consider here on-line algorithms for Achlioptas processes. Given a initially empty graph $G$ on $n$ vertices, a random process that at each step selects independently and uniformly at random two edges from the set of non-edges is…
Phase transitions from an active into an absorbing, inactive state are generically described by the critical exponents of directed percolation (DP), with upper critical dimension d_c = 4. In the framework of single-species…
Achlioptas processes such as the Bohman--Frieze process are much harder to analyse than the classical Erd\H{o}s--R\'enyi process, due to the dependence between edges added at different stages. This dependence means that most analysis so far…
The random geometric graph is obtained by sampling $n$ points from the unit square (uniformly at random and independently), and connecting two points whenever their distance is at most $r$, for some given $r=r(n)$. We consider the following…
We introduce a guided network growth model, which we call the degree product rule process, that uses solely local information when adding new edges. For small numbers of candidate edges our process gives rise to a second order phase…
We study both numerically and analytically what happens to a random graph of average connectivity "alpha" when its leaves and their neighbors are removed iteratively up to the point when no leaf remains. The remnant is made of isolated…
In this work, we study explosive percolation (EP) in Barab\'{a}si-Albert (BA) network, in which nodes are born with degree $k=m$, for both product rule (PR) and sum rule (SR) of the Achlioptas process. For $m=1$ we find that the critical…
We study a process termed "agglomerative percolation" (AP) in two dimensions. Instead of adding sites or bonds at random, in AP randomly chosen clusters are linked to all their neighbors. As a result the growth process involves a diverging…
We study the site percolation under Achlioptas process (AP) with a product rule in a $2-dimensional$ (2D) square lattice. From the measurement of the cluster size distribution, $P_s$, we find that $P_s$ has a very robust power-law regime…
We study the susceptibility, i.e., the mean cluster size, in random graphs with given vertex degrees. We show, under weak assumptions, that the susceptibility converges to the expected cluster size in the corresponding branching process. In…
We consider the problem of distinguishing classical (Erd\H{o}s-R\'{e}nyi) percolation from explosive (Achlioptas) percolation, under noise. A statistical model of percolation is constructed allowing for the birth and death of edges as well…
We study a hierarchy of directed percolation (DP) processes for particle species A, B, ..., unidirectionally coupled via the reactions A -> B, ... When the DP critical points at all levels coincide, multicritical behavior emerges, with…