اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn the study of force-balance percolation
113
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study models of correlated percolation where there are constraints on the occupation of sites that mimic force-balance, i.e. for a site to be stable requires occupied neighboring sites in all four compass directions in two dimensions. We prove rigorously that $p_c<1$ for the two-dimensional models studied. Numerical data indicate that the force-balance percolation transition is discontinuous with a growing crossover length, with perhaps the same form as the jamming percolation models, suggesting the same underlying mechanism driving the transition in both cases. In other words, force-balance percolation and jamming percolation may indeed belong to the same universality class. We find a lower bound for the correlation length in the connected phase and that the correlation function does not appear to be a power law at the transition. Finally, we study the dynamics of the culling procedure invoked to obtain the force-balance configurations and find a dynamical exponent similar to that found in sandpile models.
قيم البحث
اقرأ أيضاً
We investigate kinetically constrained models of glassy transitions, and determine which model characteristics are crucial in allowing a rigorous proof that such models have discontinuous transitions with faster than power law diverging length and ti
me scales. The models we investigate have constraints similar to that of the knights model, introduced by Toninelli, Biroli, and Fisher (TBF), but differing neighbor relations. We find that such knights-like models, otherwise known as models of jamming percolation, need a ``No Parallel Crossing rule for the TBF proof of a glassy transition to be valid. Furthermore, most knight-like models fail a ``No Perpendicular Crossing requirement, and thus need modification to be made rigorous. We also show how the ``No Parallel Crossing requirement can be used to evaluate the provable glassiness of other correlated percolation models, by looking at models with more stable directions than the knights model. Finally, we show that the TBF proof does not generalize in any straightforward fashion for three-dimensiona
We present numerical evidence that most two-dimensional surface states of a bulk topological superconductor (TSC) sit at an integer quantum Hall plateau transition. We study TSC surface states in class CI with quenched disorder. Low-energy (finite-en
ergy) surface states were expected to be critically delocalized (Anderson localized). We confirm the low-energy picture, but find instead that finite-energy states are also delocalized, with universal statistics that are independent of the TSC winding number, and consistent with the spin quantum Hall plateau transition (percolation).
We study bond percolation on several four-dimensional (4D) lattices, including the simple (hyper) cubic (SC), the SC with combinations of nearest neighbors and second nearest neighbors (SC-NN+2NN), the body-centered cubic (BCC), and the face-centered
cubic (FCC) lattices, using an efficient single-cluster growth algorithm. For the SC lattice, we find $p_c = 0.1601312(2)$, which confirms previous results (based on other methods), and find a new value $p_c=0.035827(1)$ for the SC-NN+2NN lattice, which was not studied previously for bond percolation. For the 4D BCC and FCC lattices, we obtain $p_c=0.074212(1)$ and 0.049517(1), which are substantially more precise than previous values. We also find critical exponents $tau = 2.3135(5)$ and $Omega = 0.40(3)$, consistent with previous numerical results and the recent four-loop series result of Gracey [Phys. Rev. D 92, 025012, (2015)].
We study bond percolation on the simple cubic (SC) lattice with various combinations of first, second, third, and fourth nearest-neighbors by Monte Carlo simulation. Using a single-cluster growth algorithm, we find precise values of the bond threshol
ds. Correlations between percolation thresholds and lattice properties are discussed, and our results show that the percolation thresholds of these and other three-dimensional lattices decrease monotonically with the coordination number $z$ quite accurately according to a power law $p_{c} sim z^{-a}$, with exponent $a = 1.111$. However, for large $z$, the threshold must approach the Bethe lattice result $p_c = 1/(z-1)$. Fitting our data and data for lattices with additional nearest neighbors, we find $p_c(z-1)=1+1.224 z^{-1/2}$.
We describe a percolation problem on lattices (graphs, networks), with edge weights drawn from disorder distributions that allow for weights (or distances) of either sign, i.e. including negative weights. We are interested whether there are spanning
paths or loops of total negative weight. This kind of percolation problem is fundamentally different from conventional percolation problems, e.g. it does not exhibit transitivity, hence no simple definition of clusters, and several spanning paths/loops might coexist in the percolation regime at the same time. Furthermore, to study this percolation problem numerically, one has to perform a non-trivial transformation of the original graph and apply sophisticated matching algorithms. Using this approach, we study the corresponding percolation transitions on large square, hexagonal and cubic lattices for two types of disorder distributions and determine the critical exponents. The results show that negative-weight percolation is in a different universality class compared to conventional bond/site percolation. On the other hand, negative-weight percolation seems to be related to the ferromagnet/spin-glass transition of random-bond Ising systems, at least in two dimensions.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
