اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدWatersheds and Explosive percolation
91
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The recent work by Achlioptas, DSouza, and Spencer opened up the possibility of obtaining a discontinuous (explosive) percolation transition by changing the stochastic rule of bond occupation. Despite the active research on this subject, several questions still remain open about the leading mechanism and the properties of the system. We review the largest cluster and the Gaussian models recently introduced. We show that, to obtain a discontinuous transition it is solely necessary to control the size of the largest cluster, suppressing the growth of a cluster differing significantly, in size, from the average one. As expected for a discontinuous transition, a Gaussian cluster-size distribution and compact clusters are obtained. The surface of the clusters is fractal, with the same fractal dimension of the watershed line.
قيم البحث
اقرأ أيضاً
The suitable interpolation between classical percolation and a special variant of explosive percolation enables the explicit realization of a tricritical percolation point. With high-precision simulations of the order parameter and the second moment
of the cluster size distribution a fully consistent tricritical scaling scenario emerges yielding the tricritical crossover exponent $1/phi_t=1.8pm0.1$.
We investigate the metallic breakdown of a substrate on which highly conducting particles are adsorbed and desorbed with a probability that depends on the local electric field. We find that, by tuning the relative strength $q$ of this dependence, the
breakdown can change from continuous to explosive. Precisely, in the limit in which the adsorption probability is the same for any finite voltage drop, we can map our model exactly onto the $q$-state Potts model and thus the transition to a jump occurs at $q=4$. In another limit, where the adsorption probability becomes independent of the local field strength, the traditional bond percolation model is recovered. Our model is thus an example of a possible experimental realization exhibiting a truly discontinuous percolation transition.
We present a simple model of network growth and solve it by writing down the dynamic equations for its macroscopic characteristics like the degree distribution and degree correlations. This allows us to study carefully the percolation transition usin
g a generating functions theory. The model considers a network with a fixed number of nodes wherein links are introduced using degree-dependent linking probabilities $p_k$. To illustrate the techniques and support our findings using Monte-Carlo simulations, we introduce the exemplary linking rule $p_k$ proportional to $k^{-alpha}$, with $alpha$ between -1 and plus infinity. This parameter may be used to interpolate between different regimes. For negative $alpha$, links are most likely attached to high-degree nodes. On the other hand, in case $alpha>0$, nodes with low degrees are connected and the model asymptotically approaches a process undergoing explosive percolation.
In the present paper, we study the robustness of two-dimensional random lattices (Delaunay triangulations) under attacks based on betweenness centrality. Together with the standard definition of this centrality measure, we employ a range-limited appr
oximation known as $ell$-betweenness, where paths having more than $ell$ steps are ignored. For finite $ell$, the attacks produce continuous percolation transitions that belong to the universality class of random percolation. On the other hand, the attack under the full range betweenness induces a discontinuous transition that, in the thermodynamic limit, occurs after removing a sub-extensive amount of nodes. This behavior is recovered for $ell$-betweenness if the cutoff is allowed to scale with the linear length of the network faster than $ellsim L^{0.91}$. Our results suggest that betweenness centrality encodes information on network robustness at all scales, and thus cannot be approximated using finite-ranged calculations without losing attack efficiency.
We present efficient algorithms to generate a bit string in which each bit is set with arbitrary probability. By adopting a hybrid algorithm, i.e., a finite-bit density approximation with correction techniques, we achieve 3.8 times faster random bit
generation than the simple algorithm for the 32-bit case and 6.8 times faster for the 64-bit case. Employing the developed algorithm, we apply the multispin coding technique to one-dimensional bond-directed percolation. The simulations are accelerated by up to a factor of 14 compared with an optimized scalar implementation. The random bit string generation algorithm proposed here is applicable to general Monte Carlo methods.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
