اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFast algorithm for generating random bit strings and multispin coding for directed percolation
86
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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.
قيم البحث
اقرأ أيضاً
These lectures provide an introduction to the directed percolation and directed animals problems, from a physicists point of view. The probabilistic cellular automaton formulation of directed percolation is introduced. The planar duality of the diode
-resistor-insulator percolation problem in two dimensions, and relation of the directed percolation to undirected first passage percolation problem are described. Equivalence of the $d$-dimensional directed animals problem to $(d-1)$-dimensional Yang-Lee edge-singularity problem is established. Self-organized critical formulation of the percolation problem, which does not involve any fine-tuning of coupling constants to get critical behavior is briefly discussed.
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 ques
tions 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.
In a recent publication (Phys. Rev E 77, 056705 (2008)),we have presented the stochastic Green function (SGF) algorithm, which has the properties of being general and easy to apply to any lattice Hamiltonian of the form H=V-T, where V is diagonal in
the chosen occupation number basis and T has only positive matrix elements. We propose here a modified version of the update scheme that keeps the simplicity and generality of the original SGF algorithm, and enhances significantly its efficiency.
In the paper random-site percolation thresholds for simple cubic lattice with sites neighborhoods containing next-next-next-nearest neighbors (4NN) are evaluated with Monte Carlo simulations. A recently proposed algorithm with low sampling for percol
ation thresholds estimation [Bastas et al., arXiv:1411.5834] is implemented for the studies of the top-bottom wrapping probability. The obtained percolation thresholds are $p_C(text{4NN})=0.31160(12)$, $p_C(text{4NN+NN})=0.15040(12)$, $p_C(text{4NN+2NN})=0.15950(12)$, $p_C(text{4NN+3NN})=0.20490(12)$, $p_C(text{4NN+2NN+NN})=0.11440(12)$, $p_C(text{4NN+3NN+NN})=0.11920(12)$, $p_C(text{4NN+3NN+2NN})=0.11330(12)$, $p_C(text{4NN+3NN+2NN+NN})=0.10000(12)$, where 3NN, 2NN, NN stands for next-next-nearest neighbors, next-nearest neighbors, and nearest neighbors, respectively. As an SC lattice with 4NN neighbors may be mapped onto two independent interpenetrated SC lattices but with two times larger lattice constant the percolation threshold $p_C$(4NN) is exactly equal to $p_C$(NN). The simplified Bastas et al. method allows for reaching uncertainty of the percolation threshold value $p_C$ similar to those obtained with classical method but ten times faster.
We study directed rigidity percolation (equivalent to directed bootstrap percolation) on three different lattices: square, triangular, and augmented triangular. The first two of these display a first-order transition at p=1, while the augmented trian
gular lattice shows a continuous transition at a non-trivial p_c. On the augmented triangular lattice we find, by extensive numerical simulation, that the directed rigidity percolation transition belongs to the same universality class as directed percolation. The same conclusion is reached by studying its surface critical behavior, i.e. the spreading of rigidity from finite clusters close to a non-rigid wall. Near the discontinuous transition at p=1 on the triangular lattice, we are able to calculate the finite-size behavior of the density of rigid sites analytically. Our results are confirmed by numerical simulation.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
